NL-NWO 1969 Problem 1

Determine the smallest $n$ such that $n \equiv (a - 1)$ mod $a$ for all $a \in \{2,3,..., 10\}$ .

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.