Let be a function defined along the rational numbers such that for all relatively prime positive integers and . The product of all rational numbers such that can be written in the form for positive relatively prime integers and . Find .
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.
Let x = n m and define d = g cd ( m − 1 , n − 1 ) . Then f ( 1 − f ( x ) x − f ( x ) ) = f ( 1 − n 1 n m − n 1 ) = f ( n − 1 m − 1 ) = n − 1 d . Hence the equation in question becomes n − 1 d = n 1 + 5 2 9 . Multiplying through to clear denominators gives 5 2 n d ⟹ 5 2 d = 5 2 ( n − 1 ) + 9 n ( n − 1 ) = 9 n 2 + 4 3 n − 5 2 = 9 n + 4 3 − n 5 2 . Thus n ∣ 5 2 , so the possible values of n are 1 , 2 , 4 , 1 3 , 2 6 , 5 2 . Testing all of these gives ( n , d ) = ( 1 3 , 3 ) as the only solution. Hence the set of possible m is the set of integers with 1 ≤ m ≤ 1 2 that satisfy g cd ( m − 1 , 1 2 ) = 3 , of which there are only two: 4 and 1 0 . Therefore the only two rational numbers 0 < x < 1 that satisfy this equation are x = 1 3 4 and x = 1 3 1 0 . The product of these two numbers is 1 6 9 4 0 and the desired sum is 4 0 + 1 6 9 = 2 0 9 .