olymmath

CMO 1969 Problem 8

  • Paper

Let ff be a function with the following properties:

  1. f(n)f(n) is defined for every positive integer nn;
  2. f(n)f(n) is an integer;
  3. f(2)=2f(2)=2;
  4. f(mn)=f(m)f(n)f(mn)=f(m)f(n) for all mm and nn;
  5. f(m)>f(n)f(m)>f(n) whenever m>nm>n.

Prove that f(n)=nf(n)=n.

Dataset text AoPS wiki problems. 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 ca-cmo/1969/p8 · Tag 6W5ZHJ1HWE · Edit this page on GitHub · Keys: j next, k previous