[FOM] Only one proof

Timothy Y. Chow tchow at alum.mit.edu
Tue Sep 8 09:36:25 EDT 2009

Vaughan Pratt <pratt at cs.stanford.edu> wrote:
> But what about the Fundamental Theorem of Arithmetic?  All proofs I'm 
> aware of seem to boil down to one version or another of Euclid's GCD 
> algorithm.  Is there a different proof?

There's a proof, sometimes called the "Hasse-Lindemann-Zermelo" proof, 
that proceeds directly by induction without reference to GCDs.  See 
http://math.uga.edu/~pete/factorization.pdf for more info.


More information about the FOM mailing list