Reduced residue system

From Wikipedia, the free encyclopedia

A reduced residue system modulo n is a set of φ(n) integers such that each integer is relatively prime to n and no two are congruent modulo n. Here φ denotes Euler's totient function.

[edit] Facts

  • If \{ r_1, r_2, \dots, r_{\varphi(n)} \} is a reduced residue system with n > 2, then \sum r_i \equiv 0 \pmod n.

[edit] See also

[edit] External links

 This mathematics-related article is a stub. You can help Wikipedia by expanding it.