fashion. Observe that no computer could ever answer the question, because it is a question about infinity. Only the mind could. Here is Euclid’s proof. Suppose that on the contrary the set of prime numbers is finite, so we can count them in increasing order, omiting unity: p1, p2, · · ·, pn Consider then the number: M = _ + 1 were _ is the product p1p2 · · · pn 1 This number being larger than the last prime, pn, must be composite. Then M must have a prime factor, say q. So q must be one of of the p1…
Words 2718 - Pages 11