The Mirroring Method for Digit-Level Divisibility in Base Ten

The Mirroring Method is a new digit-level divisibility test that refines the classical 
1001-pairing rule by exploiting the full modular periodicity of powers of 10. Its key 
feature is a symmetry phenomenon: whenever the multiplicative order of 10 modulo a 
prime p is even, the residues 10^0, 10^1, ..., 10^(m-1) (where m is half the order) are 
followed by a mirrored sequence -10^0, -10^1, ..., -10^(m-1), with all signs flipped. 
This "mirror line" allows consecutive m-digit blocks to be paired and subtracted 
positionally, producing a compact linear combination of digit-differences with fixed weights.

For the primes p = 7, 11, 13 the order of 10 is 6, so m = 3, and the weights reduce to 
(1, 10, 100) modulo p, yielding a particularly simple three-operation test. Unlike the 
classical alternating 3-digit block method, which may generate large intermediate 
values, the Mirroring Method keeps all intermediate results uniformly small. For a 
single 6-digit window the bound is at most 54 for p = 7 and 72 for p = 13; for a 
12-digit input (two windows) these bounds double to 108 and 144, respectively. In 
general, k windows yield bounds growing linearly with k, making the final congruence 
check easy to perform mentally.

We present proofs, examples, visual diagrams for the cubic case, explain the role of 
the mirrored residue cycle, and show how the same principle generalizes: whenever the 
multiplicative order of 10 modulo p is 2m, the test uses m digit-pair differences with 
corresponding weights 10^(j-1) mod p. This provides a unified framework for constructing 
practical pairing rules across all such primes.