![]() |
![]() |
#1 |
"Mark"
Apr 2003
Between here and the
3×23×101 Posts |
![]()
For those of you with access a PowerPC, I want to direct you to Phil Carmody's PIES project (the pies_project group in Yahoo).
Over the weekend, I found this 100070 digit prime: Phi(3,-1642659500503^4096) On my 2.5 GHz G5, the PRP test took only 4 minutes. According to Phil, a 2.0 GHz P4 does this same test in about 10 minutes which means that the PowerPC is very competitive with x86 for numbers of this form. AFAIK, it is the only prime on Chris Caldwell's list that has been found with a PowerPC CPU. --Mark |
![]() |
![]() |
![]() |
#2 | |
Feb 2003
111100000002 Posts |
![]() Quote:
-- Thomas |
|
![]() |
![]() |
![]() |
#3 | |
"Mark"
Apr 2003
Between here and the
3×23×101 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
#4 | |
Feb 2003
78016 Posts |
![]() Quote:
There is also the 87419 digit prime Phi(3,-216582^8192), which was found on a 250MHz R10000 CPU (SGI). And a few more... -- Thomas |
|
![]() |
![]() |
![]() |
#5 | |
"Mark"
Apr 2003
Between here and the
3·23·101 Posts |
![]() Quote:
|
|
![]() |
![]() |
![]() |
Thread Tools | |
![]() |
||||
Thread | Thread Starter | Forum | Replies | Last Post |
Finding VERY large primes | c10ck3r | Information & Answers | 34 | 2012-08-29 16:47 |
Why arent there many softwares for finding Huge Primes | blistervol | Math | 2 | 2012-08-20 17:26 |
Best Work for Finding Primes | Unregistered | Information & Answers | 9 | 2012-06-24 13:50 |
Finding primes using modular stacking | goatboy | Math | 1 | 2007-12-07 12:30 |
Finding primes from 1 upwards | henryzz | Lounge | 35 | 2007-10-20 03:06 |