Leaps and bounds

Calculus Level 3

Let x n x_n be a positive root of the equation x n = x 2 + x + 1. x^n = x^2 + x + 1.

Find exp ( lim n n ( x n 1 ) ) . \displaystyle \exp\Big(\lim_{n \to \infty} n\left(x_n - 1\right)\Big).


Notation: exp ( a ) = e a \exp( a ) = e^a


The answer is 3.00.

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.

4 solutions

Mark Hennings
Aug 14, 2017

If we write u n = n ( x n 1 ) u_n = n(x_n - 1) , then ( 1 + 1 n u n ) n = 1 n 2 u n 2 + 3 n u n + 3 n 1 \big(1 + \tfrac{1}{n}u_n\big)^n \; = \; \tfrac{1}{n^2}u_n^2 + \tfrac{3}{n}u_n + 3 \hspace{2cm} n \ge 1 If n 4 n \ge 4 then 1 n 2 u n 2 + 3 n u n + 3 = ( 1 + 1 n u n ) n > 1 + n × 1 n u n + n ( n 1 ) 2 × 1 n 2 u n 2 2 n 3 n u n + n ( n 1 ) 2 2 n 2 u n 2 1 4 u n \begin{aligned} \tfrac{1}{n^2}u_n^2 + \tfrac{3}{n}u_n + 3 & = \; \big(1 + \tfrac{1}{n}u_n\big)^n \; > \; 1 + n \times \tfrac{1}{n}u_n + \tfrac{n(n-1)}{2} \times \tfrac{1}{n^2}u_n^2 \\ 2 & \ge \; \tfrac{n-3}{n}u_n + \tfrac{n(n-1) - 2}{2n^2}u_n^2 \; \ge \; \tfrac14u_n \end{aligned} and hence 0 < u n 8 0 < u_n \le 8 for all n 4 n \ge 4 . Thus it is now clear that lim n ( 3 + 3 n u n + 1 n 2 u n 2 ) = 3 \lim_{n\to\infty}\big(3 + \tfrac{3}{n}u_n + \tfrac{1}{n^2}u_n^2\big) \, = \, 3 , and hence lim n ( 1 + 1 n u n ) n = 3 \lim_{n \to \infty} \big(1 + \tfrac{1}{n}u_n\big)^n \; = \; 3 so that lim n n ln ( 1 + 1 n u n ) = ln 3 \lim_{n \to \infty} n\ln\big(1 + \tfrac{1}{n}u_n\big) \; = \; \ln3 Note that x 1 2 x 2 < ln ( 1 + x ) < x x - \tfrac12x^2 < \ln(1+x) < x for x > 0 x > 0 , and hence u n 1 2 n u n 2 < n ln ( 1 + 1 n u n ) < u n u n n ln ( 1 + 1 n u n ) < 1 2 n u n 2 32 n \begin{aligned} u_n - \tfrac{1}{2n}u_n^2 & < \; n\ln\big(1 + \tfrac{1}{n}u_n\big) \; < \; u_n \\ \left|u_n - n\ln\big(1 + \tfrac{1}{n}u_n\big)\right| & \; < \; \tfrac{1}{2n}u_n^2 \; \le \; \tfrac{32}{n} \end{aligned} for n 4 n \ge 4 . Thus we deduce that lim n ( u n n ln ( 1 + 1 n u n ) ) = 0 lim n u n = lim n n ln ( 1 + 1 n u n ) = ln 3 \begin{aligned} \lim_{n \to \infty} \left(u_n - n\ln\big(1 + \tfrac{1}{n}u_n\big)\right) & = \; 0 \\ \lim_{n \to \infty} u_n \; = \; \lim_{n \to \infty}n\ln\big(1 + \tfrac{1}{n}u_n\big) & = \; \ln3 \end{aligned} making the answer 3 \boxed{3} .

Could I know the reasoning behind the binomial expansion in the right side of the first inequality?

Muthuraman Shanmugam - 3 years, 9 months ago

Log in to reply

I figured it out. It's just the expansion of the bracket to power n (to the third term)

Muthuraman Shanmugam - 3 years, 9 months ago

Log in to reply

...as many terms as I needed to show that u n u_n was a bounded sequence...

Mark Hennings - 3 years, 9 months ago
Ramiro Leal
Aug 14, 2017

