Mersenne Prime number
Problem to print the N Mersenne Prime numbers.
The number which return prime number while applying the formula 2s -1 is called mersenne prime number
if n=4 => 21-1 = 1 (It's not a prime number) => 22-1 = 3 (It's prime number. So It's Mersenne Prime number.) => 23-1 = 7 (It's prime number But 2s-1<=n)
Example-1:
Input : n=10 Output : 3 7 Explain : 3 7 these numbers are Mersenne Prime number.
Example-2:
Input : n=5 Output : 3 Explain : 3 is a Mersenne Prime number.
Solution
n=10 k=0 for i in range(2,n+1): a=(2**i)-1 for j in range(2,a): if(a%j==0): break else: if(a<=n): print(a,end=" ") else: k=1 if(k==1): break
Output:
3 7