- #1
privyet
- 13
- 1
Homework Statement
This is a question from the book I'm studying called 'Mathematical Proofs: A transition to advanced mathematics'
Homework Equations
Let a, b, n be integers, with n≥2. Prove that if a[itex]\equiv[/itex]b(mod n), then a2[itex]\equiv[/itex]b2(mod n).
The Attempt at a Solution
Following the examples I assumed that I'd start by stating that since a[itex]\equiv[/itex]b(mod n), then a-b=nx... but from this point I'm stuck.
Any help much appreciated.
Last edited: