> > 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. Robert