Challenge: Mersenne primes

Question

Mersenne primes are prime numbers that are 1 less a power of 2.
the exponent of the power must be a prime number, so a mersenne prime (n) satisfies this relation:
n=2^p-1 (p is prime)

task: write a code - in any language you prefer - that, once user provedes an input x finds all mersenne primes from 1 to x

happy coding :)

Answer 1

Another Beaut!

https://code.sololearn.com/W2qstlaONCZH/#html

Answer 2

Fun fact!
The Largest prime no is also Mersenne prime
It is (2 ^ 74,207,281) − 1
It has 22,338,618 digits!!

Answer 3

Check out mine....

https://code.sololearn.com/cXUglmPMIjm2/?ref=app

Answer 4

Here's my try :)
https://code.sololearn.com/c4HNIz172oQY/?ref=app

Answer 5

https://code.sololearn.com/cbd7t8ao2LFV/?ref=app

Answer 6

First:

https://code.sololearn.com/Wyd1oYvgi69D/?ref=app

Answer 7

Third:

https://code.sololearn.com/cqbzBPlzfdrE/?ref=app

Answer 8

Hello ! I wrote my code in Python and I think it's pretty fast. Here is my code :
https://code.sololearn.com/csMaTsZr6TSc/#py

Answer 9

nice code, Antoine!

Answer 10

My try:
https://code.sololearn.com/cldvefr1yiN6/?ref=app

Answer 11

Hello, I think I've got the purest algorithm :)

https://code.sololearn.com/W23pKl8Ih2Vb/#html

You can enter limit of a 2.5 billion with a waiting time of 20 seconds.

Answer 12

whoa, nice code!

Answer 13

https://code.sololearn.com/cGpAh9M3TSa1/#
Check out my version:)

Answer 14

Hi.Who know how save a commant in a web site with tags "input"?of curse with PHP or other languages.