Bill Allombert on Mon, 06 Feb 2012 22:29:09 +0100

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

pari-2.5.1 (STABLE) released

Dear PARI lovers,

I would like to announce the release of pari-2.5.1 (STABLE). The sources
and a basic Windows binary are available from

This is a BUGFIX release for the stable branch, fixing all significant 
problems that could be fixed in a simple, harmless way. However
we strongly encourage you to upgrade since it fixes a number of cases
where PARI was returning an incorrect result.

Thanks to all those who reported problems, on the mailing lists or through
our Bug Tracking System. ( See )

Have fun,

  Bill and Karim

P.S: The Changelog:

Bug numbers refer to the BTS at
[last column crossreferences current development release 2.6.0]

Done for version 2.5.1 (released 06/02/2012):

    1- Euclidean chains were confused by t_POLs with t_INTMOD coeffs       [F01]
       [ because a 0 polynomial could have lg() == 3 ]
    2- remi2n didn't allow negative arguments [native kernel] [#1215]      [F04]
    3- qfbred(t_QFR) wrong when frac( sqrt(D) ) > 0.5                      [F06]
    4- problems with diagnostic messages when changing a 'default', e.g \o3[F08]
    5- divru() could call bfffo(0) => overflow in expo()                   [F09]
AMe 6- (t_FRAC<0) * t_INTMOD => wrong result                               [F10]
    7- trace(t_POL or t_SER) could yield unormalized object [0 lead. term] [F11]
LGr 8- off-by-1 error in primepi() when argument is = primelimit           [F12]
    9- crash when default(prettyprinter,...) points to non-existent cmd    [F15]
   10- qfperfection(): wrong result in unlucky cases [#1223]               [F16]
BA 11- allocatemem() did not reset parse error [#1226]                     [F17]
BA 12- (x->vector(1,j,x))(1) --> significant pointers lost [#1211]         [F18]
VL 13- [makefile] Incorrect -I and -L flags order [#1212]                  [F19]
   14- nfbasis / nfdisc(f,, partial factorization) would sometimes spend a [F20]
       lot of time trying to factorize a discriminant [#1227]
BA 15- missing consistency checks in conjvec [#1231]                       [F22]
   16- wrong result in bezoutres [#1233]                                   [F24]
   17- wrong sign in polresultant() [#1234]                                [F25]
   18- subst(Y/X,X,x) -> 0                                                 [F27]
PB 19- polrootsff(x^2-x-ffgen((v^2+1) * Mod(1,3))) -> SEGV [#1241]         [F28]
BA 20- functions ending by the x[y]=z construct could corrupt the stack.   [F30]
BA 21- test-kernel and test-ploth did not work                             [F35]
BA 22- for(i=1,10^7,) + SIGINT -> SEGV [#1249]                             [F37]
BA 23- mateigen precision error was not trappable.                         [F40]
   24- broken rnfeltup [#1256]                                             [F42]
   25- x===y was always wrong for x,y t_SER                                [F43]
   26- ispower(x < 0) could return an even value ! [#1259]                 [F45]
   27- ispower(1 / n) return a wrong result [#1259]                        [F46]
BA 28- [breakloop] initial context could be lost.                          [F47]
BA 29- Ser([1+O(x)],x) returned an invalid object.                         [F48]
BA 30- ispseudoprime used too much stack for huge operands.                [F49]
   31- [rnfidealup doc] idealgentoHNF() was incorrect.                     [F50]
DS 32- elldivpol returned wrong result for degree n >=8.                   [F51]
   33- overflow in mpbern(n) for huge n [#1256]                            [F52]
   34- psdraw() ignored plot colors                                        [F55]
BA 35- stack_base() was not C89 standard compliant.                        [F56]
BA 36- my(f(x)=x+1);f --> SEGV [#1273]                                     [F57]
   37- ellheight([0, 0, 1, -1, 0], [0., 0.]) -> BUG                        [F58]

BA  1- [darwin] do not use dylib_ prefix to ld options [#1210]             [C12]
    2- delete README-subversion, replace with README-git                   [C22]
    3- much faster final divisibility test in nfgcd() [#1214]              [C25]

BA  1- [INSTALL] Documentation of RUNTEST
BA  2- [Configure] support for multiarch systems