[seqfan] Re: [math-fun] Triangular+Triangular = Factorial
Charles Greathouse
charles.greathouse at case.edu
Fri Oct 1 15:40:18 CEST 2010
GNFS will be faster than the quadratic sieve at that size. The
cutoff, depending on implementation, is 90 to 110 digits.
I'm not sure what the runtime would be, but probably on the order of a
week with GGNFS. If you run it for an hour (or even a minute) you can
get a good estimate of the total runtime by looking at the number of
full relations -- you'll need, say, target # of relations / 3 full
relations (or / 4), with the balance coming from combined partial
relations.
Charles Greathouse
Analyst/Programmer
Case Western Reserve University
On Thu, Sep 30, 2010 at 4:51 PM, Georgi Guninski <guninski at guninski.com> wrote:
> the first undecided term is 93 and settling it will give the sequence to 106.
>
> i think i ran enough curves on 93.
>
> the cofactor is 129 digits (427 bits)
>
> for factoring:
> 1. quadratic sieve or gnfs ?
> 2. which implementation (msieve?) ?
> 3. what is the expected time for factoring ?
>
>
> _______________________________________________
>
> Seqfan Mailing list - http://list.seqfan.eu/
>
More information about the SeqFan
mailing list