History of Fundamental theorem of arithmetic

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

Changed: 2c2

:6936 = 2³ * 3 * 17²

:6936 = 2³ × 3 × 17²

Changed: 6,7c6,7

:2^a * 3^b * 17^c
with 0 ≤ a ≤ 3, 0 ≤ b ≤ 1, and 0 ≤ c ≤ 2. This yields a total of 4*2*3 = 24 positive factors.

:2^a × 3^b × 17^c
with 0 ≤ a ≤ 3, 0 ≤ b ≤ 1, and 0 ≤ c ≤ 2. This yields a total of 4 × 2 × 3 = 24 positive factors.

	Revision 9 . . December 18, 2001 4:29 am by Uriyan
	Revision 8 . . December 18, 2001 3:46 am by Hagedis [making euclids algorithm a redirect]
	Revision 7 . . December 18, 2001 3:41 am by AxelBoldt [link Euclid's algorithm to [[greatest common divisor]], where it is explained]
	Revision 6 . . December 18, 2001 3:16 am by Hagedis [minor sentence reorder]
	Revision 5 . . November 30, 2001 5:34 am by AxelBoldt
	Revision 4 . . November 29, 2001 12:43 am by AxelBoldt [+example]
	Revision 3 . . (edit) November 28, 2001 8:16 pm by Gareth Owen
	Revision 2 . . November 28, 2001 8:55 am by Cwitty [add actual content]
	Revision 1 . . November 26, 2001 10:51 pm by (logged).100.77.xxx