Noun
modular arithmetic (countable and uncountable, plural modular arithmetics)
(number theory) Any system of arithmetic for integers which, for some given positive integer n, is equivalent to the set of integers being mapped onto the finite set {0, ... n} according to congruence modulo n, and in which addition and multiplication are defined consistently with the results of ordinary arithmetic being so mapped.
Checksums main A checksum of a message is a modular arithmetic sum of message code words of a fixed word length (e. Source: Internet
Computational complexity Since modular arithmetic has such a wide range of applications, it is important to know how hard it is to solve a system of congruences. Source: Internet
Finding publisher codes for English and German, say, with this effect amounts to solving a linear equation in modular arithmetic. Source: Internet
In modular arithmetic notation, define the function f as follows: : Now, form a sequence by performing this operation repeatedly, beginning with any positive integer, and taking the result at each step as the input at the next. Source: Internet
It is based on modular arithmetic modulo 9, and specifically on the crucial property that 10 ≡ 1 (mod 9). Source: Internet
See in particular chapters 5 and 6 for a review of basic modular arithmetic. Source: Internet