Logo
Published on

Quadratic Residues Modulo 5

Authors
  • avatar
    Name
    Vu Hung
    Twitter

Problem Statement

  • Given aa is integral and not divisible by 5, prove the remainder when a2a^2 is divided by 5 is either 1 or 4.
  • Hence, given that a,ba, b are integral and not divisible by 5, prove that a4b4a^4 - b^4 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 aa is not divisible by 5, we have a≢0(mod5)a \not\equiv 0 \pmod{5}.

By the division algorithm, aa must be congruent to 1, 2, 3, or 4 modulo 5.

We check each case:

Case 1: a1(mod5)a \equiv 1 \pmod{5}

a2121(mod5)a^2 \equiv 1^2 \equiv 1 \pmod{5}

Case 2: a2(mod5)a \equiv 2 \pmod{5}

a2224(mod5)a^2 \equiv 2^2 \equiv 4 \pmod{5}

Case 3: a3(mod5)a \equiv 3 \pmod{5}

a23294(mod5)a^2 \equiv 3^2 \equiv 9 \equiv 4 \pmod{5}

Case 4: a4(mod5)a \equiv 4 \pmod{5}

a242161(mod5)a^2 \equiv 4^2 \equiv 16 \equiv 1 \pmod{5}

In all cases, a21a^2 \equiv 1 or 4(mod5)4 \pmod{5}.

Therefore, the remainder when a2a^2 is divided by 5 is either 1 or 4. \hfill \square

Part (b): Using Part (a)

From part (a), for any integer xx not divisible by 5: x21x^2 \equiv 1 or 4(mod5)4 \pmod{5}.

Consider a4=(a2)2a^4 = (a^2)^2:

  • If a21(mod5)a^2 \equiv 1 \pmod{5}, then (a2)2121(mod5)(a^2)^2 \equiv 1^2 \equiv 1 \pmod{5}
  • If a24(mod5)a^2 \equiv 4 \pmod{5}, then (a2)242161(mod5)(a^2)^2 \equiv 4^2 \equiv 16 \equiv 1 \pmod{5}

Thus a41(mod5)a^4 \equiv 1 \pmod{5} for any integer aa not divisible by 5.

Similarly, b41(mod5)b^4 \equiv 1 \pmod{5}.

Therefore:

a4b411(mod5)0(mod5)\begin{aligned} a^4 - b^4 &\equiv 1 - 1 \pmod{5} \\ &\equiv 0 \pmod{5} \end{aligned}

Hence 5(a4b4)5 \mid (a^4 - b^4). \hfill \square


Takeaways

  • Systematic Case Analysis: For 5a5 \nmid a, check all residues a1,2,3,4(mod5)a \equiv 1, 2, 3, 4 \pmod{5} systematically
  • Squaring Congruences: If ab(modm)a \equiv b \pmod{m}, then a2b2(modm)a^2 \equiv b^2 \pmod{m}
  • ``Hence'' Strategy: Part (b) builds directly on part (a)'s result; apply it twice to get a4b41(mod5)a^4 \equiv b^4 \equiv 1 \pmod{5}
  • Fermat's Little Theorem Preview: Result a41(mod5)a^4 \equiv 1 \pmod{5} for gcd(a,5)=1\gcd(a,5)=1 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:


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.