Using the Division Algorithm to Set up Proof Cases

This video goes through a proof that is closely related to the one for exercise 29, Section 4.5. Note that saying that n² ≡ 1 (mod 3) means the same as saying that 1 is the remainder obtained when n² is divided by 3 (in the book’s notation: n² mod 3 = 1).

Click here to view the transcript.