1−1−1−⋱xxxx=1
Let fn(x) denote the recurrence relation, fn(x)=1−fn−1(x)x, where n=2,3,4,… with initial term f1(x)=x. Find the value of x satisfying n→∞limfn(x)=1.
In other words, find the value of x satisfying the equation above with the expression on the left hand side representing an infinitely nested fraction.
#Calculus
Easy Math Editor
This discussion board is a place to discuss our Daily Challenges and the math and science related to those challenges. Explanations are more than just a solution — they should explain the steps and thinking strategies that you used to obtain the solution. Comments should further the discussion of math and science.
When posting on Brilliant:
*italics*
or_italics_
**bold**
or__bold__
paragraph 1
paragraph 2
[example link](https://brilliant.org)
> This is a quote
\(
...\)
or\[
...\]
to ensure proper formatting.2 \times 3
2^{34}
a_{i-1}
\frac{2}{3}
\sqrt{2}
\sum_{i=1}^3
\sin \theta
\boxed{123}
Comments
There is no solution to the above, per the following:
Let y equal the continued fraction 1−1−1−⋱xxx. We know y=1. Also, we know 1−1−1−⋱xxx=1−yx. However, since y=1, this has a denominator of 0. Thus, there is no solution.
Note that this only works because the continued fraction equals 1. The method Otto and Ivan talk about is better for the fraction not equalling 1.
Log in to reply
This approach is equivalent to ours, pointing out that 1 fails to be a fixed point of the iteration.
view this. the topmost solution has
x12+kx22≥2kx1x2(1−k)x22+1−kkx32≥2kx2x3(1−1−kk)x32+⎝⎜⎛1−1−kkk⎠⎟⎞x42≥2k⋯⋯⎝⎜⎜⎜⎜⎜⎜⎛n-1 times1−1−1−.....kk⎠⎟⎟⎟⎟⎟⎟⎞xn−12+⎝⎜⎜⎜⎜⎜⎜⎜⎜⎜⎜⎛n times1−1−1−.....kkk⎠⎟⎟⎟⎟⎟⎟⎟⎟⎟⎟⎞xn2≥2kxnxn−1 we had the last term n times1−1−1−.....kkk=1 but when n aproaches ∞? we know that the max exists from here, then there must exist a k, right?
Log in to reply
No, how can you say the last term is equal to 1? All you can say is that
x12+x22+…+xn−12+1−1−…kkxn2≥2k⋅(x1x2+x2x3+…+xn−1xn)
where the tower has n−1 levels. You cannot simply let n going to infinity and assume that that last term will magically turn to 1.
Log in to reply
I dont understand what you're implying here.Assuming you have seen the solution to that problem, we see that it is Needed for that term to be one.From the second problem we see that the maximum value exists! why cant we conclude that there exists a x?
Log in to reply
Log in to reply
Log in to reply
k to allow you to add up everything.
Exactly because of this issue: there is no solution to the equation you shown, so you cannot pickLog in to reply
Log in to reply
k does
I did find the following interesting: for what1−1−1−…kkk
converge, and to what limit? From testing a few things, I suspect all k≤41 works, tending to 21−1−4k. If this is proven, this instantly tells that there is no solution to your equation (because the limit is never 1).
Log in to reply
f(x)=1−xk has fixed points at 21±1−4k for 0≤k≤0.25, and the sequence with the seed x0=k will increase towards the lower of those fixed point in that case... all this is quite easy to verify.
Yes, this is exactly right, Ivan! The iterationLog in to reply
k<0 also converge. And for completeness, we also need to prove that k>41 don't converge.
I find thatLog in to reply
k>0.25... if there are no fixed points, then it cannot converge.
AboutIf k<0, then all the terms will be negative, so, we certainly don't get solutions to your problem.
Log in to reply
Log in to reply
f(x)=x ;)
Simple...you find the fixed points by lettingLog in to reply
x=1−xkx2−x+k=0x=21±1−4k
Log in to reply
Log in to reply
Log in to reply
f(x)=1−xk has a pole at 1 for any non-zero k.
Actually, we did not have to do all this work. It suffices to point out that the iteration functionLog in to reply
Log in to reply
k) instead of f (with respect to x).
...oh, I misinterpreted the meaning of "fixed points" there; I thought fixed points of the limit (with respect toAdditionally, the fact that there is no fixed points thus it doesn't converge hinges on the fact that f is continuous, so that might need a mention.
What do you think @Otto Bretscher? sorry if this gives a way answer to your question but please have a look !
Log in to reply
Looks interesting... I will study your work when I have a block of free time