Page 6 - 'Blast_Into_Math
P. 6
Blast into Math! Contents
3.4 Proof by induction 51
3.5 Exercises 58
3.6 Examples and hints 63
4 The Euclidean algorithm: a computational recipe 67
4.1 Division 67
4.2 Greatest common divisors 74
4.3 Proof of the Euclidean Algorithm 79
4.4 Greatest common divisors in disguise 81
4.5 Exercises 85
4.6 Examples and hints 87
5 Prime numbers: indestructible building blocks 94
5.1 Ingredients in the proof of the Fundamental Theorem of Arithmetic 94
5.2 Unique prime factorization: the Fundamental Theorem of Arithmetic 98
5.3 How many primes are there? 102
5.4 Counting infinity 104
5.5 Exercises 119
5.6 Examples and hints 120
6
