olymmath

HMMT 2025 T9

  • Team
  • Answer

Let Z\mathbb{Z} be the set of integers. Determine, with proof, all primes pp for which there exists a function f ⁣:Z→Zf\colon \mathbb{Z}\to \mathbb{Z} such that for any integer xx ,

f(x+p)=f(x)f(x + p) = f(x) and pp divides f(x+f(x))−xf(x + f(x)) - x .

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

p = 5 \text{ and all primes } p \equiv \pm 1 \pmod{5}

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 hmmt/2025/t9 · Tag X2NXR6Y54T · Edit this page on GitHub · Keys: j next, k previous