[Top][All Lists]
[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]
Re: Faster algorithm for factor?
From: |
Bruno Haible |
Subject: |
Re: Faster algorithm for factor? |
Date: |
Fri, 9 Jan 2004 16:31:50 +0100 |
User-agent: |
KMail/1.5 |
Jim Meyering wrote:
> > http://www.loria.fr/~zimmerma/records/ecmnet.html
> > http://www.loria.fr/~zimmerma/records/ecm-5.0.3.html
>
> I like that idea. Thanks!
> I've always wanted factor to accept arbitrarily large inputs.
Although you can input an arbitrarily large integer, the limit of what
the program can do in reasonable time is about 100 decimal digits for a
randomly chosen integer.
> Patches welcome :-)
Well, the program has more than 10 source files and probably requires some
number theory know-how. I know that Paul Zimmermann is open to collaboration
with the GNU project (he's a contributor of GNU gmp, after all). It's up to
you to work it out with him.
Bruno
- Re: Faster algorithm for factor?, (continued)
- Re: Faster algorithm for factor?, Jim Meyering, 2004/01/04
- Re: Faster algorithm for factor?, Trevor Wilson, 2004/01/05
- Re: Faster algorithm for factor?, Jim Meyering, 2004/01/05
- Re: Faster algorithm for factor?, Trevor Wilson, 2004/01/05
- Re: Faster algorithm for factor?, Jim Meyering, 2004/01/05
- Re: Faster algorithm for factor?, Trevor Wilson, 2004/01/05
- Re: Faster algorithm for factor?, Trevor Wilson, 2004/01/05
Re: Faster algorithm for factor?, Trevor Wilson, 2004/01/05
Re: Faster algorithm for factor?, Bruno Haible, 2004/01/07
Re: faster algorithm for factor?, Paul Eggert, 2004/01/07