(Mersenne prime) A prime number is called a Mersenne prime if it can be written in the form 2p - 1 for some positive integer p. Write a program that finds all Mersenne primes with p … 100 and displays the output as shown below.
(Hint: You have to use BigInteger to store the number, because it is too big to be stored in long. Your program may take several hours to run.)
p | 2^p – 1 |
2 | 3 |
3 | 7 |
5 | 31 |
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.