Practice question · Select all that apply
Select every statement that the Fundamental Theorem of Arithmetic guarantees.
Hints
- The theorem has two halves: existence of a factorization and uniqueness of it.
- If two integers had the same factorization, they would be the same product, hence the same number.
Show the answer
- A. Every integer greater than 1 can be written as a product of primes
- B. Since 60 = 2 x 2 x 3 x 5, no other collection of primes multiplies to 60
- D. That prime factorization is unique apart from the order of the factors
Why
Existence plus uniqueness is the whole theorem, and the 60 statement is uniqueness applied. 1 is excluded because it is not greater than 1 and has no prime factors at all. And identical factorizations force identical products, so distinct integers can never share one.
Practise Primes and the Fundamental Theorem of Arithmetic
The app has 5 more questions on this lesson, and keeps your place in the course. Mathematics I is free to start.
More questions on Primes and the Fundamental Theorem of Arithmetic
- If 1 were counted as prime, unique factorisation would fail.
- RSA encryption relies on multiplying two large primes being easy while factoring the product is hard. Why is…
- Order the steps of Euclid's proof that there are infinitely many primes.
- 1 is neither prime nor composite. Why is it excluded rather than counted as prime?