If is a strictly increasing function whose domain and range are both , and , find the sum of all that satisfy the following equation:
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.
F 9 ( F 2 1 ( c ) − 2 0 2 1 F 2 0 ( c ) ) + F 3 ( F 2 1 ( c ) − 2 0 2 1 F 2 0 ( c ) ) = F 9 ( 4 0 8 4 4 4 1 − 2 0 2 1 F ( c ) ) + F 3 ( 4 0 8 4 4 4 1 − 2 0 2 1 F ( c ) )
Let a = F ( F 2 1 ( c ) − 2 0 2 1 F 2 0 ( c ) ) , b = F ( 4 0 8 4 4 4 1 − 2 0 2 1 F ( c ) ) . We have:
a 3 − a = b 3 − b
Since a 3 − a is a bijection whose domain and range are both R , we can conclude that a = b . We have:
F ( F 2 1 ( c ) − 2 0 2 1 F 2 0 ( c ) ) = F ( 4 0 8 4 4 4 1 − 2 0 2 1 F ( c ) )
Since F is strictly increasing, it's injective. We can conclude that this equation is therefore equivalent to:
F 2 1 ( c ) − 2 0 2 1 F 2 0 ( c ) = 4 0 8 4 4 4 1 − 2 0 2 1 F ( c )
F 2 1 ( c ) − 2 0 2 1 F 2 0 ( c ) + 2 0 2 1 F ( c ) − 4 0 8 4 4 4 1 = 0
The easiest (and possibly the only) way to find the sum of the solutions is to try to find them explicitly.
F 2 0 ( c ) ( F ( c ) − 2 0 2 1 ) + 2 0 2 1 ( F ( c ) − 2 0 2 1 ) = 0
( F ( c ) − 2 0 2 1 ) ( F 2 0 ( c ) + 2 0 2 1 ) = 0
From here we have F ( c ) = 2 0 2 1 , and the other factor yields complex solutions so we ignore it. From F ( 2 0 ) = 2 0 2 1 and the injectivity of the function, we conclude that c = 2 0 .