Finding Smallest N for Infinite Sequence: (2n)^(1/n) < 0.01

  • Context: Graduate 
  • Thread starter Thread starter aceetobee
  • Start date Start date
  • Tags Tags
    Infinite Sequence
Click For Summary

Discussion Overview

The discussion revolves around finding the smallest integer value of N such that the sequence (2n)^(1/n) is within 0.01 of its limit, specifically focusing on the inequality abs((2n)^(1/n) - 1) < 0.01. Participants explore both numerical and theoretical approaches to determine this value, engaging in mathematical reasoning and estimation techniques.

Discussion Character

  • Exploratory
  • Mathematical reasoning
  • Technical explanation

Main Points Raised

  • One participant suggests that through trial and error, the value of N is found to be 734, but seeks a theoretical solution.
  • Another participant proposes that since the sequence approaches the limit from above, one can simplify the problem to (2n)^(1/n) < 1.01 and suggests using logarithms to estimate an upper bound for N.
  • A different participant provides a more detailed logarithmic approach, stating that for large n, the term log(2n) can be approximated, leading to an estimate of n = 60.
  • One participant challenges the estimate of n = 60 by calculating (2*60)^(1/60) and finding it to be approximately 0.08, suggesting that 733 might be the correct answer while still seeking alternative methods.
  • Another participant discusses an approach involving raising both sides of the inequality to the nth power and expanding the right-hand side using a series expansion, proposing a method to find an upper bound for N by truncating the series after a few terms.

Areas of Agreement / Disagreement

Participants express differing views on the correct value of N, with some proposing estimates around 60 and others suggesting 734 or 733. There is no consensus on a definitive theoretical solution, and multiple approaches are presented without agreement on which is superior.

Contextual Notes

Participants note that the estimates depend on assumptions about the behavior of the logarithmic terms and the truncation of series, which may affect the accuracy of their proposed solutions.

aceetobee
Messages
6
Reaction score
0
I want to find the smallest value of N (n > N) such that the following is true:

abs((2n)^(1/n) - 1) < 0.01

So basically, I'm looking for the term of the sequence (2n)^(1/n) which is less than 0.01 from the limit of the sequence... by trial and error, I found it to be 734.

But I'm looking ofr a theoretical solution. Any help as to what I'm missing here?

Thanks.
 
Physics news on Phys.org
Well, the sequence approaches the limit from above, so you can just write (2n)1/n<1.01. From here, I would take the log of both sides. You probably won't be able to solve for the minimum value of N exactly without a calculator, but you should be able to use some estimates to get an upper bound that isn't too bad.
 
So you're looking for the value n so :

[tex]|(2n)^{1/n}-1|<0.01[/tex] then i must be satisfied that.

[tex](2n)^{1/n}<1.01[/tex] taking log at both sides you have:

[tex]\frac{log2}{n^2 }+\frac{logn}{n^2 }<log(1.01)=0.00995033[/tex]


for big n n>100 we can ignore the first term and have:

[tex]log(n) < n^2(0.00995033)[/tex] trying several n we have that n=60
 
Hmmm... (2*60)^(1/60) - 1 is approx 0.08

I think 733 is the answer, but I still think there must be another way besides trial and error / using the calculator
 
Actually, the easiest way to do it by hand is probably to raise both sides to the nth power and then expand the RHS:

[tex](2n)^{1/n}<1.01[/tex]

[tex]2n<(1.01)^n=(1+\frac{1}{100})^n=1+n \cdot \frac{1}{100}+\frac{n(n-1)}{2} \cdot \frac{1}{100^2}+...[/tex]

Now, if you replace the RHS by something that is smaller than it, and find an n such that the LHS is smaller than this new RHS, you know the LHS will also be smaller than the original RHS at this n. One way to do this is to truncate the series after the third term:

[tex]2n<1+n \cdot \frac{1}{100}+\frac{n(n-1)}{2}\cdot \frac{1}{100^2}\leq(1.01)^n[/tex]

Now solve for the smallest n that satisfies this first inequality and you'll get an upper bound on the smallest n for the original inequality. If you wanted to get better accuracy you could add more terms, but this would become harder to solve.
 

Similar threads

  • · Replies 14 ·
Replies
14
Views
2K
  • · Replies 3 ·
Replies
3
Views
2K
  • · Replies 7 ·
Replies
7
Views
3K
  • · Replies 24 ·
Replies
24
Views
7K
  • · Replies 1 ·
Replies
1
Views
2K
  • · Replies 7 ·
Replies
7
Views
2K
  • · Replies 10 ·
Replies
10
Views
3K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 3 ·
Replies
3
Views
1K
  • · Replies 16 ·
Replies
16
Views
3K