modulo-and-coprime-to m, n, mn respectively; then there's a bijection between AxB and C, via the [Chinese Remainder Theorem]?.) |
modulo-and-coprime-to m, n, mn respectively; then there is a bijection between AxB and C, via the [Chinese Remainder Theorem]?.) |
If n = p1k1 ... prkr |
The value of φ(n) can be computed using the fundamental theorem of arithmetic: if n = p1k1 ... prkr |
(Sketch of proof: the case r=1 is easy, and the general result follows by multiplicativity.) |
(Sketch of proof: the case r = 1 is easy, and the general result follows by multiplicativity.) |