Tag Archives: primes

Race for the primes

මට හිතෙන හැටියට modern technology is all about utilizing every bit of power to go for something better and it is sometimes disturbing to think about unused processor power of millions of computers, running all over the world at a given moment.

How about using the processor of our PC to find the biggest Mersenne prime and win some cash? Recently i got to find about the GIMPS project which, enables the users to run a small software in the background, while the PC is switched on, and it is calculating all the time for a Mersenne prime number.

By the way..what is a Mersenne prime?..and in Wikipedia..

a Mersenne number

is a positive integer that is one less than a power of two:


Some definitions of Mersenne numbers require that the expon

ent n be prime.

A Mersenne prime is a Mersenne number that is prime.

Recently, On August 23rd, a UCLA computer discovered the 45th known Mersenne prime, 243,112,609-1, a mammoth 12,978,189 digit number!

And, On September 6th, the 46th known Mersenne prime, 237,156,667-1, a 11,185,272 digit number was found by Hans-Michael Elvenich in Langenfeld near Cologne, Germany!

Although I’m yet to find the 47th one I can say that The Great Internet Mersenne Prime Search is a nice thing to try since it does not interfere with your system’s performance or network traffic.

But…the site gives the WARNING: Running the program continuously will use about 40 watts of additional power – your electric bill will go up.