USAMO 2006 Problem 1
- Day 1
Let be a prime number and let be an integer with Prove that there exist integers and with and
if and only if is not a divisor of .
Note: For a real number, let denote the greatest integer less than or equal to , and let denote the fractional part of x.
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.