Number theoryDifficulty 4.0Prove itBMO Round 1 · United Kingdom · 2008
The function f is defined on the set of positive integers by f(1)=1, f(2n)=2f(n), and nf(2n+1)=(2n+1)(f(n)+n) for all n≥1.
i) Prove that f(n) is always an integer.
ii) For how many positive integers less than 2007 is f(n)=2n?
This one wants a proof. Work it on paper, then check yourself against the publisher's own solution, linked below. Be honest about it: the record is only any use to you if it is.