Sample unit
Read one complete unit before you enrol, exactly as participants receive it: the full text with its proofs, worked examples, and research spotlight.
Unit 3, 16 pages
Prime Numbers and Unique Factorization
Every integer greater than 1 is a product of primes in exactly one way, and this unit proves it, from the smallest divisor of a number to Euclid's lemma. It shows how the sieve of Eratosthenes finds every prime below a bound, why Euclid's argument gives endlessly many primes without a formula for them, how the exponents of a factorization answer questions about divisors, square roots, and factorials, and why recognizing a prime is a far easier task than factoring a number.
By the end of the unit you can answer
- Why does every integer greater than 1 have at least one prime factor, and why does a composite number have one at most equal to its square root?
- How did Euclid prove that there are infinitely many primes, and why does his proof give no formula for them?
- Why can 360 be written as a product of primes in only one way, apart from the order of the factors?
- In the numbers 1, 5, 9, 13, 17, and so on, why does 441 factor in two different ways, and what does that tell me about the ordinary integers?
- How does the sieve of Eratosthenes find every prime below 100, and why can it stop crossing out after 7?