Maths Olympiad Prep

Library / /217 of 520

Number theory Difficulty 6.3 National olympiad Find the answer

Let f:NRf: \mathbb{N} \rightarrow \mathbb{R} be a function, satisfying the following condition:

for every integer n>1n>1, there exists a prime divisor pp of nn such that f(n)=f(np)f(p)f(n)=f\left(\frac{n}{p}\right)-f(p). If

f(22007)+f(32008)+f(52009)=2006 f\left(2^{2007}\right)+f\left(3^{2008}\right)+f\left(5^{2009}\right)=2006

determine the value of

f(20072)+f(20083)+f(20095) f\left(2007^{2}\right)+f\left(2008^{3}\right)+f\left(2009^{5}\right)

A number or a short expression. Fractions can be typed as 3/2, and spacing doesn't matter.

Solution

If n=pn=p is a prime number, we have

f(p)=f(pp)f(p)=f(1)f(p) f(p)=f\left(\frac{p}{p}\right)-f(p)=f(1)-f(p)

i.e.

f(p)=f(1)2 f(p)=\frac{f(1)}{2}

If n=pqn=p q, where pp and qq are prime numbers, then

f(n)=f(np)f(p)=f(q)f(p)=f(1)2f(1)2=0 f(n)=f\left(\frac{n}{p}\right)-f(p)=f(q)-f(p)=\frac{f(1)}{2}-\frac{f(1)}{2}=0

If nn is a product of three prime numbers, we have

f(n)=f(np)f(p)=0f(p)=f(p)=f(1)2 f(n)=f\left(\frac{n}{p}\right)-f(p)=0-f(p)=-f(p)=-\frac{f(1)}{2}

With mathematical induction by a number of prime multipliers we shall prove that: if nn is a product of kk prime numbers then

f(n)=(2k)f(1)2 f(n)=(2-k) \frac{f(1)}{2}

For k=1k=1, clearly the statement (2) holds.

Let statement (2) hold for all integers nn, where nn is a product of kk prime numbers.

Now let nn be a product of k+1k+1 prime numbers. Then we have n=n1pn=n_{1} p, where n1n_{1} is a product of kk prime numbers.

So

f(n)=f(np)f(p)=f(n1)f(p)=(2k)f(1)2f(1)2=(2(k+1))f(1)2 f(n)=f\left(\frac{n}{p}\right)-f(p)=f\left(n_{1}\right)-f(p)=(2-k) \frac{f(1)}{2}-\frac{f(1)}{2}=(2-(k+1)) \frac{f(1)}{2}

So (2) holds for every integer n>1n>1.

Now from f(22007)+f(32008)+f(52009)=2006f\left(2^{2007}\right)+f\left(3^{2008}\right)+f\left(5^{2009}\right)=2006 and because of (2) we have

2006=f(22007)+f(32008)+f(52009)=220072f(1)+220082f(1)+220092f(1)=320062f(1) \begin{aligned} 2006 & =f\left(2^{2007}\right)+f\left(3^{2008}\right)+f\left(5^{2009}\right) \\ & =\frac{2-2007}{2} f(1)+\frac{2-2008}{2} f(1)+\frac{2-2009}{2} f(1)=-\frac{3 \cdot 2006}{2} f(1) \end{aligned}

i.e.

f(1)=23 f(1)=-\frac{2}{3}

Since

2007=32223,2008=23251,2009=7241 2007=3^{2} \cdot 223,2008=2^{3} \cdot 251,2009=7^{2} \cdot 41

and because of (2) and (3), we get

f(20072)+f(20083)+f(20095)=262f(1)+2122f(1)+2152f(1)=272f(1)=272(23)=9 \begin{aligned} f\left(2007^{2}\right)+f\left(2008^{3}\right)+f\left(2009^{5}\right) & =\frac{2-6}{2} f(1)+\frac{2-12}{2} f(1)+\frac{2-15}{2} f(1) \\ & =-\frac{27}{2} f(1)=-\frac{27}{2} \cdot\left(-\frac{2}{3}\right)=9 \end{aligned}

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: NuminaMath-1.5, licensed Apache-2.0. Statement and solution reproduced as published; topic and difficulty added by this site.