Let f n ( x ) satisfy the recurrence relation f n ( x ) = f 1 ( f n − 1 ( x ) ) for n = 2 , 3 , 4 , … and f 1 ( x ) = 2 x + 1 0 .
Evaluate n → ∞ lim f ( x ) .
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.
@Calvin Lin -check the solution and the problem
Log in to reply
When you observe that there is a pattern, do you best to prove it instead of just describing it. You came really close to explaining why f n ( x ) must have that form.
@Prakhar Bindal , @Rohit Kumar , @Josh Silverman - Try out the problem
@Calvin Lin - why has the problem not been rated yet?
Log in to reply
When you created the problem, you did not give it a seed level, so that delayed the start of the process. When we reviewed this problem, we gave it a seed level.
i will share an easier approach
As n tends to infinity n tends to n-1
therefore
fn(x) = f1(fn(x))
substitute values
fn(x) = fn(x)/2+10
therefore fn(x) = 20
This is incorrect. You first need to show that the limit exists.
Log in to reply
Fix x and note that f n ( x ) = f 1 n ( x ) where the exponent indicates the number of times f 1 is applied on x .
As f 1 is contraction mapping, the existence of the limit (for every fixed x ) follows by the Banach fixed point theorem.
Log in to reply
These things tend to go over my mind :P @Deeparaj Bhat
I rather meant the proof of Banach fixed point theorem.
Yep indeed i thought about this thing when i solved this problem . but as in the question no such option was available (limit does not exist then enter answer as.......) hence i thought of just solving it . now i am thinking of a way can you provide a way?
Log in to reply
Check out https://brilliant.org/problems/limits-part-1/
I have some doubt about this approach though it leads to correct answer @Prakhar Bindal
Log in to reply
nope its perfectly fine . this is one of the standard approach for dealing with such kind of summations
Log in to reply
I don't know whats exactly the issue but I cannot express at present
truly marvellous...............ab bhai infinity hai to koi farak nahi padta +1 karo ya -1 :P , you rock bro ! ( i upvoted it !(+1))
Relevant wiki: Linear Recurrence Relations - With Repeated Roots
f 1 ( x ) f n ( x ) ⟹ f n ( x ) f n ( x ) − 2 0 ⟹ g n g n g 1 2 c ⟹ c ⟹ g n f n ( x ) − 2 0 ⟹ f n ( x ) ⟹ n → ∞ lim f n ( x ) = 2 x + 1 0 = f 1 ( f n − 1 ( x ) ) = 2 f n − 1 ( x ) + 1 0 = 2 1 ( f n − 1 ( x ) − 2 0 ) = 2 1 g n − 1 = 2 n c = 2 c = 2 x − 1 0 = x − 2 0 = 2 n x − 2 0 = 2 n x − 2 0 = 2 n x − 2 0 + 2 0 = 2 0 Let g n = f n ( x ) − 2 0 Characteristic equation: 2 r − 1 = 0 ⟹ r = 2 1 Note that g 1 = f 1 ( x ) − 2 0 = 2 x − 1 0
Problem Loading...
Note Loading...
Set Loading...
From given conditions, we write f 2 ( x ) = 4 x + 2 3 0 f 3 ( x ) = 8 x + 4 7 0 f 4 ( x ) = 1 6 x + 8 1 5 0 and from above we write the general term as: f n ( x ) = 2 n x + 2 n − 1 1 0 + 2 0 + 4 0 + 8 0 + 1 6 0 + 3 2 0 . . . . . . + 1 0 × 2 n − 1 = 2 n x + 2 n − 1 1 0 × ( 1 + 2 + 4 + 8 + 1 6 + 3 2 . . . . . . + 2 n − 1 ) = 2 n x + 2 n − 1 1 0 × ( 2 n − 1 ) = 2 n x + 2 0 − 2 n − 1 1 0 ⇒ n → ∞ lim f ( x ) = 2 0