Reduced residue system

From Wikipedia, the free encyclopedia

You have new messages (last change).

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 {r1, r2, ... , rφ(n)} is a reduced residue system with n > 2, then \sum r_i=0 (mod n).

[edit] See also

[edit] External links


 This mathematics-related article is a stub. You can help Wikipedia by expanding it.
Retrieved from "http://en.wikipedia.org../../../r/e/d/Reduced_residue_system.html"