modulo N

modulo N

[′mäj·ə‚lō ′en]
(mathematics)
Two integers are said to be congruent modulo N (where N is some integer) if they have the same remainder when divided by N.
References in periodicals archive ?
Let n; d be positive integers, n > 1 and d|n: Then every reduced residue system modulo n can be divided into [phi](n)/[phi](d) reduced residue systems modulo d.