Sequence Of Cube Roots

Calculus Level 2

A sequence adheres to the recursion relation a n = a n 1 a n 2 a n 3 3 a_{n}=\sqrt[3]{a_{n-1}a_{n-2}a_{n-3}} with initial terms a 0 = 1 , a 1 = 2 , a 2 = 1 a_{0}=1,a_{1}=2,a_{2}=1 .

As n n tends to infinity, what is the limit of a n a_n correct to 2 decimal places?


The answer is 1.26.

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.

2 solutions

Hun-Min Park
Feb 25, 2014

Let b n = log a n b_n =\log a_n . Then

b n = 1 3 b n 1 + 1 3 b n 2 + 1 3 b n 3 , b 0 = 0 , b 1 = log 2 , b 2 = 0 \displaystyle b_n=\frac{1}{3}b_{n-1}+\frac{1}{3}b_{n-2}+\frac{1}{3}b_{n-3}, b_0=0, b_1=\log 2, b_2=0

The characteristic polynomial of the sequence { b n } \{b_n\} is

p ( x ) = x 3 1 3 x 2 1 3 x 1 3 \displaystyle p(x)=x^3-\frac{1}{3}x^2-\frac{1}{3}x-\frac{1}{3}

p ( x ) p(x) have three roots; x = 1 , 1 3 ± 2 3 i \displaystyle x=1, -\frac{1}{3}\pm \frac{\sqrt{2}}{3}i , so b n b_n is given as

b n = A + B w 1 n + C w 2 n ( w 1 = 1 3 + 2 3 i , w 2 = 1 3 2 3 i ) \displaystyle b_n=A+Bw_1 ^n+Cw_2 ^n\quad \left(w_1=-\frac{1}{3}+ \frac{\sqrt{2}}{3}i, w_2=-\frac{1}{3}- \frac{\sqrt{2}}{3}i\right)

for some constant A , B , C A, B, C .

As w 1 = w 2 = 1 3 < 1 \displaystyle |w_1|=|w_2|=\frac{1}{\sqrt{3}}<1 , lim n w 1 n = lim n w 2 n = 0 \displaystyle \lim_{n\to \infty} w_1 ^n=\lim_{n\to\infty} w_2 ^n=0 . So

lim n b n = lim n ( A + B w 1 n + C w 2 n ) = A \displaystyle \lim_{n\to\infty} b_n=\lim_{n\to\infty}(A+Bw_1 ^n+Cw_2 ^n)=A

Besides, the initial condition b 0 = 0 , b 1 = log 2 , b 2 = 0 b_0=0, b_1=\log 2, b_2=0 gives a system of equations for A , B , C A, B, C ; solving this gives A = 1 3 log 2 \displaystyle A=\frac{1}{3}\log 2 .

Therefore

lim n b n = 1 3 log 2 lim n a n = e 1 3 log 2 = 2 1 3 \displaystyle \lim_{n\to\infty} b_n=\frac{1}{3}\log 2 \quad \therefore \lim_{n\to\infty} a_n=e^{\frac{1}{3} \log 2}=2^{\frac{1}{3}}

Very well done............I was doing like this and when I landed with the cubic I was stuck, then what I did was another way which was pretty trivial. After checking for the first few terms I saw that each a n = 2 b a_{n}=2^b where b = 3 n 3 + t 3 n 2 b=\frac{3^{n-3 }+t}{3^{n-2}} , where t t is a real number much less that 3 n 2 3^{n-2} ..............this claim can be proved real easily through induction. Taking the limit, the required answer is found.

Jit Ganguly - 7 years, 3 months ago

Lovely solution! I have never seen recurrence relations of this form before and the problem sufficiently stumped me haha.

Chantry Cargill - 7 years, 3 months ago

Hm, 1.26 would have been a better answer, since 2 1 3 = 1.2599 2^ \frac{1}{3} = 1.2599\ldots .

I will update this accordingly.

Calvin Lin Staff - 7 years, 3 months ago

Could u please tell how did u generate polynomial function for series

Aayush Patni - 5 years, 3 months ago

