Karim BELABAS on Thu, 20 Nov 2003 11:02:38 +0100


[Date Prev] [Date Next] [Thread Prev] [Thread Next] [Date Index] [Thread Index]

Re: factorint() bug 

On Tue, 18 Nov 2003, Igor Schein wrote:
> I get amused every time I found a problem with factoring mechanism,
> because I've always felt it's rock-solid.  But anyway:
>
> ? {
> factorint(
> 3280696195200006885547973357173182411881462602934802054749349683516314460050
> 2548596646024265171468102088952756084355402608216473040677346490348936595334
> 0299389230010814564530645152250241760175805765084544728012391149823776145022
> 4913178048870032606672750626773595019035786804361581343222144074318522768947
> 2061349830773562073895748494534362180537529975336881525935996152181576667869
> 0625865166662910961888106910345518707973056625912728422391238723575276042635
> 9727112469435556047168454738353621102783718736137552743946577993495054202848
> 9372915917197045423574773583244796785665263319216397122018435444897
> ,11)
> }
>   ***   impossible assignment I-->S

Stack corruption, fixed in CVS.

Previous incremental allocation made many complicated assumptions, which
eventually were not satisfied in your example. I simply allocate enough from
the start [ decent amount, about 7 * log_{2^32}(n) words in order to factor n ].

Thanks for spotting this !!!

    Karim.
-- 
Karim Belabas                     Tel: (+33) (0)1 69 15 57 48
Dép. de Mathématiques, Bât. 425   Fax: (+33) (0)1 69 15 60 19
Université Paris-Sud              http://www.math.u-psud.fr/~belabas/
F-91405 Orsay (France)            http://pari.math.u-bordeaux.fr/  [PARI/GP]