Tks, very rivetting.

1/2″ ]]>

Tks, very rivetting.

1/2″ ]]>

Someone here asked if finding new Mersenne primes is useful.

Few is known about how Mersenne primes are distributed. Finding new ones helps to check if the theory matches the reality.

Also, the GIMPS project not only searches new Mersenne primes ; it also searches factors of Mersenne composites. One can either find small factors of big near-10 millions digits Mersenne composites, or one can search for big factors of small Mersenne composites, like 2^1061-1. One can even use prime95 to search for a factor of F14=2^2^14+1, the first Fermat number no factor is known.

People also hope to become famous, one of the few ones who have found such a huge prime number.

Big Mersenne primes can be used to generate random numbers. I’m not sure 9Millions digit Mersenne primes can be used … See: http://www-personal.engin.umich.edu/~wagnerr/MersenneTwister.html

Tony ]]>

–David

(what’s YOUR Erdos#?)

]]>Of course, the binary representation is a bit, well, boring…

Decimalist! Anti-binaryte!

/noise

]]>jkohen,

“I just cancelled the evaluation of that expression after 150 minutes.”

What did you do to evaluate it? 2**x = 1<<x, where << is the shift left operation. Thus you need only 1 bigint shift left and one bigint subtraction to get the binary representation of the number. Of course, the binary representation is a bit, well, boring… The conversion to decimal ascii could take a while, depending on the algorithm. ðŸ˜‰

]]>That was kind of my point.

]]>