MathNet 2026 — Part 08 Question 145

Let $n \gt 1$ be an odd integer. Prove that every integer $l$ satisfying $1 \leq l \leq n$ can be represented as a sum or difference of two integers each of which is less than $n$ and relatively prime to $n$.