Re: *unique* prime factorizations; the fundamental theorem of arithmetic


porky_pig_jr@xxxxxxxxxxx wrote:
Doug Goncz wrote:
1) Has the fundamental theorem of arithmetic got a proof?

It's better be one ... or we would have to demote it to the
'fundamental axiom of arithmetic' :-)

Probably you can find the proof in some number-theoretical textbooks.
The proof I saw was in Apostol's Analysis. Nice and elegant proof,
using the strong induction principle.

Yes; it's the one I use in a course that I teach, when we do induction.
It's a very nice use of strong induction.

Uniqueness can also be proven with strong induction, once you have a
prime that divides both representations.

--- Christopher Heckman

.

Relevant Pages

  • Re: K-regular bipartitie graph
    ... How can one prove that a k-regulatr bipartite graph has a perfect ... Induction, and Hall's Condition. ... --- Christopher Heckman ...
    (comp.theory)
  • Re: It is not easy
    ... Rob wrote: ... Try induction on the sum of a,b,c,d,e. ... --- Christopher Heckman ...
    (sci.math)