Re: Ruler, compass and prime power
- --- In email@example.com, "mikeoakes2" <mikeoakes2@...> wrote:
>Dear faithful pari-GP got there in the end:-
> --- In firstname.lastname@example.org, "djbroadhurst" <d.broadhurst@> wrote:
> > > After about 5 hours pari-GP has told me this:-
> > > *** factor: Warning: MPQS: factoring this number will take several hours
> > In this case msieve fits the bill:
> > $ tail -3 msieve.out
> > Tue Nov 1 10:28:27 2011 prp44 factor: 44643300072722108400698902752086877193190113
> > Tue Nov 1 10:28:27 2011 prp45 factor: 728945576086893794974061219407402693792528577
> > Tue Nov 1 10:28:27 2011 elapsed time 00:43:03
> It would be interesting to know what program(s) can improve on David's 43 mins.
[44643300072722108400698902752086877193190113, 1; 728945576086893794974061219407402693792528577, 1]
8.0 hours, on a 1.8 GHz core. (I expect David's cpu was faster.)
- --- In email@example.com, David Cleaver <wraithx@...> wrote:
>I saw that, thanks David!
> Ben, I've been trying to tell them how awesome Yafu is! You can see my message
> If anyone needs any factoring utilities, yafu should be first on the list. Then
> some combination of yafu/msieve/ggnfs to factor larger numbers. I tried to
> spell it all out in the above post. Hopefully I didn't misrepresent any info
> about yafu. Please correct me if I was wrong. If anyone has any questions,
> feel free to ask on this list.
> -David C.
> P.S. For full disclosure, I helped contribute a small amount of code to yafu. :)
Since this is a list dedicated to primes, I'll also just mention briefly that yafu has one of the fastest sieve of Eratosthenes implementations I'm aware of, for generating lists of primes in arbitrary ranges up to 10^19. Maybe that is useful to folks here too.