A Mersenne prime is a prime number of the form M = 2^p - 1, where p is another prime number. For example, 31 is a Mersenne prime because 31 = 2^5 - 1 and both 31 and 5 are prime numbers.
Implement the function isMersenne(x) so that it returns true if x is a Mersenne prime and false otherwise. Your solution should work for all positive integer values of x less than 1,000,000,000 (one billion).
Solution Stats
Problem Comments
4 Comments
Solution Comments
Show comments
Loading...
Problem Recent Solvers967
Suggested Problems
-
Back to basics 21 - Matrix replicating
1789 Solvers
-
Convert from Base 10 to base 5
281 Solvers
-
Cell Counting: How Many Draws?
2381 Solvers
-
Remove element(s) from cell array
1980 Solvers
-
1710 Solvers
More from this Author1
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
2047 must turn true... gotta deal with this
No. 2047 is not a Mersenne prime. 2047=23*89, even though it is true that 2047=2^11-1.
Some correct solutions are not logically correct, the test case must be fixed
You need not specify that p is prime in the formula M = 2^p - 1 as it is redundant to do so.