Reduced residue system
Builds on Residue classCoprime integers
Definition
Let be a positive integer. A reduced residue system modulo is a set of integers with these properties. Each element of is coprime to . No two distinct elements of are congruent modulo . Each integer coprime to is congruent modulo to some element of .
Remarks
Thus contains exactly one element of each residue class of integers coprime to . It has elements, where is Euler's totient function. For example, is a reduced residue system modulo . If is a reduced residue system modulo and , then is also a reduced residue system modulo . This fact gives a proof of Euler's theorem.
Reading path
To understand this page from the ground up, read these 6 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Divisibility definition
- Congruence modulo n definition
- Greatest common divisor definition
- Residue class definition
- Coprime integers definition
- Reduced residue system definition
Further reading
- Web https://en.wikipedia.org/wiki/Reduced_residue_system, lead section
About this page
| Tag | 0J0QEN1DZR |
|---|---|
| URI | m2://0J0QEN1DZR |
| Aliases | reduced-system-of-residues |
| Kind | definition |
| Writing | W1 stated |
| MSC | 11A07 |
| Defines | Reduced residue system |
| Uses | Residue class, Coprime integers |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (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.