Also known as clock arithmetic, this operation involves residue classes and is often written using congruence notation.
This operation creates equivalence classes based on the ideal of a ring, and can be used to efficiently express Euler's (OY-lurz) Theorem and Fermat's (fair-MAHZ) Little Theorem without using subtraction and divisibility. It also ex- plains why casting out nines can be used to check calculations. Single-bit Boolean algebra is equivalent to this opera- tion using two, and though it is not a type of number base, this operation is a type of arithmetic. Also known as clock arithmetic, this operation involves residue classes and is often written using congruence notation. Name this type of arithmetic based on division remainders.
This operation creates equivalence classes based on the ideal of a ring, and can be used to efficiently express Euler's (OY-lurz)
{modular} arithmetic [or {modulo}; prompt on {clock arithmetic} before it is mentioned; accept word forms