pari-2.11.2(STABLE) released

[Bill Allombert <Bill.Allombert@math.u-bordeaux.fr>]

Dear PARI lovers,

I would like to announce the release of pari-2.11.2 (STABLE). The sources
and Windows and MacOS binaries are available from

  http://pari.math.u-bordeaux.fr/download.html

This is a BUGFIX release for the stable branch. 
This release addresses 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.
In particular, this release fix some intance of memory corruption.

  --------------------------

Thanks to all those who reported problems, on the mailing lists or through
our Bug Tracking System. ( See http://pari.math.u-bordeaux.fr/Bugs/ ), or
who tested the preleases.

Have fun,

  Bill and Karim

P.S: The Changelog:

Bug numbers refer to the BTS at http://pari.math.u-bordeaux.fr/Bugs/

Done for version 2.11.2 (released 12/05/2019):
  Fixed
      1- make ellheight(E, torsion point) return an exact 0 [#2109]       [F45]
BA    2- hyperellcharpoly: wrong results over Z/3Z                        [F46]
      3- gmp kernel: off-by-1 error in red_mongomery [read uninitialized  [F47]
         memory, then ignores result]
      4- intnuminit([-1,-1/2],[1,-1/2]) twice slower than it should       [F48]
      5- forcomposite(n=2,4,print(n)) -> empty [#2096]                    [F49]
FB    6- [Configure] library not found despite --with-readline-lib [#2097][F53]
      7- minpoly(Mod(1,t^2)) -> SEGV [#2102]                              [F55]
      8- a=ffgen(3^2,'a);poldisc(x^6+a*x+y) -> division by 0 [ positive   [F56]
         characteristic with a few t_INT coefficients ]
BA    9- [pthread] parapply could crash                                   [F58]
BA   10- ffinvmap(m) could SEGV on bad input                              [F59]
     11- ellisdivisible(E/K number field in 'x) -> incorrect priority     [F60]
     12- idealispower(nf, t_INT n) possibly wrong if (n, nf.disc) > 1     [F61]
     13- zeta''(0): all precision lost [more generally f'...'(n quotes)
        imprecise in the neighbourhood of 0, while derivnum(,n) was OK]   [F62]
     14- sumdigits(negative number, B) sometimes negative                 [F63]
     15- poldiscfactors(x^0) -> division by 0                             [F64]
     16- factormod(x^3+1,[y^2+1,2]) -> SEGV                               [F65]
     17- factormod(x^3+1,[y^2+1,5]) -> weird error message                [F66]
BA   18- fix inefficiency in fplll not present in original code           [F69]
     19- polrootsreal(x^4+2*x^3+x^2/3+x/100-1/2000,[1/100,oo]): no root   [F70]
     20- polrootsreal(x^4+2*x^3+x^2/3+x/100-1/1000,[1/10,oo]): extra root [F71]
     21- lfun may crash on lfuncreate input with too short an vector      [F72]
BA   22- incorrect use of graphcolors -> SEGV                             [F73]
     23- forcomposite(..., oo, ) was not supported                        [F74]
BA   24- lfunartin with poles: incorrect result                           [F75]
JD   25- factor: significant pointers lost [#2125]                        [F76]
BA   26- matdet/matrank over large fields was inefficient                 [F77]
     27- poldisc(y^2/x + 1, y) -> error [also affects polresultant]       [F78]
     28- poldisc(x^2/y + 1, y) -> 0 [also affects polresultant]           [F79]
     29- ispower(2, 2^64) -> error                                        [F80]
     30- (f(x) = x*'y); f'(1) -> error                                    [F81]
BA   31- sqrtn(Mod(3,19),4) -> no error [#2127]                           [F82]
     32- nfhnfmod: wrong result                                           [F83]
     33- matdet(mat with t_RFRAC entries): wrong result [#2128]           [F84]
     34- n-th derivative of zetahurwitz used 'seriesprecision' instead
         of n + imprecise value when n large [#2130]                      [F85]
     35- lfunzeros(f, [0, b]) wasn't allowed                              [F86]
     36- mateigen(): typo causing wrong results when correct results were
        achievable [#2131]                                                [F87]
     37- intnum(x=-oo,[0,-1/2],1/sqrt(-x*(x^4+1))) -> division by 0       [F88]
     38- printtex(quadgen(-3,'z)) ==> w                                   [F90]
BA   39- [a,b]=a could lead to memory corruption                          [F91]
     40- memory leak in cgetalloc when lg overflows                       [F92]
     41- possible SEGV in padicappr [#2133]                               [F93]
     42- core() could destroy its input, if stored in a GP variable       [F96]
     43- quadgen(2^64+1) * 1. => junk (stack corruption in quad_disc).    [F97]
     44- ellmoddegree: infinite loop and stack corruption (e.g on 52a2)   [F98]
     45- ellmoddegree(ellinit("10890ba6")) -> wrong result                [F99]
     46- nfgcd called ZX_resultant(a,T) with typ(a) == t_INT             [F100]