Gujarat BoardEnglish MediumSTD 12 ScienceMathsAppendix 25 Marks
Question
Show that the set of all prime numbers is infinite.
✓
Answer
Let P be the set of all prime numbers. We take the negation of the statement “the set of all prime numbers is infinite”, i.e., we assume the set of all prime numbers to be finite. Hence, we can list all the prime numbers as $P_1 , P_2 , P_3 ,..., P_k$ (say). Note that we have assumed that there is no prime number other than $P_1 , P_2 , P_3 ,..., P_k$ . Now consider $N = (P_1 , P_2 , P_3 ,..., P_k + 1)$ ... (i)
N is not in the list as N is larger than any of the numbers in the list. N is either prime or composite. If N is a prime, then by (i), there exists a prime number which is not listed. On the other hand, if N is composite, it should have a prime divisor. But none of the numbers in the list can divide N, because they all leave the remainder 1. Hence, the prime divisor should be other than the one in the list. Thus, in both the cases whether N is a prime or a composite, we ended up with contradiction to the fact that we have listed all the prime numbers. Hence, our assumption that a set of all prime numbers is finite is false. Thus, the set of all prime numbers is infinite.
Need a full question paper?
Generate a complete, print-ready paper with questions like this in minutes — across 16+ boards, with answer keys.