Finding the last term in sequence with a_n = log₂(a_{n-1})

  • Context: Undergrad 
  • Thread starter Thread starter murshid_islam
  • Start date Start date
Join the discussion
Registration is free. Ask a follow-up in this thread, or start your own.
1 reply · 2K views
murshid_islam
Messages
468
Reaction score
21
this is the problem:
let {ak} be a sequence of real numbers. and the sequence is defined as

[tex]a_0 = 2006[/tex]

[tex]a_{n} = \log_{2}a_{n-1}[/tex]

now i have to find out the number of terms in the sequence.

this is what i have done:
i see that a5 is negative. so we can't find out a6 or any other subsequent terms. so the number of terms is 6 (a0 upto a5).

but how can i find out the number of terms without calculating the terms upto a5? is there a way to do it?
 
Mathematics news on Phys.org
If [tex]a_{n} = \log_{2}a_{n-1}[/tex] is true, then [tex]2^{a_n} = a_{n-1)[/tex]

So this tells us [tex]2^{2^{2...^{2^{a_n}}}} = a_0[/tex] So find how many times you can put two to itself before it goes past 2006.

I think that works