In the proof of Theorem 4.7 (Euclid’s proof that there are
infinitely many primes), the argument uses calculation of a number
N. In each case below, suppose for the sake of demonstrating a
contradiction, that the given list is the entire list of prime
numbers. Calculate N and then factor N into primes to see that you
do get a contradiction.
(a) 2, 3, 5, 7, 11
(b) 2, 3, 5, 7, 11, 13, 17, 19
(c) 2, 3, 5,...