Maths Olympiad Prep

Library / /2 of 3

, 2013

Algebra Difficulty 6.6 National olympiad Prove it Japan

Determine all real-valued functions ff defined on the set of all integers and satisfying the following identity for an arbitrary pair m,nm, n of integers:
f(m)+f(n)=f(mn)+f(m+n+mn). f(m) + f(n) = f(mn) + f(m + n + mn).

Solution

Let f(1)=af(1) = a. By letting n=1n = 1, we get from the given equation that f(m)+f(1)=f(m)+f(2m+1)f(m) + f(1) = f(m) + f(2m + 1) is valid for any integer mm. Thus we see that f(d)=af(d) = a must hold for any odd integer dd.

An arbitrary non-zero integer can be written in the form 2kd2^k d where dd is an odd integer and kk is a non-negative integer. By taking m=dm = d and n=2kn = 2^k, we obtain from the given equation that f(d)+f(2k)=f(2kd)+f(2k(d+1)+d)f(d) + f(2^k) = f(2^k d) + f(2^k(d + 1) + d). Since both dd and 2k(d+1)+d2^k(d + 1) + d are odd integers, we get from the preceding identity that a+f(2k)=f(2kd)+aa + f(2^k) = f(2^k d) + a, from which it follows further that f(2kd)=f(2k)f(2^k d) = f(2^k). Consequently, we see that if we can determine f(2k)f(2^k) for all k=0,1,2,k = 0, 1, 2, \cdots and f(0)f(0), then f(n)f(n) is determined completely for all integers nn.

For k2k \ge 2, substitute m=2k,n=2m = 2^k, n = 2 into the given equation we obtain f(2k)+f(2)=f(2k+1)+f(2k3+2)f(2^k) + f(2) = f(2^{k+1}) + f(2^k \cdot 3 + 2). Since 2k3+22^k \cdot 3 + 2 is an odd multiple of 2, we have f(2k3+2)=f(2)f(2^k \cdot 3 + 2) = f(2) by what we observed in the preceding paragraph. Hence, we have f(2k)=f(2k+1)f(2^k) = f(2^{k+1}) for any k2k \ge 2. If we put f(22)=bf(2^2) = b, we then get f(22)=f(23)==bf(2^2) = f(2^3) = \cdots = b. Letting m=n=2m = n = 2 in the given equation, we get 2f(2)=f(4)+f(8)=2b2f(2) = f(4) + f(8) = 2b, which says that f(2)=bf(2) = b holds as well. What we have seen so far tells us that f(n)=bf(n) = b holds for all even integer different from 0. Finally, by letting m=n=2m = n = -2 in the given equation, we get 2f(2)=f(4)+f(0)2f(-2) = f(4) + f(0), which implies that f(0)=bf(0) = b holds as well. Thus, we can conclude that any function ff satisfying the given equation must have the form
()f(n)={a(n odd)b(n even or 0). (*) \qquad f(n) = \begin{cases} a & (n \text{ odd}) \\ b & (n \text{ even or } 0). \end{cases}
for some pair a,ba, b of real numbers.

Conversely, let us show that for an arbitrary pair a,ba, b of real numbers the function defined by ()(*) satisfies the given equation.

* When both mm and nn are even, mnmn and m+n+mnm+n+mn are both even, so both sides of the given equation are equal to 2b2b.

* When both mm and nn are odd, mnmn and m+n+mnm+n+mn are both odd, so both sides of the given equation are equal to 2a2a.

* If one of m,nm, n is even and the other is odd, mnmn is even and m+n+mnm+n+mn is odd, so both sides of the given equation are equal to a+ba+b.

Thus, the function defined by ()(*) satisfies the given equation for any choice of a pair a,ba, b of real numbers and thus the desired functions ff are all functions of this form.

Want a route through all this instead of an archive? The track puts 2,000 problems in a working order, from AMC 10 level to the IMO shortlist.

Source: MathNet, licensed CC-BY-4.0. Statement and solution reproduced as published; topic and difficulty added by this site.