*Nm*= p1. p2 ...pm + 1, for m more than or equals 1.

So N1 = p1 + 1 = 2 + 1 = 3, N2 = p1 p2 + 1 = 2 3 + 1 = 7, etc.

We prove that Nm is not divisible by any of p1, p2, . . . , pm, so that *Nm* is either a prime or it is divisible by a prime larger than pm.

(c) Use Maple to find out which of these numbers *Nm*, for m = 1, 2, . . . , 15, is actually prime.

Use Maple to compare *pm *with the smallest prime number that divides *Nm*, for *m *=1, 2, . . . , 15.