Timer is Running

Mersenne Prime
Submissions: 0   Accuracy:

0%

  Difficulty: Easy   Marks: 2

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 2k-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 2k - 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 2k - 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 

 

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Sujnesh Mishra
Author: sujnesh


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.