Hi, thanks to Jens for completing the BLS test and checking for twin and SGs , and to David for doing the KP proof. Congratulations to Jason for discovering it...
... mustard ... I posted a mail to the group when the top5000 reached 50000 digits: http://groups.yahoo.com/group/primeform/message/4462 That was 13 months...
... Can you make a habit of this please? ... Assuming that all primes have grown proportionally, which probably isn't true, but is the only approximation I can...
Hi, I am wondering how much effort is going into finding a top twin prime to beat Daniel Papp's: http://primes.utm.edu/primes/page.php?id=883 . Is David...
... Phil should still be preparing a search for a 100k prime on form x^2+x+41. ... The record is 51090 digits. I made some quick estimates for a record near ...
From: "Jens Kruse Andersen" <jens.k.a@...> ... I kinda gave up on that after DB barged in. Duplication of effort is waste, so I stopped. There was no...
Hello Group! Sometimes one needs a little bit of luck, sometimes one even needs a lot of luck! ;-) While searching for a Cunningham Chain of length 8 by ...
... Big congratulations! This is a _very_ impressive record. http://hjem.get2net.dk/jka/math/simultprime.htm is updated. The page counts the middle prime in a...
The 10M-bit prime is a fake: 30077*2^10000000-1 is not prime. Res64: 272D38403C586A99 Time : 1036172.419 sec. http://primes.utm.edu/primes/page.php?id=75183 ...
... I had some false positives which were due to a flakey 7 year old operating system. When I double checked the error was revealed. I am now retesting the...
... Indeed! And I am wide open to suggestions. I lowered the allowable number of digits (if you submit very large numbers the page rejects them and says to...
Chris, I believe that these should be expunged: http://primes.utm.edu/bios/page.php?id=784 ... http://primes.utm.edu/bios/code.php?code=g394 ... David...
... Carey Bloodworth, one of the pioneer implementors of Pi-calculating programs for the PC, had no end of unkind words for Windows 9x. One of his chief...
Thomas Wolter recently returned home and checked his pc. A picture prp was found July 27, the day after the first prp by Jason Earls. Thanks to David for again...
... primes. ... You should just run a (default base-3) PRP test when looking for primes. This is due to Fermat's "little" Theorem. The test is much quicker...
... I tried running PRP tests before, and it seemed to run about the same speed as the BLS test, so I opted to go straight to the proof. With the current...
... 30 minutes for a 100000-digit GFN is well over the odds. On a 2.5GHz G5, my OversEis performs a SPRP test in 3m45s. On a 1.6GHz Centrino, the same test...
... k^16384+1 with 4500000<=k<12500000 (chosen to produce 100K+ digit , or top-1000 primes). I'm running two copies of pfgw_version_12_linux on a dual 3 GHz...
... Have you benchmarked how long it takes to run PFGW on a single processor of your dual Xeon? I believe you may be bottlenecked by memory, and as such,...
I need to write a c/c++ program to find a 512 bit prime number P which meets the following creteria: P is chosen randomnly P-1 has a large prime factor the...
under the command window, c:pfgw\ pfgw -f -t -q3^231+1 gives me primality testing 3231+1 what's wrong ? the program doesn't recognize ^ . what should i do...
... Under any "flavor" of windows NT (NT/XP/2k/2k3...) the cmd.exe uses the ^ char as "something". To work around this, do: pfgw -f -t -q"3^231+1" or pfgw -f...
... As David's answer will be unhelpful to you, I'm going to relunctantly provide an alternate answer (`reluctantly' because this is not the place to post...
Having problems with message search?
Fill out this form to ensure your group is one of the first to be migrated to the new message search system.
