See Original Golden Iterations I
Note: This problem has been updated with notes from Chris and Mark. Thank you!
You can find the value of ϕ = 2 1 + 5 by iteration. Start with x 1 = 1 and x 2 = 1 + x 1 = 1 . 4 1 4 2 . . . and for the ( n + 1 ) th iteration:
x n + 1 = 1 + x n
For large n , we can express the error term as ∣ e n ∣ = ∣ x n − ϕ ∣ . It can be shown that n → ∞ lim ∣ e n ∣ d ∣ e n + 1 ∣ = c b − a , where a , b , c are integers that do not have common divisors. Find a + b + c + d .
If you like this problem: Try out Golden Iterations III
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.
notice that lim n → ∞ x n = ϕ . let f ( x ) = 1 + x , then the limit in the problem is the absolute value of n → ∞ lim ( x n − ϕ ) d f ( x n ) − ϕ = x n → ϕ lim ( x n − ϕ ) d f ( x n ) − ϕ applying l'hopitals x n → ϕ lim ( x n − ϕ ) d f ( x n ) − ϕ = x n → ϕ lim d ( x n − ϕ ) d − 1 f ′ ( x n ) notice for d > 1 this diverges and for d < 1 it is 0 . hence d = 1 must be the solution, giving x n → ϕ lim 1 ( x n − ϕ ) 1 − 1 f ′ ( x n ) = f ′ ( ϕ ) = − 2 1 + ϕ 1 = − 2 ϕ 1 = − 4 5 − 1
Observe that e n + 1 = 1 + x n − φ = 1 + φ + e n − φ . So we can express the limit in terms of e n approaching 0.
lim e → 0 e d 1 + φ + e − φ
Both numerator and denominator evaluate to 0 for e = 0 , so we use l'Hôpital's rule.
lim e → 0 d e d e d d e d 1 + φ + e − φ = lim e → 0 d e d − 1 2 1 + φ + e 1 = lim e → 0 2 d e d − 1 1 + φ + e 1
This value is independent of e when we choose d=1. Our limit then evaluates to
lim e → 0 2 1 + φ + e 1 = 2 φ 1 = 4 5 − 1 .
So we have a = 1 , b = 5 , c = 4 , d = 1 and a + b + c + d = 1 1
It is clear that lim n → ∞ x n = ϕ , so ∣ e n + 1 ∣ / ∣ e n ∣ d will diverge except if the numerator cancels the terms of the form of x n − ϕ in the denominator.
We have
∣ e n ∣ d ∣ e n + 1 ∣ = ∣ x n − ϕ ∣ d ∣ x n + 1 − ϕ ∣ .
We can rewrite the recursion of x n to find
x n + 1 2 − 1 = x n .
Inserting this in the previous equation
∣ e n ∣ d ∣ e n + 1 ∣ = ∣ x n + 1 2 − 1 − ϕ ∣ d ∣ x n + 1 − ϕ ∣ .
Using that ϕ 2 = ϕ + 1 , we get
∣ e n ∣ d ∣ e n + 1 ∣ = ∣ x n + 1 2 − ϕ 2 ∣ d ∣ x n + 1 − ϕ ∣ = ∣ ( x n + 1 − ϕ ) ( x n + 1 + ϕ ) ∣ d ∣ x n + 1 − ϕ ∣ .
Only if d = 1 will we prevent the divergence in the limit. The result will then be
n → ∞ lim ∣ e n ∣ d ∣ e n + 1 ∣ = n → ∞ lim ∣ ( x n + 1 + ϕ ) ∣ 1 = 2 ϕ 1 = 4 5 − 1 .
And so the answer is 5 + 1 + 4 + 1 = 1 1 .
Problem Loading...
Note Loading...
Set Loading...
Write x n = φ + ε n . (The " ε "s and " e "s from the question are the same in absolute value, but it's useful to work with the error term before taking the absolute value).
We have x n + 1 = 1 + x n = 1 + φ + ε n
Since φ 2 = 1 + φ , this can be rewritten as x n + 1 = φ 1 + 1 + φ ε n
Since for large n , ∣ ε n ∣ ≪ 1 , we can apply the binomial theorem to get
x n + 1 = φ ( 1 + 2 ( 1 + φ ) ε n ) + O ( ε n 2 )
Subtracting φ from both sides we get
ε n + 1 = 2 ( 1 + φ ) φ ε n + O ( ε n 2 ) = 2 φ ε n + O ( ε n 2 )
So in the limit, we have
ε n ε n + 1 = 2 φ 1 = 2 φ − 1 = 4 5 − 1
and finally ( a , b , c , d ) = ( 5 , 1 , 4 , 1 ) giving the answer a + b + c + d = 1 1 .