If f ( x ) = x x − 1 and g ( x ) = 3 − 9 x 3 x + 1 , what is the value of
k = 1 ∑ 2 5 2 0 ( f k ( 2 ) − g k ( 2 ) ) ?
This problem is posed by Ryan P .
Details and assumptions
Note: f k ( x ) denotes the composition of the function k times. For example, f 2 ( x ) = f ( 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.
Great job!
f ( x ) = x x − 1 = 1 − x 1
f 2 ( x ) = 1 − 1 − x 1 1 = 1 − x − 1 x = − x − 1 1
f 3 ( x ) = 1 − − x − 1 1 1 = 1 + x − 1 = x
f 4 ( x ) = x
Since f 4 ( x ) = f ( x ) , f n ( x ) has a period of 3 , that is f n ( x ) = f n ( m o d 3 ) ( x )
f ( 2 ) = f 4 ( x ) = f 7 ( 2 ) = … = f 2 5 1 8 ( 2 ) = 2 1 , total of 840 of them
f 2 ( 2 ) = f 5 ( 2 ) = f 8 ( 2 ) = … = f 2 5 1 9 ( 2 ) = − 1 , total of 840 of them
f 3 ( 2 ) = f 6 ( 2 ) = f 9 ( 2 ) = … = f 2 5 2 0 ( 2 ) = 2 , total of 840 of them
⇒ k = 1 ∑ 2 5 2 0 f k ( 2 ) = 8 4 0 ( 2 1 − 1 + 2 ) = 1 2 6 0
Similarly, g 2 ( x ) = 3 − 9 ( 3 − 9 x 3 x + 1 ) 3 ( 3 − 9 x 3 x + 1 ) + 1 = − 9 x 1
g 3 ( x ) = 3 − 9 ( − 9 x 1 ) 3 ( − 9 x 1 ) + 1 = 2 7 x + 9 − 3 + 9 x
g 4 ( x ) = g 2 ( g 2 ( x ) ) = − 9 ( − 9 x 1 ) 1 = x
g 5 ( x ) = x = g ( x )
g ( 2 ) = g 5 ( 2 ) = g 9 ( 2 ) = … = g 2 5 1 7 ( 2 ) = − 1 5 7 , total of 630 of them
g 2 ( 2 ) = g 6 ( 2 ) = g 1 0 ( 2 ) = … = g 2 5 1 8 ( 2 ) = − 1 8 1 , total of 630 of them
g 3 ( 2 ) = g 7 ( 2 ) = g 1 1 ( 2 ) = … = g 2 5 1 9 ( 2 ) = 2 1 5 , total of 630 of them
g 4 ( 2 ) = g 8 ( 2 ) = g 1 2 ( 2 ) = … = g 2 5 2 0 ( 2 ) = 2 , total of 630 of them
⇒ k = 1 ∑ 2 5 2 0 g k ( 2 ) = 6 3 0 ( − 1 5 7 − 1 8 1 + 2 1 5 + 2 ) = 1 0 8 1
Answer is 1 2 6 0 − 1 0 8 1 = 1 7 9
Great job!
Great job! This actually shows that instead of 2 any other number would also lead to similar periodic patterns.
Log in to reply
Thanks!
typo: " f 4 ( x ) = f ( x ) " and " g 5 ( x ) = g ( x ) "
It is easy to check these functions for periodicity when evaluated at 2 , and we find that they are. Namely,
f ( 2 ) = 2 1 , f 2 ( 2 ) = − 1 , f 3 ( 2 ) = 2 , f 4 ( 2 ) = 2 1 ⋯
g ( 2 ) = − 1 5 7 , g 2 ( 2 ) = − 1 8 1 , g 3 ( 2 ) = 2 1 5 , g 4 ( 2 ) = 2 , g 5 ( 2 ) = − 1 5 7 ⋯
Thus, ∑ k = 1 2 5 2 0 f k ( 2 ) = ( 3 2 5 2 0 ) ( 2 1 − 1 + 2 ) = 1 2 6 0 and ∑ k = 1 2 5 2 0 g k ( 2 ) = ( 4 2 5 2 0 ) ( − 1 5 7 − 1 8 1 + 2 1 5 + 2 ) = 1 0 8 1
So the desired answer is 1 2 6 0 − 1 0 8 1 → 1 7 9 .
Nicely done!
I DID THE SAME . EXACTLY
If we calculate f ( 2 ) , we get that:
f ( 2 ) = 2 2 − 1 = 2 1 f 2 ( 2 ) = 2 1 2 1 − 1 = − 1 f 3 ( 2 ) = − 1 − 1 − 1 = 2
Therefore, there is a repeating pattern of 2 , 0 . 5 , − 1 . We can see that 3 2 5 2 0 = 8 4 0 , so the value of:
k = 1 ∑ 2 5 2 0 f k ( 2 ) = 8 4 0 ⋅ ( 2 + 0 . 5 − 1 ) = 1 2 6 0
Following the same process with g ( 2 ) , we can see another repeating pattern, this time with the numbers 2 , − 1 5 7 , − 1 8 1 , 2 1 5 . We can see that 4 2 5 2 0 = 6 3 0 so the value of:
k = 1 ∑ 2 5 2 0 g k ( 2 ) = 6 3 0 ⋅ ( 2 − 1 5 7 − 1 8 1 + 2 1 5 ) = 1 0 8 1 .
Therefore, we can see that the value of:
k = 1 ∑ 2 5 2 0 ( f k ( 2 ) − g k ( 2 ) ) = 1 2 6 0 − 1 0 8 1 = 1 7 9
Well done!
By inspection, it eventually becomes clear that f n ( x ) = ⎩ ⎪ ⎨ ⎪ ⎧ x x − 1 , 1 − x 1 , x , n ≡ 1 ( m o d 3 ) n ≡ 2 ( m o d 3 ) n ≡ 0 ( m o d 3 ) and g n ( x ) = ⎩ ⎪ ⎪ ⎪ ⎨ ⎪ ⎪ ⎪ ⎧ 3 − 9 x 3 x + 1 , 9 x − 1 , 9 x + 3 3 x − 1 , x , n ≡ 1 ( m o d 4 ) n ≡ 2 ( m o d 4 ) n ≡ 3 ( m o d 4 ) n ≡ 0 ( m o d 4 ) Breaking up the given sum, we have ( k = 1 ∑ 2 5 2 0 f k ( 2 ) ) − ( k = 1 ∑ 2 5 2 0 g k ( 2 ) ) ( 3 2 5 2 0 ) ( 2 1 + 2 − 1 + 2 ) − ( 4 2 5 2 0 ) ( 1 5 − 7 + 1 8 − 1 + 2 1 5 + 2 ) The above simplifies to 1 7 9 .
We can solve the problem by looking at the repeating patterns of the functions and its compositions. f(x)= (x-1)/x, f^2 (x) = -1/(x-1), f^3 (x) = x, f^4 (x) = f(x), f^5 (x) = f^2 (x),... etc.It is repeating after 3 steps.So f(2) = 1/2, f^2 (2) = -1, f^3(2) = 2.So the total sum will be 3/2 (2520/3) = 1260. For the function of g(x) and its compositions, it is repeating after 4 steps, namely, g(x) = (3x+1)/(3-9x), g^2 (x) = -1/(9x), g^3(x) = (3x-1)/(3+9x), and g^4(x) = x,...etc.So total sum of g(x) and its compositions evaluated at x=2, are (-7/15 + (-1/18) + (5/21) + 2) (2520/4) = 1081 So Their total difference is 1260 - 1081 = 179
f ( x ) = x x − 1 , f 2 ( x ) = x − 1 − 1 , f 3 ( x ) = x .
We also have:
g ( x ) = − 3 1 3 x − 1 3 x + 1 , g 2 ( x ) = − 3 1 3 x 1 , g 3 ( x ) = 3 1 3 x + 1 3 x − 1 , g 4 ( x ) = x
So, The required sum is:
3 2 5 2 0 ( f ( x ) + f 2 ( x ) + f 3 ( x ) ) − 4 2 5 2 0 ( g ( x ) + g 2 ( x ) + g 3 ( x ) + g 4 ( x ) )
Substituting x = 2 in the above, it results in 1 7 9 .
Nicely done!
A calculation that is slightly too tedious to write down here tells us that f 4 ( x ) = x 1 and that g 4 ( x ) = x . This tells us that g repeats itself every four terms, i.e. g 5 = g , g 6 = g 2 , etc. We may also see that after the third iteration, f becomes 3 -repetitive and concerning the outcome when we fill in 2 , it even is 3-repetitive from the start. As a result, we may split the sum to give 3 2 5 2 0 ⋅ ( sum of each three succesive terms of f ) −
4 2 5 2 0 ⋅ ( sum of each four succesive terms of g ) =
3 2 5 2 0 ⋅ ( − 1 + 2 + 2 1 ) − 4 2 5 2 0 ⋅ ( 2 + 2 1 5 − 1 5 7 − 1 8 1 ) =
3 2 5 2 0 ⋅ 2 3 − 4 2 5 2 0 ⋅ 6 3 0 1 2 6 0 + 1 5 0 − 2 9 4 − 3 5 =
1 2 6 0 − 1 2 6 0 − 1 5 0 + 2 9 4 + 3 5 = 1 7 9 .
Nicely done! It will actually be repetitive from the start for any value of x as long as all fractions are defined. Indeed, these are Mobius transformations, so they are invertible (in fact, explicitly so, by f 2 and g 3 ).
Problem Loading...
Note Loading...
Set Loading...
It is matter of simple algebraic manipulation to find that
f ( x ) = x x − 1 , f 2 ( x ) = 1 − x 1 , f 3 ( x ) = x
g ( x ) = 3 − 9 x 3 x + 1 , g 2 ( x ) = − 9 x 1 , g 3 ( x ) = 9 x + 3 3 x − 1 , g 4 ( x ) = x
Now for any k ∈ N and a ∈ { 0 , 1 , 2 } we get f 3 k + a ( x ) = f a ( f 3 k ( x ) ) = f a ( x ) which follows by simple induction (or intuition). Similarly for any k ∈ N and a ∈ { 0 , 1 , 2 , 3 } we get f 4 k + a ( x ) = f a ( f 4 k ( x ) ) = f a ( x ) Now note that 3 2 5 2 0 = 8 4 0 and 4 2 5 2 0 = 6 3 0 . Hence $$\sum_{k = 1}^{2520} \Big(f^k(2) - g^k(2)\Big) = 840\left(f(2) + f^2(2) + 2\right) - 630\left(g(2) + g^2(2) + g^3(2) + 2\right)$$ Simply computing each of f ( 2 ) , f 2 ( 2 ) , g ( 2 ) , g 2 ( 2 ) , g 3 ( 2 ) we get k = 1 ∑ 2 5 2 0 ( f k ( 2 ) − g k ( 2 ) ) = 8 4 0 ( 2 1 − 1 + 2 ) − 6 3 0 ( 1 5 − 7 + 1 8 − 1 + 2 1 5 + 2 ) = 1 7 9