The repeating residue patterns produced by integer division and powers evaluated relative to a fixed modulus.
Remainders and Modular Cycles in plain English
Write n = dq + r with 0 ≤ r < d. Generate one full cycle for powers or repeating events, then reduce a large exponent by the cycle length; a remainder can equal the number itself when the divisor is larger.