(Mersenneprime) A prime number is called a Mersenneprime if it can be written in the form of 2p − 1 for some positive integer p. Write a program that finds all Mersenne primes with p ≤ 31 and displays the output as follows:

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.