In mathematics, a subset R of the integers is called a reduced residue system modulo n if: gcd(r, n) = 1 for each r in R, R contains φ(n) elements, no two elements of R are congruent modulo n. Here φ denotes Euler's totient function.
In mathematics, a subset R of the integers is called a reduced residue system modulo n if: gcd(r, n) = 1 for each r in R, R contains φ(n) elements, no two elements of R are congruent modulo n. Here φ denotes Euler's totient function.
Source: Wikipedia "Reduced residue system" · CC BY-SA 4.0
Share this article: X · Bluesky