- Published on
Divisibility of n Squared Minus One by Three
- Authors

- Name
- Vu Hung
Problem Statement
Prove that is divisible by 3 if is not a multiple of 3.
Hints
Attempt the proof independently first. Focus on the key theorem, algebraic transformation, or contradiction setup that links the hypothesis to the target conclusion.
Solutions
Proof by Cases (Modular Arithmetic)
Step 1: Set up the cases
If is not a multiple of 3, then .
By the division algorithm, must satisfy one of:
- , or
We will prove in both cases.
Step 2: Case 1 -
Therefore, in this case.
Step 3: Case 2 -
Therefore, in this case as well.
Conclusion
Since in all possible cases where , we conclude that is divisible by 3 whenever is not a multiple of 3.
\hfill
Takeaways
- Proof by Cases Setup: If , check all other residue classes modulo
- Modular Arithmetic: Use to mean , or equivalently, and have same remainder when divided by
- Complete Case Coverage: For modulo 3, only residues are 0, 1, 2; excluding 0 leaves exactly 2 cases to check
- Calculation Technique: Substitute residue values directly: if , then
Further Readings
If you found this proof interesting, be sure to check out these relevant HSC booklets to sharpen your reasoning skills:
- HSC Proofs: https://vumaths.com/booklets/hsc-proofs/
- HSC Mechanics: https://vumaths.com/booklets/hsc-mechanics/
- HSC Combinatorics: https://vumaths.com/booklets/hsc-combinatorics/
Connect with me
If you're eager for more HSC Maths insights, be sure to check out my GitHub. For deeper dives and regular tips, join my Instagram. Let's tackle these challenging math problems together! You can also catch my daily math content on LinkedIn.
