Geeksforgeeks

X

DAYS

:

HOUR

:

MINS

:

SEC

Error

Copied to Clipboard

Mersenne Prime is a prime number that is one less than a power of two. In other words, any prime is Mersenne Prime if it is of the form 2^{k}-1 where k is an integer greater than or equal to 2. First few Mersenne Primes are 3, 7, 31 and 127.

The task is to find all Mersenne Primes smaller than equal to an input positive integer n.

**Example 1:**

**Input: **n = 10
**Output: **3 7
**Explanation:**3 and 7 are only prime numbers
which are less than equal to 10 and in the
form of 2^{k} - 1.

**Example 2:**

**Input: **n = 100
**Output: **3 7 31
**Explanation: **3, 7 and 31 are only prime
numbers which are less than equal to 100
and in the form of 2^{k} - 1.

**Your Task:**

You don't need to read or print anything. Your task is to complete the function **AllMersennePrimeNo()** which takes n as input parameter and returns a list of all Mersenne Primes less than or equal to n in sorted order.

**Expected Time Complexity: **O(n * log(log(n))

**Expected Space Complexity: **O(n)

**Constraints: **

1 <= n <= 100000

We are replacing the old Disqus forum with the new Discussions section given below.

Click here to view old Disqus comments.

Click here to view old Disqus comments.

Login to report an issue on this page.

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

YesLoading...

Mersenne Prime

...

Here is some troubleshooting advice:

- Reset the IDE using the second button on the top right corner.
- Avoid using static/global variables in your code as your code is tested against multiple test cases and these tend to retain their previous values.
- Passing the Sample/Custom Test cases does not guarantee the correctness of code. On submission, your code is tested against multiple test cases consisting of all possible corner cases and stress constraints.
- You can access the hints to get an idea about what is expected of you as well as the final solution code.
- You can view the solutions submitted by other users from the submission tab.

Here is some troubleshooting advice for contest problems

- Make sure you are not using ad-blockers.
- Disable browser extensions.
- We recommend using latest version of your browser for best experience.
- Avoid using static/global variables in coding problems as your code is tested against multiple test cases and these tend to retain their previous values.
- Passing the Sample/Custom Test cases in coding problems does not guarantee the correctness of code. On submission, your code is tested against multiple test cases consisting of all possible corner cases and stress constraints.