USAJMO 2025 Problem 1
- Day 1
Let be the set of integers, and let be a function. Prove that there are infinitely many integers such that the function defined by is not bijective. Note: A function is bijective if for every integer , there exists exactly one integer such that .
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.
Similar problems
These problems have the most words in common with this statement.