Maths Olympiad Prep

Library / /1 of 4

Algebra Difficulty 4.7 AIME Prove it Brazil

Let NN be the natural numbers and N=N{0}N' = N \setminus \{0\}. Find all functions f:NNf: N' \to N such that f(xy)=f(x)+f(y)f(xy) = f(x) + f(y), f(30)=0f(30) = 0 and f(x)=0f(x) = 0 for all x7(mod10)x \equiv 7 \pmod{10}.

Solution

f(30)=f(2)+f(3)+f(5)=0f(30) = f(2) + f(3) + f(5) = 0 and f(n)f(n) is non-negative, so f(2)=f(3)=f(5)=0f(2) = f(3) = f(5) = 0. For any positive integer nn not divisible by 22 or 55 we can find a positive integer mm such that mn7(mod10)mn \equiv 7 \pmod{10}. But then f(mn)=0f(mn) = 0, so f(n)=0f(n) = 0.
It is a trivial induction that f(2a5bn)=f(5bn)=f(n)f(2^a 5^b n) = f(5^b n) = f(n), so ff is identically zero.

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.