Let Q be the set of rational numbers. A function f : Q → Q is called aquaesulian if
the following property holds: for every x, y ∈ Q,
f(x + f(y)) = f(x) + y or f(f(x) + y) = x + f(y).
Show that there exists an integer c such that for any aquaesulian function f there are at most c different rational numbers of the form f(r) + f( − r) for some rational number r, and find the smallest possible value of c.
Solution
Claim 1.
Proof. By we have that either or for each . If the former ever holds then clearly attains as a value. Otherwise taking yields as a value as well.
Claim 2. is injective
Assume for some ,. By and we have and . Now yields either or , both of which imply .
Claim 3.
Proof. Assume otherwise. By Claim 1 there exists a nonzero such that . By we have that one of and maps to the other. Since is nonzero this is actually forced to be . Injectivity yields but then , contradicting that is nonzero.
Now I'm out of ideas so we'll try to bruteforce this. Let be such that and . I claim that these two values are actually equal. Assume that for some rational we have . By we obtain that two of the numbers
Is mapped to the other by . If then injectivity gives contradicting our choice of . Therefore we must have and . A similar relation holds for if , so it suffices to show that some value of satisfies this for and simultaneously. Notice that by and , is a valid choice for and is a valid choice for . Finally, by we obtain that either is suitable for or is suitable for , so in either case a suitable exists. It follows that is suitable for all aquaesulian functions.
To finish we exhibit an aquaesulian function with two distinct values of . We claim that works. This achieves for all integer and for all non-integer . Consider two rational , and assume WLOG that , then
Similarly if , which proves that is indeed aquaesulian.