Limit of a Weird Sequence

Calculus Level 3

We assume that the domain of a function given by a formula is the largest possible set of real numbers where the function is defined. Given the function ϕ ( x ) = 1 x 2 , \phi(x)=\frac{1}{x-2}, a sequence of real numbers x n x_n can be constructed satisfying the property that x n ( R Dom ϕ n ) ( R Dom ϕ n 1 ) , x_n \in (\mathbb{R}\setminus\text{Dom} \: \phi^n) \setminus (\mathbb{R}\setminus\text{Dom} \: \phi^{n-1}), where ϕ n \phi ^n represents the composition of ϕ \phi with itself n n times, Dom f \text{Dom}\: f represents the domain of the function f , f, the notation A B A\setminus B represents the difference set of the sets A A and B , B, R \mathbb{R} the set of all real numbers and n n is any non-negative integer. Find lim n x n \lim_{n\rightarrow\infty} x_n rounded to 3 decimal places if it exists. If the limit does not exists, enter 333.

Note : In this problem, you should use the fact that Dom ( f o g ) = Dom ( g ) { x R g ( x ) Dom ( f ) } . \text{Dom}(f\text{o}g)=\text{Dom}(g) \cap \{x\in \mathbb{R}| g(x)\in \text{Dom}(f)\}.


The answer is 2.414.

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

Mark Hennings
Aug 22, 2019

Checking the domains, it is clear that D o m ϕ = R \ { 2 } D o m ϕ 2 = R \ { 2 , ϕ 1 ( 2 ) } D o m ϕ 3 = R \ { 2 , ϕ 1 ( 2 ) , ( ϕ 1 ) 2 ( 2 ) } = D o m ϕ n = R \ { 2 , ϕ 1 ( 2 ) , ( ϕ 1 ) 2 ( 2 ) , . . . , ( ϕ 1 ) n 1 ( 2 ) } \begin{aligned} \mathrm{Dom}\,\phi & = \; \mathbb{R} \backslash \{2\} \\ \mathrm{Dom}\,\phi^2 & = \; \mathbb{R} \backslash \{2,\phi^{-1}(2)\} \\ \mathrm{Dom}\,\phi^3 & = \; \mathbb{R} \backslash \{2,\phi^{-1}(2),(\phi^{-1})^2(2)\} \\ \cdots & = \; \cdots \\ \mathrm{Dom}\,\phi^n & = \; \mathbb{R} \backslash \{2,\phi^{-1}(2),(\phi^{-1})^2(2),...,(\phi^{-1})^{n-1}(2)\} \\ \end{aligned} which means that we must have x n = ( ϕ 1 ) n 1 ( 2 ) n 2 x 1 = 2 x_n \; = \; (\phi^{-1})^{n-1}(2) \hspace{1cm} n \ge 2 \hspace{2cm} x_1 = 2 In other words. we have the recurrence relation x n = 2 + x n 1 1 n 2 x 1 = 2 x_n \; = \;2 + x_{n-1}^{-1} \hspace{1cm} n\ge 2 \hspace{2cm} x_1 = 2 If we consider a = 1 + 2 a = 1 + \sqrt{2} , then a = 2 + a 1 a = 2 + a^{-1} , and hence x n a = x n 1 1 a 1 = 1 a x n 1 ( a x n 1 ) n 2 x_n - a \; = \; x_{n-1}^{-1} - a^{-1} \; = \; \frac{1}{ax_{n-1}}(a - x_{n-1}) \hspace{2cm} n\ge 2 It is a simple induction to see that x n 2 x_n \ge 2 for all n 2 n \ge 2 , and hence a n a 1 2 a x n 1 a n 2 |a_n - a| \; \le \; \tfrac{1}{2a}|x_{n-1}-a| \hspace{2cm} n \ge 2 and, since 2 a > 1 2a > 1 , we deduce that lim n x n = a = 1 + 2 \lim_{n \to \infty}x_n = a = \boxed{1 + \sqrt{2}} .

You got my vote!

Arturo Presa - 1 year, 9 months ago
Arturo Presa
Aug 21, 2019

It can be proved easily by Mathematical Induction that ϕ n ( x ) = a n 1 x + b n 1 a n x + b n , \phi^n(x)=\frac{a_{n-1}x+b_{n-1}}{a_{n}x+b_{n}}, where the sequences a n a_n and b n b_n satisfy the recurrence relations a n + 2 = 2 a n + 1 + a n , a_{n+2}=-2 a_{n+1}+a_n, and b n + 2 = 2 b n + 1 + b n , b_{n+2}=-2 b_{n+1}+b_n, respectively, and a 0 = 0 , a 1 = 1 , b 0 = 1 , a_0=0, a_1=1, b_0=1, and b 1 = 2. b_1=-2. Using the theory of Linear Recurrence Relations, it follows that a n = 1 2 2 ( ( 1 2 ) n ( 1 + 2 ) n ) a_n= -\frac{1}{2\sqrt 2}((-1-\sqrt 2 )^n-(-1+\sqrt 2)^n) and b n = 1 4 ( ( 2 + 2 ) ( 1 2 ) n + ( 2 2 ) ( 1 + 2 ) n ) b_n= \frac{1}{4}((2+\sqrt 2)(-1-\sqrt 2 )^n+(2-\sqrt 2)(-1+\sqrt 2)^n) Besides that, it can also be proved that ( R Dom ϕ n ) ( R Dom ϕ n 1 ) = { b n a n } . (\mathbb{R}\setminus\text{Dom} \: \phi^n) \setminus (\mathbb{R}\setminus\text{Dom} \: \phi^{n-1})=\{\frac{-b_n}{a_{n}}\}. This seems to be obvious, but is not. We would need to verify that the sequences { b n a n } \{-\frac{b_n}{a_n} \} does not have repeated terms, but this can be verified by direct calculation. Then x n = b n a n . x_n=-\frac{b_n}{a_n}. Using the formulas obtained above for a n a_n and b n b_n and making r = 1 + 2 1 2 r=\frac{-1+\sqrt 2}{-1-\sqrt 2} , it follows that x n = 2 2 ( 2 + 2 + ( 2 2 ) r n 1 r n ) x_n=\frac{\sqrt 2}{2}\left(\frac{2+\sqrt 2+(2-\sqrt 2)r^n}{1-r^n}\right) Since r < 1 , |r|<1, it is easy to compute that lim n x n = 1 + 2 2.414. \lim_{n\rightarrow\infty}x_n= 1+\sqrt{2}\approx \boxed{2.414.}

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...