101. Great Internet Mersenne Prime Search(GIMPS) EBoard Viewing Topic Great Internet mersenne prime Search(GIMPS). Death Member, GreatInternet mersenne prime Search(GIMPS) posted Oct 30, 2003 1711, http://www.distributed.org.ru/forum/?a=topic&topic=204

102. The Great Internet Mersenne Prime Search Return to the home page for Patrick Kellogg. The Great Internet mersenne primeSearch. Why would anyone want to try to find the next mersenne prime? http://www.patrickkellogg.com/school/papers/gimps.htm

Return to the home page for Patrick Kellogg The Great Internet Mersenne Prime Search The “Great Internet Mersenne Prime Search” is a large distributed computing project sponsored by the Mersenne organization at: http://www.mersenne.org/prime.htm . It was started by George Woltman in 1994 to find Mersenne primes, and in the last six years the group has found the four largest ones currently known. In addition to GIMPS, they also sponsor several other distribute mathematical projects at (http://www.mersenne.org/). Why would anyone want to try to find the next Mersenne prime? Well, besides the altruistic idea of contributing to scientific knowledge, the Electronic Frontier Foundation ( www.eff.org ) is offering a $100,000 reward to the first person that helps to discover a ten million digit (or higher) prime number. There are some caveats $25,000 goes to charity and $20,000 to GIMPS, but it still leaves $55,000 for the lucky computer user. And the 1 in 250,000 odds are better than most state lotteries. Installation of the GIMPS software is easy. Different versions are available for Microsoft Windows 95/98 and NT/2000 (as well as the earlier 3.1), Linux, FreeBSD, OS/2 and DOS. Also, optimized code is available for different platforms, including PowerPC, StrongARM, UNIX, and older x86 machines. Though the software does not support multiple processors or multiple machines working on the same problem, they have a very robust server at “PrimeNet” (

103. Zeal.com - Site Profile For Great Internet Mersenne Prime Search Great Internet mersenne prime Search Profile, Edit value 75. Status, URL,http//www.mersenne.org/prime.htm. Title, Great Internet mersenne prime Search. http://zeal.com/website/profile.jhtml?cid=1164190&wid=60470716

104. Prime Numbers Directory A directory for prime numbers including primality tests, lists of prime numbers, factoring, mersenne numbers and goldbach conjecture http://cochise.mta.ac.il:8080/~liorb/servlet/Categories

Prime Numbers Directory The best source for prime numbers!!! The biggest prime number ever found: 2^13466917-1 1 people have been visit this site Primes List - links for primes list sites Primality Tests - links for primality tests sites Mersenne - links for mersenne sites Goldbach Conjecture - links for goldbach conjecture sites Factoring - links for factoring sites How to add new sites Comments Powered by ObjectDB Java/JDO Database

105. :: G I M P S . I T :: Homepage Del Team_Italia Questa pagina illustra parte della matematica e degli algoritmi utilizzati per una ricerca dei numeri primi di mersenne. http://www.moreware.org/mersenne/prime-it.htm

Benvenuti sul sito GIMPS.IT Ricerca dei numeri primi di Mersenne Operation: Billion Digits! Dove si parla del Team_Italia Amici del Team_Italia by Ultimo aggiornamento : 03 Giugno 2004 Page hits stats Mag '04 Apr '04 Mar '04 Feb '04 Gen '04 Dic '03 Nov '03 Ott '03 Set '03 Ago '03 Lug '03 Giu '03 Mag '03 Apr '03 Updates 03 giu 2004 - Upd. Parlano di noi - Upd. Billion Project 29 mag 2004 Verificato 41mo Primo di Mersenne! 41mo primo di Mersenne: Comunicato stampa 07 apr 2004 - Upd. Mersenne home - Upd. Free software 04 apr 2004 - Upd. "Richiesta esponenti" 31 mar 2004 - New ecm.htm - Upd. Other projects

106. :: G I M P S . I T :: Homepage Del Team_Italia Translate this page Search status. 16 mag 2004. Annunciato 41mo Primo di mersenne! 16 apr 2004. -Upd. 07 apr 2004. - Upd. mersenne home - Upd. Free software. 04 apr 2004. - Upd. http://www.mclink.it/personal/MC5225/mersenne/prime-it.htm

Benvenuti sul sito GIMPS.IT Ricerca dei numeri primi di Mersenne Operation: Billion Digits! Dove si parla del Team_Italia Amici del Team_Italia by Ultimo aggiornamento : 03 Giugno 2004 Page hits stats Mag '04 Apr '04 Mar '04 Feb '04 Gen '04 Dic '03 Nov '03 Ott '03 Set '03 Ago '03 Lug '03 Giu '03 Mag '03 Apr '03 Updates 03 giu 2004 - Upd. Parlano di noi - Upd. Billion Project 29 mag 2004 Verificato 41mo Primo di Mersenne! 41mo primo di Mersenne: Comunicato stampa 07 apr 2004 - Upd. Mersenne home - Upd. Free software 04 apr 2004 - Upd. "Richiesta esponenti" 31 mar 2004 - New ecm.htm - Upd. Other projects

