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).
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.
cheating wirth system
isn't 2047 supposed to give true?? it satisfies the criteria. But the test suite has it as false. what am i missing?
No. 23*89.
226 Solvers
Determine if input is a perfect number
106 Solvers
133 Solvers
225 Solvers
912 Solvers