document.write( "Question 935640: Hi !\r
\n" ); document.write( "\n" ); document.write( "Here is a very concrete sequence i 've found in mersenne primes:\r
\n" ); document.write( "\n" ); document.write( "n=
\n" ); document.write( "1,2,3,4,6,7,8,11,18,24,28,31,98,111,207,328,339,455,583,602,1196 ...\r
\n" ); document.write( "\n" ); document.write( "power of every Nth of the prime sequence, of 2^(p[n]) -1 is a mersenne number..
\n" ); document.write( "

Algebra.Com's Answer #570801 by richard1234(7193)\"\" \"About 
You can put this solution on YOUR website!
Nice. But are there infinitely many of them? \n" ); document.write( "
\n" );