History of Integer

	Revision 12 . . December 17, 2001 4:47 am by Stuart Presnell
	Revision 11 . . (edit) December 13, 2001 8:58 am by Bryan Derksen [added warning about unicode display]
	Revision 10 . . December 9, 2001 4:06 pm by Bryan Derksen [mention symbol]
	Revision 9 . . November 21, 2001 12:27 am by AxelBoldt [link to Euclidean algorithm]
	Revision 8 . . (edit) November 20, 2001 7:38 pm by Andre Engels [read again and found the uniqueness was already mentioned]
	Revision 7 . . (edit) November 20, 2001 7:38 pm by Andre Engels [division by rest: _unique_ integers]
	Revision 6 . . August 18, 2001 10:43 am by AxelBoldt [positive numbers]

---

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

Changed: 21c21

All of this can be abbreviated by saying that Z is a [euclidean domain]?. It implies that Z is a [principal ideal domain]? and that whole numbers can be written as products of primes in an essentially unique way.

All of this can be abbreviated by saying that Z is a [euclidean domain]?. It implies that Z is a [principal ideal domain]? and that whole numbers can be written as products of primes in an essentially unique way. This is the fundamental theorem of arithmetic.