Author: Dann Corbit
Date: 17:00:29 05/26/05
Go up one level in this thread
On May 26, 2005 at 19:59:38, Dann Corbit wrote: >On May 26, 2005 at 19:43:07, Uri Blass wrote: > >>On May 26, 2005 at 15:54:18, Dann Corbit wrote: >> >>>On May 26, 2005 at 15:52:19, Dann Corbit wrote: >>> >>>>On May 26, 2005 at 14:18:37, Sune Fischer wrote: >>>> >>>>>On May 26, 2005 at 13:15:04, Dann Corbit wrote: >>>>> >>>>>>On May 26, 2005 at 12:02:37, Vincent Diepeveen wrote: >>>>>>[snip] >>>>>>>Hello, i can calculate prime numbers up to 10 million digits at my pc nearly, >>>>>>>though not within 5 minutes. >>>>>> >>>>>>Less than a second, I imagine. >>>>> >>>>>That's quite an imagination since there aren't any known primes that large :) >>> >>>I misread the statement as "finding the first ten million primes" >>> >>>>>Last I checked only a handful or so had been found with more than a million >>>>>digits, and of course only through weeks of massively parallel super computer >>>>>power. >>>> >>>>From: >>>>http://www.mersenne.org/prime.htm >>>> >>>>The record is: >>>>7,816,230 digits >>> >>>There is $100,000 for finding a ten million digit prime. >> >>Is finding the number enough or is the prize only for people who also prove that >>the number they picked is a prime. >> >>Suppose one person find a number of 10,000,000 digits and claims that the number >>is prime with no proof and somebody else proves that the number is a prime >>number. >> >>who get the prize? > >The circumstances are very carefully controlled. >You have to PROVE that it is prime. >Most prime proving algorithms have a certificate that proves authenticity. > >Also, you don't get to keep the whole 100K if you join the Mersenne project, it >gets divided up. > >For example, here is a UBASIC proof of a prime number using APR-CL > >Words for long variables 542 (Words for internal calculation 542) >Free text area = 39695 bytes >OK >load "APRT-CLE.UB" >OK >run >Test number N=? 5852437679368359578121763722115591 > >Preparatory test > Pass ! > >Main test for P= 2 > for Q= 3 for Q= 5 for Q= 7 for Q= 13 for Q= 11 for Q= 31 fo >r Q= 61 for Q= 19 for Q= 37 for Q= 181 for Q= 29 > >Main test for P= 3 > for Q= 7 for Q= 13 for Q= 31 for Q= 61 for Q= 19 for Q= 37 >for Q= 181 > >Main test for P= 5 > for Q= 11 for Q= 31 for Q= 61 for Q= 181 > >Main test for P= 7 > for Q= 29 Pass ! > > 5852437679368359578121763722115591 is prime. > 0:00:00 >OK I should mention that they also verify independently twice that the number is prime.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.