Draft:Factor-Digit Divisibility Criterion

---

Factor-Digit Divisibility Criterion (FDDC), also referred to as the Raines Factor-Digit Divisibility Theorem (RFDDC), is a principle in number theory concerning the divisibility of numbers in positional numeral systems with composite bases. It states that for any composite base and any nontrivial factor of that base, the divisibility of a number by that factor depends solely on the number’s least significant digit in that base.

While the underlying idea is a direct consequence of standard modular arithmetic, it has not commonly been presented as a standalone concept. The criterion was articulated by Peter Raines, who observed that the familiar "last-digit" divisibility rules for 2 and 5 in base 10 are special cases of a more general pattern applicable to any composite base.

Statement

Let $b$ be a composite integer (the base) and $f$ be a nontrivial factor of $b$ (that is, $1<f<b$). Consider a number $n$ expressed in base $b$: $n=d_k{b}^k+d_{k-1}{b}^{k-1}+\cdots +d_{1}b+d_0$, where $d_0$ is the least significant digit.

The Factor-Digit Divisibility Criterion states:

$n$ is divisible by $f$ if and only if $d_0$ is divisible by $f$.

Proof

Since $f\mid b$, it follows that $b\equiv 0(\mathrm{mod}f)$, and therefore $b^k\equiv 0(\mathrm{mod}f)$ for all $k\ge 1$. Substituting into the expansion of $n$: $n\equiv d_0(\mathrm{mod}f)$.

This implies that $n$ is divisible by $f$ if and only if $d_0$ is divisible by $f$.

Examples

• Base 10:

 Digits 0–9.
 Prime Factors: 2, 5.
 - Divisible by 2 if the last digit is 0, 2, 4, 6, or 8.
 - Divisible by 5 if the last digit is 0 or 5.

• Base 15:

 Digits 0–9, A=10, B=11, C=12, D=13, E=14.
 Prime Factors: 3, 5.
 - Divisible by 3 if last digit is 0, 3, 6, 9, or C (12).
 - Divisible by 5 if last digit is 0, 5, or A (10).

• Base 12:

 Digits 0–9, A=10, B=11.
 Prime Factors: 2, 2, 3.
 - Divisible by 2 if last digit is 0, 2, 4, 6, 8, or A.
 - Divisible by 3 if last digit is 0, 3, 6, or 9.

Significance

The Factor-Digit Divisibility Criterion reveals that well-known divisibility tests in base 10 are not unique to the decimal system. Instead, they reflect a general property of composite bases. While the principle is straightforward from a modular arithmetic standpoint, recognizing and naming it as a standalone concept may aid in teaching and understanding divisibility rules in a broader context.

See also

• Divisibility rule
• Modular arithmetic
• Base (mathematics)
• Positional notation

Further reading

• Template:Cite book
• Template:Cite book
• Template:Cite book
• Template:Cite book