Mathematical Reasoning

The di­vis­i­bil­i­ty rules for $3$ and $9$ are based on mod­u­lar arith­metic. Since $10 \equiv 1 \pmod{3}$ and $10 \equiv 1 \pmod{9}$, each digit's po­si­tion in the number does not affect its di­vis­i­bil­i­ty by $3$ or $9$.

This el­e­gant prop­er­ty un­der­lies the sim­plic­i­ty of the rules.

Why Does This Work? Step-by-Step Ex­pla­na­tion

Sup­pose you have a number $N$ writ­ten in base $10$ with $n$ digits:

To check di­vis­i­bil­i­ty by $3$, con­sid­er how the powers of $10$ behave in modulo $3$ arith­metic:

• $10^0 = 1 \equiv 1 \pmod{3}$
• $10^1 = 10 \equiv 1 \pmod{3}$
• $10^2 = 100 \equiv 1 \pmod{3}$
• And so on for higher powers.

So,

The same logic holds for $9$ be­cause $10 \equiv 1 \pmod{9}$.

Prac­ti­cal Ex­am­ple

Take $N = 5274$.

• Com­pute the digit sum:

• Since $18$ is di­vis­i­ble by both $3$ and $9$, $5274$ is di­vis­i­ble by both $3$ and $9$.

Vi­su­al­iz­ing with Mod­u­lar Arith­metic

If two num­bers are con­gru­ent modulo $m$, that means their dif­fer­ence is a mul­ti­ple of $m$. For di­vis­i­bil­i­ty by $3$ or $9$, the sum of the digits cap­tures all the rel­e­vant in­for­ma­tion about di­vis­i­bil­i­ty.

• If $N \equiv S \pmod{3}$, then $N$ and $S$ leave the same re­main­der when di­vid­ed by $3$.
• There­fore, if $S$ is di­vis­i­ble by $3$, so is $N$.

Di­vis­i­bil­i­ty by $6$ — Com­bin­ing Rules

Since $6 = 2 \times 3$, a number must be di­vis­i­ble by both $2$ and $3$ to be di­vis­i­ble by $6$.

• Di­vis­i­bil­i­ty by $2$: The last digit is even.
• Di­vis­i­bil­i­ty by $3$: The sum of the digits is di­vis­i­ble by $3$.

Why Not All Num­bers?

Note that these rules are spe­cial to $3$ and $9$ be­cause $10 \equiv 1$ modulo these num­bers. For other di­vi­sors (like $7$ or $11$), sim­i­lar digit-based rules do not gen­er­al­ly apply or are more com­plex, be­cause $10 \not\equiv 1$ modulo those num­bers.

Fur­ther In­tu­ition

The dec­i­mal system (base $10$) is what makes these digit-sum rules pos­si­ble. In other number bases, sim­i­lar but dif­fer­ent rules can be de­vel­oped based on the re­la­tion­ship be­tween the base and the di­vi­sor.

• In base $b$:

• A sim­i­lar rule holds for di­vi­sors of $b-1$:

• This means the sum of the digits of a number in base $b$ de­ter­mines di­vis­i­bil­i­ty by $b-1$.

• For di­vi­sors of $b+1$, we have:

• This leads to an al­ter­nat­ing sum rule for di­vis­i­bil­i­ty by $b+1$ (e.g., in base 10, $11$).

Un­der­stand­ing these pat­terns con­nects basic arith­metic to deeper struc­tures in math­e­mat­ics, such as mod­u­lar arith­metic, number bases, and the re­mark­able con­sis­ten­cy found through­out the number system.