Proposition: Let x n R x_n\in\mathbb{R} be a positive root of x n = x 2 + x + 1 x^n=x^2+x+1 . Then, e lim n n ( x n 1 ) = 3 e^{\lim_{n\rightarrow\infty}n(x_n-1)}=3 .

Proof:

First, note that for x = 1 x=1 ,

1 n < 1 2 + 1 + 1 , n R 1^n<1^2+1+1, \forall n\in\mathbb{R}

Now let ε > 0 \varepsilon>0 . Because ( 1 + ε ) n (1+\varepsilon)^n is an increasing exponential, this means that given an ε > 0 \varepsilon>0 , N \exists N such that for all n N n\geq N

( 1 + ε ) n > ( 1 + ε ) 2 + ( 1 + ε ) + 1 (1+\varepsilon) ^n> (1+\varepsilon) ^2+ (1+\varepsilon) +1

Moreover, since the left hand side changes from less than to greater than as we go from 1 1 to 1 + ε 1+\varepsilon , by the continuity of polynomials we know that there must be a positive real root x n ( 1 , 1 + ε ) x_n\in(1, 1+\varepsilon) .

Thus, we can see that for n N n\geq N ,

1 2 + 1 + 1 < x n n < ( 1 + ε ) 2 + ( 1 + ε ) + 1 3 1 n < x n < ( 3 + 3 ε + ε 2 ) 1 n n ( 3 1 n 1 ) < n ( x n 1 ) < n ( ( 3 + 3 ε + ε 2 ) 1 n 1 ) 1^2+1+1<x_n^n< (1+\varepsilon)^2+ (1+\varepsilon)+1\\ \Rightarrow 3^{\frac{1}{n}}<x_n<(3+3\varepsilon +\varepsilon^2)^{\frac{1}{n}}\\ \Rightarrow n(3^{\frac{1}{n}}-1)< n(x_n-1)< n((3+3\varepsilon +\varepsilon^2)^{\frac{1}{n}}-1)

Therefore, α \text{}^\alpha

lim n n ( 3 1 n 1 ) lim inf n n ( x n 1 ) lim sup n n ( x n 1 ) lim n n ( ( 3 + 3 ε + ε 2 ) 1 n 1 ) \lim_{n\rightarrow\infty}n(3^{\frac{1}{n}}-1)\leq \liminf_{n\rightarrow\infty} n(x_n-1)\leq\limsup_{n\rightarrow\infty} n(x_n-1)\leq \lim_{n\rightarrow\infty}n((3+3\varepsilon +\varepsilon^2)^{\frac{1}{n}}-1)

Now, by using L'Hospital's rule, we can see that

lim n n ( 3 1 n 1 ) = lim n ( 3 1 n 1 ) 1 n = lim n 3 1 n ln 3 = ln 3 \lim_{n\rightarrow\infty}n(3^{\frac{1}{n}}-1)=\lim_{n\rightarrow\infty}\dfrac{(3^{\frac{1}{n}}-1)}{\frac{1}{n}}\\ = \lim_{n\rightarrow\infty}3^{\frac{1}{n}}\ln{3}\\ =\ln{3}

Similarly,

lim n n ( ( 3 + 3 ε + ε 2 ) 1 n 1 ) = ln ( 3 + 3 ε + ε 2 ) \lim_{n\rightarrow\infty}n((3+3\varepsilon +\varepsilon^2)^{\frac{1}{n}}-1)=\ln{(3+3\varepsilon +\varepsilon^2)}

This means that

ln 3 lim inf n n ( x n 1 ) lim sup n n ( x n 1 ) ln ( 3 + 3 ε + ε 2 ) \ln{3}\leq \liminf_{n\rightarrow\infty} n(x_n-1)\leq\limsup_{n\rightarrow\infty} n(x_n-1)\leq \ln{(3+3\varepsilon +\varepsilon^2)}

If we now take the limit as ε 0 \varepsilon\rightarrow 0 , we get

ln 3 lim inf n n ( x n 1 ) lim sup n n ( x n 1 ) ln 3 \ln{3}\leq \liminf_{n\rightarrow\infty} n(x_n-1)\leq\limsup_{n\rightarrow\infty} n(x_n-1)\leq \ln{3}

Thus, by the Squeeze Theorem,

lim inf n n ( x n 1 ) = lim sup n n ( x n 1 ) = ln 3 lim n n ( x n 1 ) = ln 3 e lim n n ( x n 1 ) = 3 \liminf_{n\rightarrow\infty}n(x_n-1)=\limsup_{n\rightarrow\infty}n(x_n-1)=\ln{3}\\ \Rightarrow \lim_{n\rightarrow\infty}n(x_n-1)=\ln{3}\\ \Rightarrow e^{\lim_{n\rightarrow\infty}n(x_n-1)}=3

