Logo
Published on

Last-Two-Digits Test for 4

Authors
  • avatar
    Name
    Vu Hung
    Twitter

Problem Statement

Prove that a number is divisible by 4 if and only if the last two digits form a number divisible by 4.


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

Biconditional Proof (If and Only If)

This requires proving both directions:

Forward Direction (    \implies): If NN is divisible by 4, then its last two digits form a number divisible by 4.

Reverse Direction (    \impliedby): If the last two digits form a number divisible by 4, then NN is divisible by 4.

Setup: Express any integer NN as:

N=100A+LN = 100A + L

where AA is the number formed by all digits except the last two, and LL is the two-digit number formed by the last two digits (0L990 \leq L \leq 99).

Forward Direction Proof:

Assume 4N4 \mid N, so N0(mod4)N \equiv 0 \pmod{4}.

Then:

100A+L0(mod4)\begin{aligned} 100A + L &\equiv 0 \pmod{4} \end{aligned}

Since 100=4×25100 = 4 \times 25, we have 100A0(mod4)100A \equiv 0 \pmod{4}.

Therefore:

0+L0(mod4)L0(mod4)\begin{aligned} 0 + L &\equiv 0 \pmod{4} \\ L &\equiv 0 \pmod{4} \end{aligned}

Thus 4L4 \mid L. \hfill \square

Reverse Direction Proof:

Assume 4L4 \mid L, so L0(mod4)L \equiv 0 \pmod{4}.

Since 100=4×25100 = 4 \times 25, we have 100A0(mod4)100A \equiv 0 \pmod{4}.

Therefore:

N=100A+L0+0(mod4)N0(mod4)\begin{aligned} N = 100A + L &\equiv 0 + 0 \pmod{4} \\ N &\equiv 0 \pmod{4} \end{aligned}

Thus 4N4 \mid N. \hfill \square

Conclusion:

Since both directions are proven, we conclude:

N is divisible by 4    last two digits of N divisible by 4N \text{ is divisible by } 4 \iff \text{last two digits of } N \text{ divisible by } 4

Takeaways

  • Iff Proof Structure: Must prove both (    \implies) and (    \impliedby) directions independently
  • Digit Representation: Writing N=100A+LN = 100A + L separates last two digits for modular analysis
  • Key Observation: Since 1000(mod4)100 \equiv 0 \pmod{4}, divisibility of NN by 4 depends only on last two digits
  • Generalization: Same technique proves divisibility rules for powers of 2 (e.g., rule for 8 uses last three digits)

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 Substack. For deeper dives and regular tips, join my GitHub. Let's tackle these challenging math problems together! You can also catch my daily math content on YouTube - HSC Maths Extension 1+2.