- Published on
Quadratic Residues Modulo 5
- Authors

- Name
- Vu Hung
Problem Statement
- Given is integral and not divisible by 5, prove the remainder when is divided by 5 is either 1 or 4.
- Hence, given that are integral and not divisible by 5, prove that is divisible by 5.
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
Part (a): Proof by Cases
Since is not divisible by 5, we have .
By the division algorithm, must be congruent to 1, 2, 3, or 4 modulo 5.
We check each case:
Case 1:
Case 2:
Case 3:
Case 4:
In all cases, or .
Therefore, the remainder when is divided by 5 is either 1 or 4. \hfill
Part (b): Using Part (a)
From part (a), for any integer not divisible by 5: or .
Consider :
- If , then
- If , then
Thus for any integer not divisible by 5.
Similarly, .
Therefore:
Hence . \hfill
Takeaways
- Systematic Case Analysis: For , check all residues systematically
- Squaring Congruences: If , then
- ``Hence'' Strategy: Part (b) builds directly on part (a)'s result; apply it twice to get
- Fermat's Little Theorem Preview: Result for is special case of FLT
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 Polynomials: https://vumaths.com/booklets/hsc-polynomials/
- HSC Sequences: https://vumaths.com/booklets/hsc-sequences/
Connect with me
If you're eager for more HSC Maths insights, be sure to check out my Website - Vu's Maths Hub. For deeper dives and regular tips, join my YouTube - HSC Maths Extension 1+2. Let's tackle these challenging math problems together! You can also catch my daily math content on GitHub.
