Andere Computerprojekte
September 2006: Eine neue Mersenne'sche Primzahl gefunden!!!

This domain was created as a home for the Great Internet Mersenne Prime Search (GIMPS). Mersenne primes are named after the French monk Marin Mersenne. In his day, Marin Mersenne acted as great facilitator among the mathematicians and scientists of his day. In his honor, I have collected links to other distributed math and science projects that you can participate in. You do not need to be a math or science whiz to join in the fun.

Links about distributed computing

• This German web site has many pointers to distributed computing projects.
• Kirk Pearson maintains a very comprehensive web site on distributed computing.
• jc-news describes distributed computing and reviews several projects.
• Bottomquark also reviews several distributed computing projects.

Links to several distributed computing projects

• Entropia.com is running several projects in medical, environmental, economics, and scientific research. These are the same folks who provided the networking for the GIMPS project.



• The Great Internet Mersenne Prime Search. Help find a new Mersenne prime number. Put your name in mathematics history books forever! We've found four, but there are many more waiting to be discovered.



• Mersenne Primes are hard to find, maybe you'd rather have a better chance of success by searching for smaller Proth primes. Yves Gallot has written a Windows 95 program that makes this easy! This program can also be used to find world-record twin primes and Sophie-Germain primes, Cunningham chains, reserach into the Sierpinski problem, find Keller primes, and more!



• Proving Catalan's conjecture is now within reach! Read all about it and join a project to finish the proof.



• Nuutti Kuosa is conducting a search for the next prime of the form N!+1.



• Help find factors of the "most wanted" composite numbers. Paul Zimmermann has founded ECMNet. Conrad Curry has reincarnated NFSNet (number field sieve). NFS can factor numbers that ECM can't crack.



• GIMPS is also helping mathematicians factor composite numbers. Specifically, those of the form 2^N-1 and 2^N+1.



• Help find new factors of Fermat numbers. Small cash prizes are available.



• A project to find new factors of very large Fermat numbers has begun.



• Tony Forbes is coordinating a search for a factor of MM61 (2^(2^61-1)-1). This is the smallest Mersenne number with a Mersenne prime exponent whose primality status is unknown.



• Richard Brent has a new method for generating highly random numbers using Mersenne primes. However, first you need to find a primitive trinomial. You can help in his search for primitive trinomials.



• A new project to compute pi(x), the number of primes below x, for large values of x is now underway.



• United Devices has started a project in cancer research as well as genetic research.



• Help in cancer research, and maybe win a little cash.



• A project to unravel the secrets of protein folding. This could lead to important medical advances.



• Here is an interesting project to study distributed evolutionary computation. A free screensaver lets you join this AI experiment.



• Help scientists predict the climate of the 21st century! Visit the Climate Dynamics home page to learn more. The project is currently in the planning stages.



• Find extraterrestrial intelligence! Visit Seti@Home web page to learn more.



• This astronomy project is a little different. Instead of putting your computer to work, you put yourself to work. Visit NASA's clickworkers study to volunteer.



• A Norwegian research project looking for K-optimal lattice rules has begun. Linux, IRIX, and SunOS clients are available with more on the way.



• Brian Wong wants to start a project working on Mueller modular polynomials. These polynomials are critical for efficiently counting the number of points on an eliptic curve defined modulo a prime number via the Schoof-Elkies-Atkins algorithm. Send Brian an email if you can help.



• Here is a Java application to research gamma ray flux calculation could use your help. Dcypher.net is also working on this problem - which could be useful in finding safer ways to store nuclear waste.



• A project to find equal sums of like powers is well under way.



• A new math project investigating a conjecture about convergent series, the so-called 3x + 1 problem is under way.



• The newest encryption cracking project is tackling Certicom's ECCp-109 challenge. There is a cash prize.



• Distributed.net has always been in the forefront of encryption cracking projects. Currently they are working on RC5-64 which has a cash prize. They are also running a project finding optimal Golumb rulers.



• Jason Moxham has been searching for multi-perfect numbers for years. He has made his program available for others to help in the search.



• Martin Gardner posed the problem of the best way to arrange circles within a square. The solution is not easy. This web site has a program to find solutions to this and similar problems.

Completed distributed computing projects

• See how these people found a world record 10 consecutive primes in arithmetic progression. Maybe they will start a new project.



• See how Colin Percival used distributed computing to calculate one quadrillion bits of Pi.



• A research project studying twin primes and Brun's constant has completed.



• Elliptic curve encryption schemes have been cracked by distributed computing. The ECC2-97 and ECCp-97 groups cracked the last two elliptic curve challenges, perhaps a new challenge will begin soon.

Diese Seite wurde das letzte Mal am 25. July 2001 geändert (Originalseite am 11. Juni 2000).