A sequence is defined recursively by
x n + 1 = 4 x n + 1 0 6 x n + 3 5
where x 0 = 1 0 .
What is n → ∞ lim x n ?
Bonus: If x 0 were equal to 2 0 , would that change the limit?
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.
We have to prove that x n converges before we can set x n + 1 = x n .
Log in to reply
How do you prove that ? I'd like to see your solution.
Log in to reply
I don't know. But we need to do that. I was trying to find a solution.
Your treatment of this as an iterated function system with a single stable fixed point is enough to show x n converges, as long as x 0 is not the other fixed point; note that the equation 4 x + 1 0 6 x + 3 5 = − 2 7 only has one root.
I've put up an explicit form for x n in my solution.
x n > 0 means 4 x n + 1 0 > 0 and 6 x n + 3 5 > 0 Which means if x n > 0 then 6 x n + 3 5 4 x n + 1 0 > 0 which means x n + 1 > 0 . By induction x n is always positive. So -7/2 can't be the limit.
Log in to reply
Yes, but what if x 0 is negative ?
Log in to reply
I'm not sure. We only need to prove that for some integer i , x i > 0 using the previous logic for all n > i , x n > 0 . Or we can use your method. (Which I still can't quite fathom btw. For example, why did we find the derivative?)
Log in to reply
@Halim Amran – There's a theorem about this. I am just using it. The theorem says that is if x n + 1 = f ( x n ) and a number a exists such that a = f ( a ) , then x = a is a stable fixed point if ∣ f ′ ( a ) ∣ < 1 , and is unstable if ∣ f ′ ( a ) ∣ > 1 .
The neatest way to answer this question is @Hosam Hajjir 's solution. However, we can actually solve the recurrence with some substitutions.
Anticipating the result, let y n = x n − 2 5 . The recurrence then becomes y n + 1 = 5 + y n 5 − 1 , y 0 = 2 1 5 Now let z n = y n 1 , and substitute again to get z n + 1 = − 1 − 5 z n , z 0 = 1 5 2
This is just a linear recurrence, with solution z n = ( − 5 ) n ( z 0 + 6 1 ) − 6 1
Clearly this tends to infinity as n tends to infinity; so y n → 0 and x n → 2 5 .
An explicit form for x n is x n = 2 5 − 9 ⋅ ( − 5 ) n − 1 + 1 6
which again shows that x n converges to 2 5 .
Thank you @Chris Lewis for your solution. However, I think you need to review some or all of the equations in your solution.
Log in to reply
Could you be more specific? I've checked and these seem to work. (I've now seen your second question which also gets an exact form - the results are the same, just written differently)
So I've been doing part two for DAYS substituting nonsense. From where did u get the idea of substituting y n = x n − 5 / 2 ?
The approach used by @Hosam Hajjir , is assuming that x n converges when n → ∞ . Strictly, we have to prove that x n converges before we can use the approach. The proof comes from the part 2 of this problem. It is given in the part 2 that x n can be expressed as:
x n = c λ n − d a + b λ n
where a , b , c , and d are positive integers and λ a negative integer. Then we have
n → ∞ lim x n = n → ∞ lim c λ n − d a + b λ n = c − λ n d λ n a + b = c b for ∣ λ ∣ > 1
So x n converges if ∣ λ ∣ > 1 . It is founded that λ = − 5 , therefore x n as n → ∞ . Let the limit be L , then
x n n → ∞ lim x n L 4 L 2 + 1 0 L 4 L 2 + 4 L − 3 5 ( 2 L − 5 ) ( 2 L + 7 ) ⟹ L = 4 x n + 1 0 4 x n + 3 5 = n → ∞ lim 4 x n + 1 0 4 x n + 3 5 = 4 L + 1 0 6 L + 3 5 = 6 L + 3 5 = 0 = 0 = 2 5 Since x n > 0 ∀ n ≥ 0 , L > 0
Problem Loading...
Note Loading...
Set Loading...
We have,
x n + 1 = f ( x n ) = 4 x n + 1 0 6 x n + 3 5
Setting x n + 1 = x n = x , results in the quadratic equation x ( 4 x + 1 0 ) = 6 x + 3 5 , which after re-arranging, becomes,
4 x 2 + 4 x − 3 5 = 0
which factors into ( 2 x − 5 ) ( 2 x + 7 ) = 0 , so the possible limits are 2 5 and − 2 7 . To determine which is the limit, we find the derivative of the recursion function f ( x ) ,
f ′ ( x ) = ( 4 x + 1 0 ) 2 − 8 0
It is easy to check that ∣ f ( 2 5 ) ∣ < 1 , and that ∣ f ( 2 − 7 ) ∣ > 1 , therefore, the limit is 2 5 .