Consider the function f : R → R such that, for two defined constants a , b , f ( x ) = a − b a x − b x .
We know that f ( 0 ) = 0 , f ( 1 ) = 1 , f ( 2 ) = 2 , f ( 3 ) = 3 .
If f ( 4 ) = w 1 w 2 − w 3 , where w 1 , w 2 , w 3 are all integers with w 3 is square-free, find w 1 + w 2 + w 3 .
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.
Tricky but good problem! I already have f ( 4 ) = 2 ( 6 − 2 ) , but then i got tricked!
Another solution using linear recurrences:
It can be proved that the sequence f ( n ) = a − b a n − b n satisfies the recurrence relation f ( n + 2 ) = ( a + b ) f ( n + 1 ) − a b f ( n ) , ( ∗ ) for all non-negative integer number n . Using that f ( 2 ) = 2 and f ( 3 ) = 3 and the recurrence equation ( ∗ ) , It can be obtained that a + b = 2 and ( a + b ) 2 − a b = 3 . Then, a + b = 2 and a b = 2 − 3 . So, the recurrence relation ( ∗ ) can be written in the form f ( n + 2 ) = 2 f ( n + 1 ) − ( 2 − 3 ) f ( n ) , and making n = 2 , it follows that f ( 4 ) = 2 f ( 3 ) − ( 2 − 3 ) f ( 2 ) = 2 3 − ( 2 − 3 ) 2 = 2 6 − 2 2 = 4 2 − 3 .
Problem Loading...
Note Loading...
Set Loading...
The values for f ( 0 ) and f ( 1 ) are tautological. From the others, we get that f ( 2 ) = a − b a 2 − b 2 = a + b = 2 , f ( 3 ) = a − b a 3 − b 3 = a 2 + a b + b 2 = 3 .
By doing f ( 2 ) 2 − f ( 3 ) , we find out that a b = 2 − 3 . This way we can evaluate f ( 4 ) = a − b a 4 − b 4 = a 3 + a 2 b + a b 2 + b 3 .
Note that a 3 + a 2 b + a b 2 + b 3 = ( a + b ) 3 − 2 a b ( a + b ) , so f ( 4 ) = 2 ( 6 − 2 ) . Squaring this, we get f ( 4 ) 2 = 4 ( 6 + 2 − 4 3 ) = 1 6 ( 2 − 3 ) .
Applying the square root, we get it back as f ( 4 ) = 4 2 − 3 . Thus a + b + c = 9 .