Changelog for libpari-gmp-tls9-debuginfo-2.17.1-1.1.i586.rpm :

* Wed Feb 05 2025 Jan Engelhardt - Update to release 2.17.1
* Fixed incorrect GP proto for ``ellpadicfrobenius``, ``mftocoset``, ``qfcvp``
* Fixed segfault in ``algsubalg`` when input is linearly dependent
* Fixed ``alglatinter`` trivial intersection (misuse of ``matkermod(,1)``)
* Wed Feb 05 2025 Stefan Dirsch - removed unneeded xorg-x11-proto-devel BuildRequires (bsc#1236804)
* Thu Nov 21 2024 Jan Engelhardt - Update to release 2.17
* Fixed rare SEGV in sumnumrat function
* Fixed `gp -p N` not checking for N < 2^32
* Sun Apr 07 2024 Jan Engelhardt - Update to release 2.15.5
* Fix a memory corruption when using `strjoin([1])`- Explicitly buildrequire amsmath.sty to fix a build failure.
* Sun Jul 16 2023 Dirk Müller - update to 2.15.4:
* lfunan(lfunetaquo([12,1;13
*12,1]),1) -> stack overflow
* FpM_intersect could return a Flm
* 3- ifac_isprime could be called on input with tiny divisors
* nfcompositum could return non-monic polynomials
* gammamellininvinit(vector(9,i,1)) -> SEGV
* incorrect sanity check in rnfeltdown (\"not in base field\")
* precision loss in gammamellininv
* [pthread] parselect could crash
* rare infinite loop in ellsaturation
* quadunitindex(8461,2)->1 instead of 3
* chinese(Mod(1,3)
*(x^2+x+2),Mod(1,5)
*(x-1))->incorrect leading term
* lindep([0,x]) -> SEGV
* [libpari] RgX_div_by_X_x: wrong variable number
* MS 14- hyperellratpoints(2
*x^3+x^2-x,1000) -> wrong result
* ellisogeny over a nf -> inconsistent variables error
* w=3;quadgen(5) -> print x instead of w
* FpX_convol: wrong result for mixed degree
* 18- mateigen(,1): eigenvalues were given as t_VEC or t_COL. Use t_COL.
* ellcard over small finite field: potential oo-loop- add pari.keyring for source integrity validation
* Mon Apr 17 2023 Anton Shvetz - Update to 2.15.3
* rare infinite loop in idealtwoelt
* nfisisom(16
*x^4+1,16
*x^4+1) -> error
* forprimestep(p=a,b,q,) overflow when a > primelimit
* lfun([bnrinit(bnfinit(y^2+1),12),[[2,0],[6,0]]],2) -> error
* lfunthetacost(polcyclo(43)): silent overflow
* ellcard(ellinit([1,1]
*ffgen([41,16])))-> impossible inverse
* wrong result (missing content) in idealred(nf, [id, elt])
* det(integer matrix) -> inconsistent exact division
* fft([],[]) -> SEGV, fft([1],[1]) -> SEGV
* nfrootsof1(x^0) -> oo-loop
* hgmalpha did not check its input
* hyperellchangecurve([],[]) -> SEGV
* hyperellchangecurve(x^0,[1,matid(2),0]) -> SEGV
* rnfeltnorm(x,x) -> SEGV
* polylogmult(1,[],-1) -> SEGV
* ellheight(non-integral E) -> crash
* content(1,y) -> pol_1(y) instead of t_INT 1
* s=taylor(1/((x-1)
*(y-1)),x); taylor(s,y) -> invalid object
* avoid crashing when sumnumsidi diverges (0 bits of accuracy)
* Thu Jan 05 2023 Dirk Müller - update to 2.15.2: Fixed polredbest: rare error \"inconsistent concatenation\" hypergeom([0,0],[1],2) powers(t_INT, ...) was very slow factor(prod(i=1,20,nextprime(2^i)), 131) would include 131 sumeulerrat(x^2/(1+x),2) -> FPE lambertw(10^1000) -> overflow
* Fri Nov 18 2022 Jan Engelhardt - Update to release 2.15.1
* Resolve SIGSEGV with seralgdep and bnfinit functions
* Resolve obscure oo loop in solve when solution ~ 0
* Thu Oct 27 2022 Andrea Manzini - Update to release 2.15.0
* The GP language:
* Notion of DebugLevel \"domains\" that allow to finely control diagnostics.
* The syntax setdebug(dom, val) and default(def, val) are now recognized in the GPRC file.
* Linear Algebra:
* qflll() now implements most LLL modes in fplll (fast, dpe and heuristic), allowing large speedups. Directly and in the many functions that use the LLL algorithm.
* New GP function snfrank(), a utility function returning q-ranks from Smith Normal Forms
* Elementary Number Theory:
* New GP function: harmonic(), to compute generalized harmonic numbers
* Reworked Euler numbers, analogously to Benoulli\'s: eulervec() is now faster and caches computed values, and a new GP function eulerreal() computes floating point approximations.
* Elliptic Curves: New module to compute the Mordell-Weil group of rational elliptic curves
* See https://pari.math.u-bordeaux.fr/pub/pari/unix/pari-2.15.0.changelog for details.
* Wed Apr 13 2022 Anton Shvetz - Update to release 2.13.4
* For z=x+wy a t_QUAD, z.pol returned the modulus z.mod instead of the t_POL x+\'w
*y
* allow eulerianpol(0) (= 1)
* allow polylog(0,x) (was broken when eulerianpol was introduced)
* concat(t_LIST,t_LIST) was leaking memory
* missing type checks in ellchangepoint (led to a SIGSEGV)
* polsturm(-25
*x^4+2
*x^3+99
*x^2-44
*x-132,[-oo,-4]) returned garbage
* ellheight(E,,Q) led to a SIGSEGV
* besselj(80,66) led to an infinite loop
* lfun(1, 0.0) \"normalizing a series with a 0 leading term\"
* (0. + O(x) == 1) returned \'true\'
* idealismaximal(nfinit(x),Mat(2)) -> 0
* O(29^(-1)) == 1 was FALSE (same for -1)
* Mod(0, 2
*x^0) == 1 was FALSE (same for -1)
* [X11] resizing a window could keep traces of previous drawing
* x->x+0x1 was not displayed correctly
* bnfinit(Q) was not using current precision
* polresultant(t_POL with t_RFRAC coefs,...) led to internal errors
* znchardecompose(znstar(2,1),[],2) led to SIGSEGV
* missing roots in nfroots(t_POL,)
* factorpadic: ensure leading coefs are powers of p
* nfsnf returned wrong results
* rare SEGV occurred in nfdisc
* factor((Mod(1,2)
*((t^2+1)
*x^4+(t^4+1)
*x^2+1))) led to a division by 0
* minpoly(Mod(1/(x-(t+1))
*Mod(1,2),(t+1)
*x^2+t
*x+1)) led to an error
* factor(Mod(1,2)
*x^5+a
*x^3) led to division by 0
* nfgrunwaldwang: fix infinite loop
* ti=thueinit(3
*x^3 + 5
*x^2 - 14
*x + 54,1); thue(ti,1) led to an error
* bnrclassfield led to incorrect result when fundamental units are large