So, it is basically a small variation on the problem with a 1 , a 2 , a 3 = 1 , 2 , 3 a_1, a_2, a_3 = 1, 2, 3 and a n + 3 = ( a n + 2 + a n + 1 + a n ) / 3 a_{n+3} = (a_{n+2} + a_{n+1} + a_n)/3 . (I could not include a link to that problem; it is in the same quiz.) By taking base-2 logarithms, the initial values become: 0, 1, 0, and it is clear that all values are (real) powers of 2.

Tom Verhoeff - 4 years, 3 months ago

This is a nice solution, comprehensible one

A Former Brilliant Member - 2 years, 3 months ago
Tony Vista
Apr 5, 2016

I get the answer, but I don't feel right with my method, please point out for me. a n = a n 1 a n 2 a n 3 3 . . . ( 1 ) a_{n}=\sqrt[3]{a_{n-1}a_{n-2}a_{n-3}}...(1)

a n 3 = a n 1 a n 2 a n 3 a_{n}^3=a_{n-1}a_{n-2}a_{n-3}

( a n 3 ) 3 = a n 1 3 a n 2 3 a n 3 3 (a_{n}^3)^3=a_{n-1}^3 a_{n-2}^3 a_{n-3}^3

= a n 2 a n 3 2 a n 4 3 a n 5 2 a n 6 =a_{n-2}a_{n-3}^2a_{n-4}^3a_{n-5}^2a_{n-6}

= a n 2 a n 3 2 a n 5 3 a n 6 2 a n 7 =a_{n-2}a_{n-3}^2a_{n-5}^3a_{n-6}^2a_{n-7}

...

= a n 2 a n 3 2 a 2 3 a 1 2 a 0 =a_{n-2}a_{n-3}^2a_{2}^3a_{1}^2a_{0}

a n 3 = 4 a n 2 a n 3 2 3 . . . ( 2 ) \therefore\ a_{n}^3=\sqrt[3]{4a_{n-2}a_{n-3}^2}...(2)

( 2 ) ( 1 ) \displaystyle \frac{(2)}{(1)}

a n 2 = 4 a n 2 a n 3 2 a n 1 a n 2 a n 3 3 \displaystyle a_{n}^2=\sqrt[3]{ \frac {4a_{n-2}a_{n-3}^2} {a_{n-1}a_{n-2}a_{n-3} }}

a n = 4 a n 3 a n 1 6 \displaystyle a_{n}=\sqrt[6]{ \frac {4a_{n-3}} {a_{n-1} }}

As tends to infinity and limit a n a_{n} exists (said in the question and that is what we need to find), therefore a n 3 = a n 1 a_{n-3}=a_{n-1}

l i m n a n = 4 6 \displaystyle lim_{n\to\infty}a_{n}=\sqrt[6]{4}

It's absolutely right

Ariijit Dey - 3 years, 9 months ago

Nice method!!

Arunava Das - 3 years, 3 months ago

Seem to be right

Supratim Santra - 3 years, 1 month ago

Where can i post my solution 😂

hakim akacem - 2 years, 5 months ago

Convergence of this sequence can be obtained this way: Let u n = ln ( a n ) u_n=\ln(a_n) , therefore, u n + 3 = u n + 2 + u n + 1 + u n 3 u_{n+3}=\dfrac{u_{n+2}+u_{n+1}+u_n}{3} , and 3 X 3 X 2 X 1 = ( X 1 ) ( 3 X 2 + 2 X + 1 ) 3X^3-X^2-X-1=(X-1)(3X^2+2X+1) . So, 3 ( u n + 3 u n + 2 ) + 2 ( u n + 2 u n + 1 ) + ( u n + 1 u n ) = 0 3(u_{n+3}-u_{n+2})+2(u_{n+2}-u_{n+1})+(u_{n+1}-u_n)=0 . Since the roots of 3 X 2 + 2 X + 1 3X^2+2X+1 are all of modulus 3 3 < 1 \dfrac{\sqrt{3}}{3}<1 , u n + 1 u n u_{n+1}-u_n decreases exponentially to 0. It is therefore summable, hence u n u_n converging.

Maxence Seymat - 2 years, 1 month ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...