107. Mersenne Priemgetal Speurtocht Deze pagina is gebaseerd op George Woltman s GIMPS pagina. De Grote Internetmersenne Priemgetal Speurtocht. 40e bekende mersenne priemgetal gevonden! http://www.dse.nl/~m31/mersenne/prime.htm

-Alle hyperlinks op deze pagina verwijzen naar Engelstalige pagina's, tenzij anders aangegeven.- Deze pagina is gebaseerd op George Woltman's GIMPS pagina De Grote Internet Mersenne Priemgetal Speurtocht Pagina's beschikbaar in het Chinees Deens Duits Italiaans ... Pools en Spaans . Waarschuwing: deze vertalingen zijn niet altijd recent - gebruik AltaVista indien nodig. Schrijf Geschiedenis In De Wiskunde! Jij kunt een van de meest begeerde ontdekkingen in de wiskunde doen - een nieuw Mersenne priemgetal. We hebben er al zes gevonden. Doe mee met dit leuke maar toch ook serieuze onderzoeksproject. Het enige dat je nodig hebt is een personal computer (Pentium-I of hoger) die een groot deel van de tijd aanstaat, geduld en heel wat geluk. Het doen van een wiskundige ontdekking geeft niet alleen de nodige vreugde, je wint er misschien ook geld mee. De Electronic Frontier Foundation biedt een prijs van US$ 100.000,- aan de eerste persoon of groep die een priemgetal vindt van tenminste tien miljoen cijfers! Lees hoe GIMPS dit geld zal verdelen (nederlandstalig) indien wij het geluk hebben een priemgetal van minstens tien miljoen cijfers vinden.

108. The Largest Known Primes The largest known primes This World Wide Web (WWW) site discusses the definition of prime numbers; presents the ten largest primes in terms of powers, factorials, and/or products for five http://rdre1.inktomi.com/click?u=http://www.utm.edu/research/primes/largest.html

109. Henri LIFCHITZ's Mersenne And Fermat Primes Field Henri Lifchitz's single general form contains the main remarkable numbers of number theory. http://ourworld.compuserve.com/homepages/hlifchitz/Henri/us/MersFermus.htm

Mersenne and Fermat primes field Let NMF(b,p,n)= (b^ (p^(n+1)) -1)/(b^ (p^n) These numbers contain under the single general form the main remarkable numbers of number theory.Indeed, we obtains : - for b=2 and n=0 those are Mersenne's numbers - for b=+/-2 et p=2 those are Fermat's numbers - for b even and p=2 those are Generalized Fermat repunits base b. These numbers can be considered as Generalized Mersenne , they can be prime only if p is prime. rep.base-1 . These numbers can also be considered as Generalized Mersenne , with the same property for p. - for p=3 we obtain numbers of the form (b 3^n -1)b 3^n which we can name Generalized Mersenne-Fermat in particular for the combined form of their divisors n+1 A general form of the divisors of these numbers will be noted of more : n+1 . We find again 2kp+1 for Mersenne's numbers and k2 n+2 +1 for Fermat's numbers. For n=1 and p=m not necessarily prime we find also (b m +/-1)b m (see New forms of primes ), but the form of the divisors is more complex generally. The table below summarizes the organization and the specificities of these numbers : Divisors Generalized M ersenne (rep. base-1)

110. Generalized Fermat Primes Search composite character of some Fermat numbers. But the Fermat and Mersenneprimes are rare and the chance to find a new prime is small. http://perso.wanadoo.fr/yves.gallot/primes/

Home News How ? Download ... Feedback Welcome to the Generalized Fermat Prime Search! During the 17 th century, Pierre de Fermat and Marin Mersenne studied two particular forms of numbers, thinking that they could produce a large amount of prime numbers or even to be ever prime. Mersenne communicated a list of the primes of the form 2 n -1, for all n n is a power of 2, then 2 n +1 is a prime. Fermat knew that 3, 5, 17, 257 and 65537 are primes but later Euler showed that Fermat's conjecture is false by discovering a factor to the next number. In honour of the inspired pioneers, the numbers of the form 2 n -1 are now called the Mersenne numbers and the numbers of the form 2 n +1 the Fermat numbers. The search for Mersenne and Fermat primes has been greatly extended since the 17 th century. Today, all the Mersenne primes having less than 2,000,000 digits are known and all the Fermat primes up to 2,000,000,000 digits! It was possible because during the 19 th century some efficient tests were discovered to check the primality of these numbers. But at the same time, some tests as fast were also found to test check the primality of all the numbers

Page 6     101-110 of 110    Back | 1  | 2  | 3  | 4  | 5  | 6