| Revision as of 16:32, 30 January 2008 editTomaxer (talk | contribs)Autopatrolled, Extended confirmed users, Pending changes reviewers9,214 editsm Rewritten formulas← Previous edit | Revision as of 05:55, 12 March 2008 edit undoJay Gatsby (talk | contribs)Extended confirmed users1,702 editsm →Facts: subscriptNext edit → | ||
| Line 2: | Line 2: | ||
| ==Facts== | ==Facts== | ||
| *If <math>\{ r_1, r_2, \dots, r_\varphi(n) \}</math> is a reduced residue system with ''n'' > 2, then <math>\sum r_i \equiv 0 \pmod n</math>. | *If <math>\{ r_1, r_2, \dots, r_{\varphi(n)} \}</math> is a reduced residue system with ''n'' > 2, then <math>\sum r_i \equiv 0 \pmod n</math>. | ||
| ==See also== | ==See also== | ||
Revision as of 05:55, 12 March 2008
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.
(n) integers such that each integer is relatively prime to n and no two are congruent modulo n. Here Facts
- If is a reduced residue system with n > 2, then .
is a reduced residue system with n > 2, then 
.See also
External links
- Reduced residue system at MathWorld
 | This mathematics-related article is a stub. You can help Misplaced Pages by expanding it. |