olymmath

RO-TST 2014 Problem 9

    Let ff be the function of the set of positive integers into itself, defi ned by f(1)=1f(1) = 1 , f(2n)=f(n)f(2n) = f(n) and f(2n+1)=f(n)+f(n+1)f(2n + 1) = f(n) + f(n + 1) . Show that, for any positive integer nn , the number of positive odd integers m such that f(m)=nf(m) = n is equal to the number of positive integersless or equal to nn and coprime to nn .

    [mod: the initial statement said less than nn , which is wrong.]

    Dataset text AI-MO AoPS. Quoted with source.

    Solutions

    No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

    Add a solution

    Similar problems

    These problems have the most words in common with this statement.

    Locator ro-tst/2014/p9 · Tag 139ASHB70Y · Edit this page on GitHub · Keys: j next, k previous