Q . E . D . Q.E.D.


α \alpha Contribution by Mark Hennings

Your are assuming that the limit of n ( x n 1 ) n(x_n-1) exists right at the beginning, before you have applied de l'Hopital and the Squeeze Theorem. As it stands, you have determined what the limit must be if it exists.

What you need to do is note that l i m i n f n n ( x n 1 ) ln 3 l i m s u p n n ( x n 1 ) ln ( 3 + 3 ε + ε 2 ) \mathrm{lim\,inf}_{n\to\infty}n(x_n-1) \; \ge \; \ln3 \hspace{1cm} \mathrm{lim\,sup}_{n\to\infty}n(x_n-1) \; \le \; \ln(3+3\varepsilon+\varepsilon^2) And now let ε \varepsilon to 0 0 to deduce that the limit inferior and superior exist and are equal, so the limit exists.

Mark Hennings - 3 years, 10 months ago

Log in to reply

Thank you for the correction! I have updated the solution.

Ramiro Leal - 3 years, 10 months ago

What is the proof that there is a positive (real) root to the equation x^n = x^2 + x +1 for any positive n?

for n = 2, x = -1, not a positive root.

for n = large, must not x^n approach zero, which then leads to a quadratic formula with an imaginary part.

Stephen Rasey - 3 years, 9 months ago

Log in to reply

If we define f n ( x ) = x n x 2 x 1 f_n(x) = x^n - x^2 - x - 1 then f n ( 1 ) = 2 f_n(1) = -2 , while f n ( 2 ) = 2 n 7 > 0 f_n(2) = 2^n - 7 > 0 for all n 3 n \ge 3 . Thus we can find 1 < x n < 2 1 < x_n < 2 for all n 3 n \ge 3 . Since we are interested in the behaviour for large n n , we can cope with the nonexistence of x n x_n for n = 1 , 2 n = 1,2 .

Mark Hennings - 3 years, 9 months ago
Aareyan Manzoor
Aug 5, 2017

lets define the series u n = n ( x n 1 ) x n = 1 + u n n u_n=n(x_n-1)\to x_n=1+\dfrac{u_n}{n} when we plug it in the equation we have ( 1 + u n n ) n = u n 2 n 2 + 3 u n n + 3 \left(1+\dfrac{u_n}{n}\right)^n=\dfrac{u_n^2}{n^2}+3\dfrac{u_n}{n}+3 we can see that if u n u_n converges then using the defination of e e e u = 3 e^u=\boxed{3} . now all we need to do is show u n u_n converges. notice that if the series x n x_n is constant, the equation cannot be satisfied. same goes for polynomial series for x n x_n as the LHS diverges too fast.(exponential vs polynomial). so ofcourse that means the laurent series for x n x_n must not have any positive powers.and the independent term must be 1 otherwise we would have exponential vs constants or zero vs non zero constants. x n = 1 + k = 1 a k n k u n = a 1 + k = 2 a k n 1 k x_n=1+\sum_{k=1}^\infty a_k n^{-k}\to u_n=a_1+\sum_{k=2}^\infty a_k n^{1-k} ofcourse at infinity u n = a 1 u_n=a_1 showing a convergence.

The proof of convergence could be done much cleaner. You seem to be assuming that there is a Laurent series for x n x_n , which need not always be the case.

Calvin Lin Staff - 3 years, 10 months ago

Log in to reply

that was my best attempt to proving convergence, which probably wasnt good enough. can you show me the more cleaner way?

Aareyan Manzoor - 3 years, 10 months ago

Wow! I think this solution is more straight forward! I like this solution.

Kelvin Hong - 3 years, 9 months ago

Log in to reply

Note that this argument is not mathematically correct. The other solutions (esp Mark's) addresses the issues that I brought up, and deal with the bounding carefully.

Calvin Lin Staff - 3 years, 9 months ago
Teddy Lazebnik
Aug 15, 2017

Numerical solution: (matlab code) for i = 3:1000 a = zeros(1,i-3); p = [1, a, -1, -1, -1]; exp(i * (max(roots(p)) - 1)) end

But how do you know that the answer is exactly 3?

Pi Han Goh - 3 years, 9 months ago

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...