olymmath

ÖMO 2015 Problem 1

    Let f:Z>0→Zf: \mathbb{Z}_{>0} \rightarrow \mathbb{Z} be a function with the following properties:

    (i) f(1)=0f(1) = 0 (ii) f(p)=1f(p) = 1 for all prime numbers pp (iii) f(xy)=y⋅f(x)+x⋅f(y)f(xy) = y \cdot f(x) + x \cdot f(y) for all x,yx,y in Z>0\mathbb{Z}_{>0} Determine the smallest integer n≥2015n \ge 2015 that satisfies f(n)=nf(n) = n .

    (Gerhard J. Woeginger)

    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 at-oemo/2015/p1 · Tag 38CWMA41CA · Edit this page on GitHub · Keys: j next, k previous