UNIT:サンプル@

1 Prime numbers

日本語版: 2節

事実1.1

Every integer grater than 11 has at least one prime factor.

定理1.2 (Infinitude of prime numbers)

There are infinitely many prime numbers.

証明

Suppose for the sake of contradiction that there are only finitely many prime numbers. Let them be listed as p1p_{1}, \dots, pnp_{n}, and set P=p1pn+1P=p_{1}\dotsm p_{n}+1. Since P>1P>1, by 事実1.1, PP must have at least one prime factor, which we will call qq. Since qq is a prime number, it must be either one of the primes p1p_{1}, \dots, pnp_{n}. However, this contradicts to the fact that qq divides PP 11 1 It follows from the choice of qq.. Therefore, there are infinitely many prime numbers. ∎

注意1.3

定理1.2 is also called Euclid’s theorem.