Re: ellap hangs on a large-ish prime

[Andreas Enge <andreas.enge@math.u-bordeaux.fr>]

On Tue, Feb 02, 2010 at 01:05:06PM +0100, Bill Allombert wrote:
> Precisely: Version 2.4.3 include an implementation of SEA which run
> polynomial time, however for a small prime like 2486152157 it still
> use the older algorithm, so this is unrelated.

In any case, the problem seems to be solved in the current svn.
The original poster's gp script

E = ellinit([0,0,1,-1,0]);
P = 2486152157;
ellap(E, P)

returns -13740 in no time.

Andreas