7 kyu
Mersenne Primes
241 of 299Staples
Description:
A Mersenne prime is a prime number that can be represented as: Mn = 2n - 1. Therefore, every Mersenne prime is one less than a power of two.
Write a function that will return whether the given integer n will produce a Mersenne prime or not.
The tests will check random integers up to 2000.
Algorithms
Similar Kata:
Stats:
| Created | Feb 1, 2016 |
| Published | Feb 1, 2016 |
| Warriors Trained | 619 |
| Total Skips | 12 |
| Total Code Submissions | 2274 |
| Total Times Completed | 299 |
| Python Completions | 241 |
| Haskell Completions | 55 |
| Ruby Completions | 29 |
| Total Stars | 6 |
| % of votes with a positive feedback rating | 73% of 117 |
| Total "Very Satisfied" Votes | 73 |
| Total "Somewhat Satisfied" Votes | 25 |
| Total "Not Satisfied" Votes | 19 |
| Total Rank Assessments | 13 |
| Average Assessed Rank | 6 kyu |
| Highest Assessed Rank | 5 kyu |
| Lowest Assessed Rank | 8 kyu |
