modular arithmetic
modular arithmetic
1955–60
Based on the Random House Dictionary, © Random House, Inc. 2012.
Cite This Source
00:10
00:09
00:08
00:07
00:06
00:05
00:04
00:03
00:02
00:01
| a calculus or concretion found in the stomach or intestines of certain animals, esp. ruminants, formerly reputed to be an effective remedy for poison. |
| a children's mummer's parade, as on the Fourth of July, with prizes for the best costumes. |
modular arithmetic definition
mathematics(Or "clock arithmetic") A kind of integer arithmetic that reduces all numbers to one of a fixed set [0..N-1] (this would be "modulo N arithmetic") by effectively repeatedly adding or subtracting N (the "modulus") until the result is within this range.
The original mathematical usage considers only __equivalence__ modulo N. The numbers being compared can take any values, what matters is whether they differ by a multiple of N. Computing usage however, considers modulo to be an operator that returns the remainder after integer division of its first argument by its second.
Ordinary "clock arithmetic" is like modular arithmetic except that the range is [1..12] whereas modulo 12 would be [0..11].
(2003-03-28)
modular arithmetic
in its most elementary form, arithmetic done with a count that resets itself to zero every time a certain whole number N greater than one, known as the modulus (mod), has been reached. Examples are a digital clock in the 24-hour system, which resets itself to 0 at midnight (N = 24), and a circular protractor marked in 360 degrees (N = 360). Modular arithmetic is important in number theory, where it is a fundamental tool in the solution of Diophantine equations (particularly those restricted to integer solutions). Generalizations of the subject led to important 19th-century attempts to prove Fermat's last theorem and the development of significant parts of modern algebra.
Learn more about modular arithmetic with a free trial on Britannica.com.
Cite This Source
