A Mersenne number is a positive integer of the form (2^n)-1

A prime number is a positive integer that has exactly two distinct positive integer divisors,

namely 1 and the number itself. (The number 1 is not considered a prime number by definition).

A Mersenne prime is a Mersenne number that is prime. The first few Mersenne primes are 3,

7, 31, 127, 8191, ... As of this date there are 45 confirmed Mersenne primes and another 5

than are thought to be but have not been verified yet.

Write a C program that finds and prints the first 7 Mersenne primes. You can assume that the

function isPrime which determines if its argument is a prime number has already been defined.