If S = 1 0 1 + 1 1 1 + 1 2 1 + ⋯ + 1 0 0 1 , then find the nearest possible value of S .
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
your solution should be in “top solutions"
Brilliant solution. Very nicely presented and explained. :)
Great solution.
Should the bounds of the integrals not be 10 to 101?
Log in to reply
Yes. You are right. Corrected it right away.
We may use the following approximation,
S = d 1 × l n 2 a − d 2 a + ( 2 n − 1 ) d
Where,
The series may be as,
a 1 , a + d 1 , . . . , a + ( n − 1 ) d 1
However, by this method the answer turns out to be 2 . 3 5 ,and so I took the best shot choosing the nearest option.😀
We use the well-known approximation H n = 1 1 + 2 1 + … + n 1 ≈ γ + ln n , where γ is the Euler-Mascheroni constant. We thus have
S = H 1 0 0 − H 9 ≈ γ + ln 1 0 0 − γ − ln 9 = ln 9 1 0 0 ≈ 2 . 4 0 8
Thus, we pick the closest answer, which happens to be 2 . 3 1 .
This isn't a new question. Despite a more exact value of 2.35840926367136, 2.30258509299405 is taken as an approximation.
∫ 1 0 1 0 0 x 1 d x = Ln ( 1 0 1 0 0 ) = Ln 10
Since there is only one nearest option, Ln 10 above is sufficient to determine the choice of 2.31.
Answer: 2.31
I did the same like harish sasikumar but I want to make an addon ...is it correct that we are doing this approximation by taking 1 unit width rectangles and so this width is making a larger bracket of limit...also is it possible through algebra that we get this exact answer from the first 2 decimal places??
Problem Loading...
Note Loading...
Set Loading...
Here, we try to find the upper & lower bounds of the sum. For clarity, refer to the graph given below.
∫ 1 0 1 0 1 x − 1 1 > S > ∫ 1 0 1 0 1 x 1 l o g 9 1 0 0 > S > l o g 1 0 1 0 1 2 . 4 1 > S > 2 . 3 1
The only choice in that bound is 2.31 .