Practice question · True or false
If 1 were counted as prime, unique factorisation would fail.
Hints
- How many ways could you then write 12 as a product of primes?
- 1 can be multiplied in as often as you like.
Show the answer
True
Why
True. , factorisations would stop being unique, and the Fundamental Theorem of Arithmetic would need an awkward exception. Excluding 1 is what keeps 'exactly one factorisation' true as stated.
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
- Select every statement that the Fundamental Theorem of Arithmetic guarantees.
- 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?