ZA-SAMO 2004 Problem 5

For $n\ge 2$ , find the number of integers $x$ with $0\le x<n$ , such that $x^2$ leaves a remainder of $1$ when divided by $n$ .

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.