Finding Number of Terms in {ak} Sequence - Help Needed

  • Context: Undergrad 
  • Thread starter Thread starter murshid_islam
  • Start date Start date
Click For Summary
SUMMARY

The discussion focuses on determining the number of terms in the sequence defined by {ak}, where a_0 = 2006 and a_n = log₂(a_{n-1}). The conclusion is that the sequence contains 6 terms, from a_0 to a_5, as a_5 is negative, preventing the calculation of a_6. The user seeks a method to find the number of terms without direct computation, suggesting the use of exponentiation to express the relationship between terms.

PREREQUISITES
  • Understanding of logarithmic functions, specifically log base 2.
  • Familiarity with sequences and recursive definitions.
  • Basic knowledge of exponentiation and its properties.
  • Ability to analyze mathematical limits and behavior of sequences.
NEXT STEPS
  • Explore the properties of logarithmic functions in depth.
  • Learn about recursive sequences and their convergence.
  • Investigate methods for estimating limits of sequences without direct computation.
  • Study the implications of negative values in recursive sequences.
USEFUL FOR

Mathematicians, students studying sequences and series, educators teaching logarithmic functions, and anyone interested in recursive mathematical problems.

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
 

Similar threads

  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 11 ·
Replies
11
Views
2K
  • · Replies 5 ·
Replies
5
Views
2K
Replies
4
Views
2K
  • · Replies 2 ·
Replies
2
Views
3K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 15 ·
Replies
15
Views
4K