Misplaced Pages

This is an old revision of this page, as edited by Jay Gatsby (talk | contribs) at 06:49, 27 March 2007 (creation). The present address (URL) is a permanent link to this revision, which may differ significantly from the current revision.

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

Facts

• If {r₁, r₂, ... , r_{${\displaystyle \phi }$(n)}} is a reduced residue system with n > 2, then ${\displaystyle \sum r_{i}=0}$ (mod n).

See also

• Residue number system

External links

• Reduced residue system at MathWorld

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

• v
• t
• e

• Mathematics stubs
• Elementary number theory