Let x 0 , x 1 , x 2 , … be a sequence of real numbers satisfying the recursion,
x n = 3 x n − 1 x n − 2 x n − 3
for n > 2 .
If x 0 = 1 , x 1 = 1 and x 2 = 1 0 0 0 0 what is
n → ∞ lim x n ?
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.
Thx \(\color {blue}{ @Geoff Pilling }\) for citation. For detailed solution to this recurrence relation, please see my O n e . . . T w o . . . T h r e e . . . I n f i n i t y ! @Geoff Pilling Link to my solution is here: https://brilliant.org/problems/one-two-three-infinity/
@Rajen Kapur So, can you send me a pointer to "One...Two...Three...Infinity!" ? Somehow I can't find it.
Problem Loading...
Note Loading...
Set Loading...
If A n = l o g ( x n ) , then A 0 = 0 , A 1 = 0 , and A 2 = 4, and the recursion relation becomes, A n = 3 A n − 1 + A n − 2 + A n − 3
This series converges to A ∞ = 2 .
Therefore, x ∞ = 1 0 0
Thanks to @Rajen Kapur for the technique! :^)