Scribd
Upload
124 views1 page

Fundamental Theorem of Arithmetic

The Fundamental Theorem of Arithmetic states that every integer greater than 1 can be written as a unique product of prime factors. The proof uses the Well-ordering Principle of natural numbers and proceeds in two parts: 1) Every integer greater than 1 can be written as a product of prime factors. 2) This factorization is unique up to the order of factors.

Uploaded by

Bianca Lacsamana Ulan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
124 views1 page

Fundamental Theorem of Arithmetic

The Fundamental Theorem of Arithmetic states that every integer greater than 1 can be written as a unique product of prime factors. The proof uses the Well-ordering Principle of natural numbers and proceeds in two parts: 1) Every integer greater than 1 can be written as a product of prime factors. 2) This factorization is unique up to the order of factors.

Uploaded by

Bianca Lacsamana Ulan
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 1

Fundamental Theorem of Arithmetic.

If a is an integer larger than 1, then


a can be written as a product of primes. Furthermore, this factorization is unique
except for the order of the factors.
proof: There are two things to be proved. Both parts of the proof will use the
Well-ordering Principle for the set of natural numbers.
(1) We first prove that every a > 1 can be written as a product of prime
factors. (This includes the possibility of there being only one factor in case a is
prime.) Suppose bwoc that there exists a integer a > 1 such that a cannot be
written as a product of primes. By the Well-ordering Principle, there is a smallest
such a . Then by assumption a is not prime so a = bc where 1 < b, c < a . So b
and c can be written as products of prime factors (since a is the smallest positive
integer than cannot be.) But since a = bc , this makes a a product of prime
factors, a contradiction.
(2) Now suppose bwoc that there exists an integer a > 1 that has two
different prime factorizations, say a = p1 ps = q1 qt , where the pi and
qj are all primes. (We allow repetitions among the pi and qj . That way, we
dont have to use exponents.) Then p1 | a = q1 qt . Since p1 is prime, by the
Lemma above, p1 | qj for some j . Since qj is prime and p1 > 1 , this means that
p1 = qj . For convenience, we may renumber the qj so that p1 = q1 . We can
now cancel p1 from both sides of the equation above to get p2 ps = q2 qt .
But p2 ps < a and by assumption a is the smallest positive integer with a
nonunique prime factorization. It follows that s = t and that p2 , . . . , ps are
the same as q2 , . . . , qt , except possibly in a different order. But since p1 = q1 as
well, this is a contradition to the assumption that these were two different
factorizations. Thus there cannot exist such an integer a with two different
factorizations. X

You might also like