Mersenne Prime | Generate all prime numbers less than n . ; Initialize all entries of boolean array as true . A value in prime [ i ] will finally be false if i is Not a prime , else true bool prime [ n + 1 ] ; ; If prime [ p ] is not changed , then it is a prime ; Update all multiples of p ; Function to generate mersenne primes lessthan or equal to n ; Create a boolean array " prime [ 0 . . n ] " ; Generating primes using Sieve ; Generate all numbers of the form 2 ^ k - 1 and smaller than or equal to n . ; Checking whether number is prime and is one less then the power of 2 ; Driver Code
function SieveOfEratosthenes ( n , prime ) { for ( let i = 0 ; i <= n ; i ++ ) prime [ i ] = true ; for ( let p = 2 ; p * p <= n ; p ++ ) { if ( prime [ p ] == true ) { for ( let i = p * 2 ; i <= n ; i += p ) prime [ i ] = false ; } } } function mersennePrimes ( n ) { let prime = [ ] ; SieveOfEratosthenes ( n , prime ) ; for ( let k = 2 ; ( ( 1 << k ) - 1 ) <= n ; k ++ ) { let num = ( 1 << k ) - 1 ; if ( prime [ ( num ) ] ) document . write ( num + " " ) ; } } let n = 31 ; document . write ( " " + " " + " " + n + " " ) ; mersennePrimes ( n ) ;