The Fundamental Theorem of Arithmetic

John W. Dawson
Additional contact information
John W. Dawson: Penn State York

Chapter Chapter 6 in Why Prove it Again?, 2015, pp 41-49 from Springer

Abstract: Abstract The Fundamental Theorem of Arithmetic (FTA) states that every integer greater than 1 has a factorization into primes that is unique up to the order of the factors. The theorem is often credited to Euclid, but was apparently first stated in that generality by Gauss. Note that the statement has two parts: First, every integer greater than 1 has a factorization into primes; second, any two factorizations of an integer greater than 1 into primes must be identical except for the order of the factors. The proofs of each of those parts will thus be considered separately.

Date: 2015
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-319-17368-9_6

Ordering information: This item can be ordered from
http://www.springer.com/9783319173689

DOI: 10.1007/978-3-319-17368-9_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().