This site is supported by donations to The OEIS Foundation.
Residue systems
A subset of the set of integers is called a residue system modulo if no two elements of are congruent modulo .
For example, a residue system modulo 12 is {12, 13, 14, 15, 22, 23}, which is equivalent to {0, 1, 2, 3, 10, 11}.
Complete residue systems
A subset of the set of integers is called a complete residue system modulo if
- no two elements of are congruent modulo ,
- contains elements.
For example, a complete residue system modulo 12 is {12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23}, which is equivalent to {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}.
Reduced residue systems
A subset of the set of integers is called a reduced residue system modulo if
- no two elements of are congruent modulo ,
- for each ,
- contains elements,
where denotes Euler's totient function.
A reduced residue system modulo can be formed from a complete residue system modulo by removing all integers not relatively prime to .
For example, a complete residue system modulo 12 is {0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11}. 1, 5, 7 and 11 are the only integers in this set which are relatively prime to 12, and so the corresponding reduced residue system modulo 12 is {1, 5, 7, 11}. Note that the cardinality of this set is . Some other reduced residue systems modulo 12 are {13, 17, 19, 23} and {−11, −7, −5, −1}.
Totatives
A reduced residue system modulo where all residues are in is called the set of totatives of .
A051250 Numbers whose reduced residue system consists of 1 and prime powers only. (Conjecture: the sequence is finite and 60 is the largest term, empirically verified up to 10^7.)
- {1, 2, 3, 4, 5, 6, 8, 9, 10, 12, 14, 18, 20, 24, 30, 42, 60, ?}