Browse · MathNet
Print56th International Mathematical Olympiad Shortlisted Problems
algebra
Problem
Let denote the set of odd integers. Find all functions satisfying for every .
Solution
Throughout the solution, all functions are assumed to map integers to integers. For any function and any nonzero integer , define For any nonzero integers and , notice that . Moreover, if and , then and for all nonzero integers . We say that is -quasiperiodic if is a constant function (in other words, if , or is -periodic). In this case, we call a quasi-period of . We say that is quasi-periodic if it is -quasi-periodic for some nonzero integer . Notice that a quasi-period of is a period of . So if is quasi-periodic, then its minimal positive quasi-period divides all its quasi-periods. We now assume that satisfies (1). First, by setting , the problem condition can be rewritten as Let be an arbitrary integer and let be an arbitrary positive integer. Applying (2) when is substituted by and summing up all these equations, we get Notice that a similar argument works when is negative, so that We now prove two lemmas. Lemma 1. For any distinct integers and , the function is -periodic. Proof. Denote . Applying (3) twice, we obtain Thus, the function is -periodic, as required. Lemma 2. Let be a function. If and are nonzero integers such that and , then . Proof. Assume, without loss of generality, that is positive. Let be an arbitrary integer. Since , we have The sum of these equal numbers is , so each of them is zero, as required. We now return to the solution. Step 1. We prove that is quasi-periodic. Let . Applying Lemma 1, we get that the function is 2-periodic. In other words, the values of are constant on even numbers and on odd numbers separately. Moreover, setting and in (3), we get . Since 0 and have different parities, the value of at even numbers is the same as that at odd numbers. Thus, is constant, which means that is a quasi-period of . Step 2. Denote the minimal positive quasi-period of by . We prove that for all integers . Since an odd number is a quasi-period of , the number is also odd. Now suppose, to the contrary, that there exist an odd prime , a positive integer , and an integer such that but . Setting and in (1), we have , so does not divide the value of at one of the points or . Denote this point by . Let . Since , from Lemma 1 we get . Hence the function is -periodic as well as -periodic, so it is -periodic, or . Similarly, observe that the function is -periodic as well as -periodic, so we may conclude that . Since , both and divide . We thus obtain , which yields Since , we can apply Lemma 2 to the function , obtaining . However, this means that is -quasi-periodic, contradicting the minimality of . Our claim is proved. Step 3. We describe all functions . Let be the greatest common divisor of all values of . Then is odd. By Step 2, is a quasi-period of , so that is constant. Since the value of is even and divisible by , we may denote this constant by , where is an integer. Next, for all , define ; notice that is odd. Then This shows that all functions satisfying (1) are listed in the answer. It remains to check that all such functions indeed satisfy (1). This is equivalent to checking (2), which is true because for every integer , the value of is divisible by , so that is constant.
Final answer
All solutions are as follows: choose an odd integer d, an integer k, and odd integers ℓ_0, ℓ_1, …, ℓ_{d−1}. For every integer x written uniquely as x = m d + i with m ∈ ℤ and i ∈ {0, 1, …, d−1}, define
f(m d + i) = d(2 k m + ℓ_i).
Equivalently, Δ_d f(x) = f(x + d) − f(x) = 2 d k is constant, and for each residue class i modulo d the values are f(m d + i) = ℓ_i d + 2 k m d. These and only these functions map ℤ to odd integers and satisfy the given equation.
f(m d + i) = d(2 k m + ℓ_i).
Equivalently, Δ_d f(x) = f(x + d) − f(x) = 2 d k is constant, and for each residue class i modulo d the values are f(m d + i) = ℓ_i d + 2 k m d. These and only these functions map ℤ to odd integers and satisfy the given equation.
Techniques
Functional EquationsIntegersGreatest common divisors (gcd)Least common multiples (lcm)