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 ) = x − 2 1 , a sequence of real numbers x n can be constructed satisfying the property that x n ∈ ( R ∖ Dom ϕ n ) ∖ ( R ∖ Dom ϕ n − 1 ) , where ϕ n represents the composition of ϕ with itself n times, Dom f represents the domain of the function f , the notation A ∖ B represents the difference set of the sets A and B , R the set of all real numbers and n is any non-negative integer. Find n → ∞ lim 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 ) } .
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.
You got my vote!
It can be proved easily by Mathematical Induction that ϕ n ( x ) = a n x + b n a n − 1 x + b n − 1 , where the sequences a n and b n satisfy the recurrence relations a n + 2 = − 2 a n + 1 + a n , and b n + 2 = − 2 b n + 1 + b n , respectively, and a 0 = 0 , a 1 = 1 , b 0 = 1 , and b 1 = − 2 . Using the theory of Linear Recurrence Relations, it follows that a n = − 2 2 1 ( ( − 1 − 2 ) n − ( − 1 + 2 ) n ) and b n = 4 1 ( ( 2 + 2 ) ( − 1 − 2 ) n + ( 2 − 2 ) ( − 1 + 2 ) n ) Besides that, it can also be proved that ( R ∖ Dom ϕ n ) ∖ ( R ∖ Dom ϕ n − 1 ) = { a n − b n } . This seems to be obvious, but is not. We would need to verify that the sequences { − a n b n } does not have repeated terms, but this can be verified by direct calculation. Then x n = − a n b n . Using the formulas obtained above for a n and b n and making r = − 1 − 2 − 1 + 2 , it follows that x n = 2 2 ( 1 − r n 2 + 2 + ( 2 − 2 ) r n ) Since ∣ r ∣ < 1 , it is easy to compute that lim n → ∞ x n = 1 + 2 ≈ 2 . 4 1 4 .
Problem Loading...
Note Loading...
Set Loading...
Checking the domains, it is clear that D o m ϕ D o m ϕ 2 D o m ϕ 3 ⋯ D o m ϕ n = R \ { 2 } = R \ { 2 , ϕ − 1 ( 2 ) } = R \ { 2 , ϕ − 1 ( 2 ) , ( ϕ − 1 ) 2 ( 2 ) } = ⋯ = R \ { 2 , ϕ − 1 ( 2 ) , ( ϕ − 1 ) 2 ( 2 ) , . . . , ( ϕ − 1 ) n − 1 ( 2 ) } which means that we must have x n = ( ϕ − 1 ) n − 1 ( 2 ) n ≥ 2 x 1 = 2 In other words. we have the recurrence relation x n = 2 + x n − 1 − 1 n ≥ 2 x 1 = 2 If we consider a = 1 + 2 , then a = 2 + a − 1 , and hence x n − a = x n − 1 − 1 − a − 1 = a x n − 1 1 ( a − x n − 1 ) n ≥ 2 It is a simple induction to see that x n ≥ 2 for all n ≥ 2 , and hence ∣ a n − a ∣ ≤ 2 a 1 ∣ x n − 1 − a ∣ n ≥ 2 and, since 2 a > 1 , we deduce that lim n → ∞ x n = a = 1 + 2 .