HMMT 2025 T9
- Team
- Answer
Let be the set of integers. Determine, with proof, all primes for which there exists a function such that for any integer ,
and divides .
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.
Similar problems
These problems have the most words in common with this statement.