Question:
How to Prove a Theorem
A simple theorem from number theory is proven to illustrate the concept of proof. Specifically, we prove that
For every n>2, there exist integers x, y such that x is congruent to y mod(n) and x is not congruent to -y mod(n).