[FOM] Only one proof

Robert Black mongre at gmx.de
Mon Sep 7 13:02:30 EDT 2009

> 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?
> Vaughan Pratt

I'd have thought that Zermelo's well-known proof, which doesn't depend 
on the euclidean algorithm, ought to count as different.


More information about the FOM mailing list