Number theoryDifficulty 5.9AIME, harderProve itNorth Macedonia
Let the function f:N→R be such that for every natural number n>1, there is a prime divisor p of n such that: f(n)=f(pn)−f(p) If f(22007)+f(32008)+f(52009)=2006, compute f(20072)+f(20083)+f(20095) (adapted).
Solution
If n=p is a prime number then f(p)=f(pp)−f(p)=f(1)−f(p) i.e. f(p)=2f(1)(1) If n=pq (p and q are prime numbers) then f(n)=f(pn)−f(p)=f(q)−f(p) or f(n)=f(qn)−f(q)=f(p)−f(q) i.e. f(n)=0 (because of (1)). If n is a product of three prime numbers f(n)=f(pn)−f(p)=0−f(p)=−f(p)=−2f(1). By induction on the number of prime divisors, it can be easily shown that if n is a product of k prime numbers, then f(n)=(2−k)2f(1)(2) Then, from f(22007)+f(32008)+f(52009)=2006 and (2) we have 2006=f(22007)+f(32008)+f(52009)==22−2007f(1)+22−2008f(1)+22−2009f(1)=−23⋅2006f(1) i.e. f(1)=−32(3) Now from 2007=32⋅223, 2008=23⋅251, 2009=72⋅41 and (3) we get f(20072)+f(20083)+f(20095)=22−6f(1)+22−12f(1)+22−15f(1)==−227f(1)=−227⋅(−32)=9
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.