olymmath

PAMO 2002 Problem 1

  • Day 1

Find all functions f:N0→N0f: N_0 \to N_0 , (where N0N_0 is the set of all non-negative integers) such that f(f(n))=f(n)+1f(f(n))=f(n)+1 for all n∈N0n \in N_0 and the minimum of the set {f(0),f(1),f(2)⋯ }\{ f(0), f(1), f(2) \cdots \} is 11 .

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 pamo/2002/p1 · Tag 7HC54Q116P · Edit this page on GitHub · Keys: j next, k previous