pari-2.9.1(STABLE) released

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

Dear PARI lovers,

I would like to announce the release of pari-2.9.1 (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 a problem with writebin on Windows
system and a serious bug affecting very large computation using modular
algorithms based on the Chinese remainder theorem.

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

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.9.1 (released 1/12/2016):
[last column crossreferences current development release 2.10.0]
  Fixed
      1- subst(1+x^3+O(x^6),x,x+O(x^4)) -> SEGV [#1865]                    [F1]
BA    2- lfunartin was using too much stack                                [F2]
BA    3- fflog in char 3 or 5 was slower than intended                     [F3]
      4- RgX_blocks only worked for t_INT or t_POL coeffs                  [F4]
      5- spurious bnrdlisclist entries (with negative number of real
         places...) when modulus not a conductor                           [F5]
BA    6- modular algorithms could fail for very large input                [F6]
BA    7- [mingw] writebin did not work                                     [F7]
BA    8- forprime(N=2^100,oo,...) did not work                             [F8]