Modular Arithmetic
Unit fractions play an important role in modular arithmetic, as they may be used to reduce modular division to the calculation of greatest common divisors. Specifically, suppose that we wish to perform divisions by a value x, modulo y. In order for division by x to be well defined modulo y, x and y must be relatively prime. Then, by using the extended Euclidean algorithm for greatest common divisors we may find a and b such that
from which it follows that
or equivalently
Thus, to divide by x (modulo y) we need merely instead multiply by a.
Read more about this topic: Unit Fraction
Famous quotes containing the word arithmetic:
“‘Tis no extravagant arithmetic to say, that for every ten jokes,—thou hast got an hundred enemies; and till thou hast gone on, and raised a swarm of wasps about thine ears, and art half stung to death by them, thou wilt never be convinced it is so.”
—Laurence Sterne (1713–1768)