Complete residue system
Builds on Residue class
Definition
Let be a positive integer. A complete residue system modulo is a set of integers that contains exactly one element of each residue class modulo .
Remarks
Equivalently, has exactly elements, and no two distinct elements of are congruent modulo . The set is the set of the least nonnegative residues. It is a complete residue system modulo . For odd , the set of the least absolute residues is also a complete residue system. If is a complete residue system modulo and , then is also a complete residue system for each integer .
Reading path
To understand this page from the ground up, read these 4 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Divisibility definition
- Congruence modulo n definition
- Residue class definition
- Complete residue system definition
Further reading
- Web https://en.wikipedia.org/wiki/Modular_arithmetic, Residue systems
About this page
| Tag | 0E22JKS4W4 |
|---|---|
| URI | m2://0E22JKS4W4 |
| Aliases | complete-system-of-residues |
| Kind | definition |
| Writing | W0 stub |
| MSC | 11A07 |
| Defines | Complete residue system |
| Uses | Residue class |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.