Problem 525. Mersenne Primes
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
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.
Solution Comments
Show commentsProblem Recent Solvers839
Suggested Problems
-
2164 Solvers
-
Sum of first n terms of a harmonic progression
444 Solvers
-
Fix the last element of a cell array
1549 Solvers
-
1017 Solvers
-
Solve a System of Linear Equations
12686 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!