A sequence of functions { f n ( x ) } is defined recursively as follows:
f 1 ( x ) f n + 1 ( x ) = x 2 + 4 8 , and = x 2 + 6 f n ( x ) for n ≥ 1 . .
For each positive integer n , if there is only one real solution of the equation f n ( x ) = 2 x , find that solution.
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.
How can we show that this solution is unique?
Related problem: find all x such that f n ( x ) = 2 x for some n (only at least one n needed, instead of *all n ).
For every integer there is only one solution. So let's take n = 1
f 1 ( x ) = 2 x x 2 + 4 8 = 2 x x 2 + 4 8 = 4 x 2 3 x 2 = 4 8 x 2 = 1 6 x = ± 4
Since x is positive, x = 4
You have only shown that x = 4 is true for f 1 ( x ) . You have to show that it is true for all n .
Log in to reply
Exactly (+1), by induction it can be easily solved...
Log in to reply
It's already given that it is true for all n
Log in to reply
@Viki Zeta – The word "if" is there.
Log in to reply
@Chew-Seong Cheong – You also need to show if the solution is unique.
As stated, you only need to find one solution (because the problem claims that there is exactly one solution, which also applies for all n ). If the problem asks to prove that there is a unique solution for all n , then it should say that.
Log in to reply
Then we don't need the equation f n + 1 ( x ) = x 2 + 6 f n ( x ) for n ≥ 1 to solve the problem. The problem was not worded properly.
Log in to reply
@Chew-Seong Cheong – Exactly, the problem is not worded properly. It doesn't fit to Brilliant's short answer format. One possible change is something like "let S be the set of all solutions x for which f n ( x ) = 2 x for some n ; find the sum of elements of S ".
You reasoing is true if and only if the problem is right, and for seeing the problem is right you have to give a right solution which is given for Chew. Priyanshu Mishra, my appologies if I am offending, makes 1 out of 2 problems wrong... And the worst, they got level 4 or 5... because people give a right answer when the problem is wrong...
I would appreciate if the solution could step beyond the limits of Brilliant's answering mechanism, and get to the heart of the problem. There isn't a point in giving a solution of "I entered the answer of 4 and you told me I was correct hence I am correct".
Let's aim for a higher standard of knowledge and understanding, rather than just gaming the system.
Problem Loading...
Note Loading...
Set Loading...
If f n ( x ) = 2 x is true for n = 1 , then
x 2 + 4 8 x 2 + 4 8 ⟹ 3 x 2 x ⟹ f 1 ( x ) = 2 x = 4 x 2 = 4 8 = 4 = 2 ( 4 ) = 8 Since f 1 ( x ) ≥ 0
Let us check if the claim f n ( x ) = 8 is true for all n ≥ 1 by induction.
f n + 1 ( x ) = x 2 + 6 f n ( x ) = 4 2 + 6 ( 8 ) = 1 6 + 4 8 = 8
Therefore, the claim f n ( x ) = 8 is also true for n + 1 and it is true for all n ≥ 1 .
Therefore, the solution is x = 4 .