Define f 0 ( x ) = 1 − x 2 .
Now, for n > 0 recursively define f n ( x ) = 2 1 ( f n − 1 ( x ) + f n − 1 ( x − 2 n − 1 1 ) ) .
For n > 0 , the domain of f n ( x ) is − 1 + k = 0 ∑ n − 1 2 k 1 ≤ x ≤ 1
If n → ∞ lim f n ( 1 ) = b π a for positive integers a , b , find a + b .
Helpful hints:
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.
The limit n → ∞ lim 2 n + 1 k = 1 ∑ 2 n + 1 1 − ( 1 − 2 n k − 1 ) 2 is a Riemann sum for ∫ 0 2 2 1 − ( 1 − x ) 2 d x = 4 π .
Log in to reply
Oh, wow, never thought of it this way. I don't have too much experience working with Riemann Sums but I think I see how this works. Thanks for the insight!
Why does the average converge to pi/4?
Problem Loading...
Note Loading...
Set Loading...
The biggest hint is given in which f 2 ( x ) is shown to be the average of ( the average of ( the functions f ( x ) and f ( x − 1 ) ) and the average of ( f ( x − . 5 ) and f ( x − 1 . 5 ) ) ) . This continuous averaging will eventually be the expected value of a point on the upper half of the circle y = 1 − x 2 which is π / 4
Purple, red, green, and blue represent f 0 , 1 , 2 , 3 ( x ) respectively.
Using AVT (essentially this is geometry and not really calculus since the area of any 2D figure is base*avg height).
Avg height= b a s e A r e a = 2 π / 2 = 4 π
If you try to evaluate this algebraically as a sum, it comes out to
n → ∞ lim 2 n + 1 k = 1 ∑ 2 n + 1 1 − ( 1 − 2 n k − 1 ) 2 .
I have no idea how to solve this by hand and wolfram can only handle this up to n = 1 2