Maths Olympiad Prep

Track / Stage 4 / 2 of 340 #262 of 1964

Problem 262

AMC 12 late, AIME early
Number theory Difficulty 4.0 Prove it BMO Round 1 · United Kingdom · 2008

The function ff is defined on the set of positive integers by f(1)=1f(1) = 1, f(2n)=2f(n)f(2n) = 2f(n), and nf(2n+1)=(2n+1)(f(n)+n)nf(2n + 1) = (2n + 1)(f(n) + n) for all n1n \ge 1.

i) Prove that f(n)f(n) is always an integer.

ii) For how many positive integers less than 20072007 is f(n)=2nf(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.

Next problem →

We don't reproduce this publisher's solutions. Their own solution is here — work the problem first.

Source: UK Mathematics Trust, licensed © UK Mathematics Trust; question papers published free at bmos.ukmt.org.uk. Statement reproduced verbatim; metadata (topic, difficulty, ordering) added by this project. Solutions are the publisher's, linked not copied.