History of Eulers phi function

	Revision 9 . . December 3, 2001 6:51 am by AxelBoldt
	Revision 8 . . (edit) December 3, 2001 6:17 am by (logged).92.67.xxx
	Revision 7 . . November 30, 2001 4:54 am by Uriyan [removed vandalism]
	Revision 6 . . November 8, 2001 11:27 pm by (logged).18.248.xxx

---

Difference (from prior major revision) (no other diffs)

Changed: 5c5

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]?.)

Changed: 7c7

If n = p1k1 ... prkr

The value of φ(n) can be computed using the fundamental theorem of arithmetic: if n = p1k1 ... prkr

Changed: 10c10

(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.)