Question: The purpose of this problem is to determine how many prime numbers there are. Suppose there are a total of (n) prime numbers, and we

The purpose of this problem is to determine how many prime numbers there are. Suppose there are a total of \(n\) prime numbers, and we list these in order: \(p_{1}=2

a. Define \(X=1+p_{1} p_{2} \ldots p_{n}\). That is, \(X\) is equal to one plus the product of all the primes. Can we find a prime number \(P_{m}\) that divides \(X\) ?

b. What can you say about \(m\) ?

c. Deduce that the total number of primes cannot be finite.

d. Show that \(P_{n+1} \leq 1+p_{1} p_{2} \ldots p_{n}\).

Step by Step Solution

3.46 Rating (156 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

a We are assuming that pn is the largest of all primes Because ... View full answer

blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Cryptography And Network Security Questions!