A method for finding remainders where all the possible numbers (the numbers less than the divisor) are put in a circle, and then by counting around the circle the number of times of the number being divided, the remainder will be the final number landed on.
two numbers are considered equal (congruent) if heir difference is divisible by the base. Thus, . Numbers are represented by integers between and , where is the base. Multiplication, addition, and subtraction are normal, except that the results are reduced. Division is performed by reducing fractions to least terms, applying an extended Euclid's algorithm to find the inverse of the denominator, and then performing multiplication. Symbol: mod