1# $Id$ 2Bug numbers refer to the BTS at http://pari.math.u-bordeaux.fr/Bugs/ 3 4Done for version 2.7.0 (released 21/03/2014): 5 6 Fixed 7 1- e = ellinit(E over Qp); ellztopoint(e, 3) --> SEGV 8 2- thue((x^2+1)^2*(x^2-2),-4) --> missing solutions [+-1, +-1] 9BA 3- spaces in directory names were not supported 10 4- silent overflow when inputing t_REAL of huge exponent [#1526] 11 5- zeta(2+10^-101*I) -> overflow 12 6- RgX_mullow(f,g,n) could return a result of degree n (instead of < n) 13 Same with RgX_sqrlow 14 7- ellrootno(E) could lead to a SEGV [#1527] 15 8- issquare(Mod(3,22)) -> 0 [#1528] 16JD 9- polcyclo(5, Mod(-1,3)) was the negative of correct value 17JD 10- elltors(ellinit("90c3")) returned Z/12 but a generator of order 6 18 11- thue(thueinit(x^3-x-1),1578191) => oo loop [#1532] 19 12- catastrophic cancellation in eint1 (x moderately large) 20 13- SEGV in ellweilpairing [#1535] 21 14- factor(Mod(1,2)*Pol(1)) -> [Mod(0, 2) 1] 22 15- Mod(Pol(0), 2) -> 0, instead of Mod(0,2) 23 16- QXQ_to_mod was called with t_POLMOD arguments 24 17- ellwp(E, 'z) had stopped working for E not defined over C 25 18- nfdisc(T, t_MAT=partial discriminant factorization) => corruption [#1542] 26 19- norm(Mod(z,T)) where z is not a t_POL or in a different variable than T 27 => wrong result [#1539] 28 20- polresultant(Pol(Mod(0,2)), x) -> 0 instead of Mod(0,2) 29 21- nffactor(T, pol) possibly wrong results when nfinit(T) is not rigorously 30 computed [#1545] 31 22- gmodgs(t_POLMOD,): incorrect implementation 32BA 23- library functions Fp_pow/Fp_pow mishandled negative basis 33 24- gcd(1/(2^64*y),Mod(x^2,2^64*x^3)) --> inconsistent gcd [#1541] 34 25- matadjoint([x,0,0;0,0,0;0,0,0]) => wrong variables [#1547] 35 26- ellordinate(e, exact t_COMPLEX) => either a wrong result (no solution) 36 or a solution computed at an incorrect accuracy (DEFAULTPREC) [#1548] 37 27- weber(1.0*I,1) => SEGV [#1549] 38 28- primepi(2^32) => oo loop [on 32-bit machine] 39 29- primepi(N >= 2^32 or 2^64) off by 1 40JD 30- [libpari] initprimetable(2^20): infinite recursion 41 31- very inefficient div_rfrac_pol() [#1537] 42 32- polresultantext(x+1,x^2) -> [-# + 1, 1, 1] 43 33- for(i=a, b, ) where a < 0, b < 0 : go through wrong indices if #a != #b 44 34- printf("%1.2f",Mat([1.,2.])) -> SEGV [#1550] 45 46 Added 47BA 1- library functions FlxX_to_FlxC, FlxXV_to_FlxM, polx_FlxX 48BA 2- library function Flx_lead 49 3- library function RgV_to_RgM 50 51Done for version 2.6.2 (released 30/01/2014): 52 53 Fixed 54 1- eulerphi(t_INT factorization) corrupted the input 55BA 2- 8bit chars were interpreted as end of input 56 3- Bernoulli numbers were no longer cached [2.6.0] 57 4- typo in Brillhart, Lehmer, Selfridge primality test [#1467] 58 5- [Configure] confusing error messages when C compiler doesn't work 59 6- scalar + t_SER = 0 => wrong valuation (1+O(x)-1 => O(x^2)) 60BA 7- squaring of t_REAL was not faster than multiply 61 8- 1+O(2^(2^18)) => O(2^0) (silent overflow) 62PB 9- Mod(1, 2) - Mod(2, 4) => Mod(-1,2) [#1469] 63 10- memory corruption in subgrouplist: e.g. subgrouplist([53835600, 29], 5) 64 11- SEGV in zncoppersmith (when auxilliary polynomial was non-monic) 65 12- division by 0 in Fl_ellcard_Shanks [2.6.1, #1474] 66 13- ellwp([1,I]) -> stack overflow [2.6.0] 67 14- sumdedekind(h < 0, k < 0) wrong result; if gcd(h,k) > 0 as well 68 15- galoisexport(G, 1) -> SEGV 69 16- ??default(log) no longer worked 70 17- rnfalgtobasis, rnfbasistoalg, rnfeltup, rnfeltdown, rnfeltabstorel, 71 rnfeltreltoabs were not treating their inputs consistently, and 72 accepted (or crashed on) too many incorrect inputs. 73 18- rnfideal* did not handle correctly the 0 ideal 74 19- rnfidealtwoelt(non integral ideal) => crash 75 20- nfeltreducemodpr(K, non invertible elt mod pr,...) => wrong result 76 (now an e_INV error) 77 21- rnfbasis: wrong result due to a mistake in gen_if_principal 78 [2.6.0, revert d62f0de01] 79 22- nfsolvemodpr(nf,a,b,P): a must be invertible, as in matsolve 80 (was not documented, used to SEGV). Raise an error if not. 81 23- various bnrdisclist crashes 82 24- bnrclassno(bnf, prime ideal) -> SEGV 83 25- forpart(x=k,) raised an exception if k < 0 [ now empty loop ] 84 26- deriv(constant) now returns 0 in the base ring (not gen_0). 85 27- inconsistencies and mistakes in deriv / intformal of t_POLMOD: forbid 86 integration wrt the main variable of x.mod, deriv(Mod(x, x^2),x) was 87 Mod(1,x^2) and deriv(Mod(y,x^2),y) was 0 instead of respectively 0 and 88 Mod(1,x^2) 89 28- idealchinese with t_POLMOD inputs -> input error 90 29- idealchinese with denominators -> SEGV 91 30- qflll(Mat(0)) returned Mat(1) 92 31- infinite loop in sumpos: sumpos(n=1,-log(cos(1/n))) [#1481] 93BA 32- doing allocatemem in the break loop would corrupt the new break loop 94 33- relative error in eint1 was larger than expected 95 34- select(t_LIST,,1) [ indirect select ] didn't work 96 35- vecsort(List(),,4) -> SEGV 97 36- factorpadic / polrootspadic lost accuracy when converting output from 98 integers to t_PADICs (factorpadic(t^2 + 3^5, 3, 5) -> irreducible factor 99 (1 + O(3^5))*t^2 + O(3^5)*t + O(3^0) 100 37- Mod(0,0) is no longer valid => division by 0 (as Mod(x,0) for x != 0) 101 38- RgX_to_RgV no longer accepts other types than t_POL. Use Rg_to_RgV for 102 a more permissive function 103 39- broken Fq_sqrt when T != NULL and t_INT input 104 40- ispower(1009^11) -> 0 [2.6.0] 105 41- ellinit([0,1,1,0,1],2).group -> SEGV 106 42- nfroots(nf, deg 1 polynomial) -> wrong result 107 43- Configure --time=ftime: wrong reported timings 108 44- mateigen(rational matrix): inconsistent concatenation [#1489,2.6.0] 109 45- polroots(): wrong accuracy of (real) 0 components 110 46- randomprime(2) -> SEGV [#1493, 2.6.0] 111 47- forqfvec(v,[;],0,) -> SEGV [#1495] 112 48- poliscyclo(x^0) -> 2 113 49- truncation (precision) errors in bnfnarrow [#1491] 114 50- matadjoint assumed that n! is invertible. If this is not the case, now 115 use a safe algorithm 116 51- leading coefficient of elldivpol ignored the characteristic,e.g. 117 E=ellinit([a1,a2,a3,a4,a6*Mod(1,2)]); elldivpol(E,2) 118 52- gcd involving a t_FFELT -> SEGV 119 53- oo loop in ispower for huge arguments / oo loop in prime iterator 120 in congruence classes [#1498, 2.6.0] 121 54- L=[1,2,3]; apply(x->L=x,L) -> SEGV ( idem select and [|x<-] operators ) 122 55- (k+1.)/k - (2*k+1.)/k -> incorrect object 123 56- gcd(x,0.) -> 1 but gcd(x,Pol(0.)) -> x [ the former is correct, since 0. 124 is inexact and may represent an arbitrary small non-zero real number ] 125 57- eint1 misbehaved at large precision [#1499] 126 58- polredbest(T,1) incorrect if T non-monic or degree 1 127 59- nfcertify might miss a factor to be certified, e.g. 128 P=polcompositum(x^4+437*x+19,x^5-571*x+27)[1]; 129 nfcertify(nfinit(P, [2,3,5])) was empty 130 60- polresultantext(t_POL in y, t_POL in y,y) -> U/V as t_POL in x [#1509] 131 61- inconsistent handling of t_POL "divided by" scalar among the variants 132 of Euclidean division (%, divrem, \, ...). E.g. x % 2 is OK, but 133 x % Mod(2,3) was not. We now follow the semantic of 134 grem/gdeuc/poldivrem: a scalar is understood as a t_POL of degree 0 135 in the proper variable [#1510] 136 62- incorrect rounding in mulur 137BA 63- Configure: --includedir was ignored 138 64- add GC in RgV_dotproduct / RgV_dotsquare 139 65- ZX equal was checking variables, contrary to the spirit of the 140 specification (and contrary to RgX_equal). Specify behaviour properly: 141 none of the internal .*[xX]_equal function check variable numbers. 142 66- arithmetic functions did not accept factorizations of negative integers 143 (whereas most of them are defined for negetive integers) 144BA 67- Configure --time=ftime actually tested times, not ftime. Remove ftime 145 from the default list of timer functions (reports wallclock time, not 146 CPU time) [#1523] 147 68- polredabs() could (find then) forget some polynomials [#1511] 148 69- poldisc(x^3 + Mod(2,3)*x^2) --> e_INV 149 70- (Mod(4.,y^2+1)*(1 + O(x)))^(1/2) -> junk (= [2.0+O(x)),2.0+O(x)]~). 150 Worse if other t_POLMOD coefficients. Now exception. 151 71- sin(O(p)) returned 1+O(p) instead of O(p) 152 153 Changed 154 1- default help text for a user function is now as in \u: 155 fun = 156 (args)->body 157 2- after addhelp(f,...), ?f no longer include default help text for a 158 user function (function code). Type 'f' to see the function code. 159 3- primes([a,b]) now returns the primes in the interval [a,b] 160 4- install: add symbol name in library and GP prototype to default help 161 5- the rnf structure format 162 6- library functions: rename rnfelementxxx -> rnfeltxxx, 163 rnfidealhermite -> rnfidealhnf 164 7- allow mathnf(t_VEC) [ apply Mat() automatically ], gives acces to the 165 ZV_gcdext() routine. 166 8- mathnf(,2) (generic vs integral t_MAT) is deprecated: we always test 167 the matrix entries and choose the appropriate routine 168 9- bnrclassno: allow all standard ways to define class fiels (A,B,C), 169 not only bnf + module 170 10- bnrinit(bnf,f): allow using idealstar(bnf,f) in place of f 171 11- Let Set(t_VECSMALL v) behave as Set(Vec(v)) 172 12- ffgen(T) now checks whether T is squarefree (testing for 173 irreducibility is too expensive) 174 13- variable() no longer raises exceptions: if no variable can be 175 associated to the object, return 0. Thus "if (!variable(x), )" may be 176 used to test whether x has a "variable". 177JD 14- polcyclo(n, x) now works for all roots of 1 178 15- quadpoly no longer accepts vector/matrix arguments, see 2.6.0,C94 179 16- [libpari] renamed ZM_hnfremdiv -> ZM_hnfdivrem 180 17- x t_REAL * y t_INT: either convert y to t_REAL (as before) or use 181 integer multiplication (if lg(x) >> lg(y)) 182 18- GP: all results are now stored in GP history, together with the time 183 to obtain them [ we used to only store non-gnil results, and no timings ] 184 19- chinese(t_POL,t_POL): allow polynomials of different degrees 185 20- deplin(): use FpM/Flm/F2m routines if possible (like all other generic 186 linear algebra routines) 187 21- FpM_gauss(a,b,) from modular kernel no longer allow all types of input: 188 split into FpM_FpC_gauss (b t_COL) and FpM_gauss (b t_MAT). Same for 189 all modular xxx_gauss functions 190 22- O(1/x^2) --> error [ now equivalent to O(x^-2) ] 191 23- faster evaluated polhermite/pollegendre 192 24- polhensellift / ZpX_liftfact: use quasi-linear ZXX_mul_Kronecker instead 193 of RgX_mul (~ Karatsuba) 194 25- [libpari] renamed gcmpX -> gequalX 195 26- [libpari] renamed ordred -> polredord 196 27- the prid structure returned by idealprimedec: the anti-uniformizer 197 tau (pr_get_tau) is now stored via its multiplication table 198 28- rnfpolredabs(x,3) did not conform to the documentation (which did not 199 make sense). Fix documentation and function, for rnfpolredbest as well. 200 29- [libpari] renamed recip -> serreverse 201 30- lift(x,'v) / centerlift(x,'v) now only lift t_POLMODs in variable v, 202 no longer (most) t_INTMOD / t_PADICs met along the way 203 31- lift / centerlift no longer raise an exception when they encounter 204 a non-arithmetic type (e.g. a t_REAL or even a t_STR) in a structure. 205 They just copy the offending sub-object as-is. 206 32- generic polynomial Euclidean division (grem, gmod, poldivrem): when 207 result is the zero polynomial, use RgX_get_0, not gen_0 / pol_0 208 33- rnf.pol (absolute defining polynomial / Q) is now called rnf.polabs, 209 rnf.pol is now the relative polynomial, defining the relative extension 210 over the base. 211BA 34- FpXYQQ_pow: change order of moduli to be consistent with FpXQXQ_pow. 212BA 35- FlxYqQ_pow: renamed to FlxYqq_pow, and moduli order changed. 213 36- idealstar(K,id), allow to input 'id' as a factorization into prime 214 ideals, as produced by idealfactor 215 37- define eulerphi(0) = 2 [ now eulerphi(n) = znstar(n).no for all n ] 216 38- allow subst(t_SER,x,exact 0): subst(2+O(x),x,Mod(0,3))->Mod(2,3) [#1513] 217 39- [libpari] rename gsh -> gsinh, gch -> gcosh, gth -> gtanh, 218 gash -> gasinh, gach -> gacosh, gath -> gatanh, ggamd -> ggammah 219 (follow GP names) 220 40- no longer naively use the Karatsuba/3M formula to multiply t_COMPLEX 221 of t_REALs: loss of accuracy is too important and unpredictable from the 222 user's point of view [ e.g. (1+ 1e-90*I)*(1e90+I) -> 1. E90 + 0.E52*I, 223 when the definition directly yields 1. E90 + 2*I ]. Could use it when 224 the exponents of real/imaginary parts are close, increasing the 225 precision by the exponent difference (increasing overhead...): not done 226 yet. 227 41- renamed mpexp1 -> mpexpm1, cxexp1 -> cxexpm1 228 42- change prototye of mpsincos1 and rename -> mpsincosm1 229 230 Added 231EP 1- Configure option for gcov/lcov support 232 2- libpari function FF_f, member function g.f for t_FFELT 233 (definition field has p^f elements) 234 3- libpari functions gprimepi_upper_bound, gprimepi_lower_bound, 235 primepi_lower_bound, primes_interval, primes_interval_zv, 236 primes_upto_zv, primes0 237 4- libpari functions rnf_get_absdegree, rnf_get_invzk, rnf_get_map, 238 rnf_get_nf, rnf_get_nfdegree, rnf_get_nfpol, rnf_get_nfvarn, rnf_get_pol, 239 rnf_get_polabs, rnf_get_zk, rnf_get_nfzk, rnf_get_varn, rnf_get_disc, 240 rnf_get_index, RgV_is_QV, RgX_equal_var 241 5- allow rnf.disc, rnf.index 242 6- functions rnfelttrace, rnfeltnorm 243 7- function ZV_gcdext, based on ZM_hnflll (simplified) 244 8- allow ffgen(p^f) instead of ffgen(ffinit(p,f)) 245 9- [libpari] Fq_sqrtn 246 10- mathnfmodid(m, d): allow d an arbitrary vector of positive integers. 247 The old syntax (d an integer, representing a vector of equal integers) 248 is still allowed 249LGr11- GP function Colrev 250 12- GP operator %#n to recover time used to compute history result %n 251 13- GP function getabstime() 252 14- [libpari] Rg_to_F2, RgV_to_F2v, RgM_to_F2m, F2c_to_mod, F2m_to_mod, 253 Flc_to_mod, Flm_to_mod, F2m_F2c_invimage, F2m_invimage, F2m_suppl, 254 Flm_suppl, F2m_rank, Flm_rank, F2m_rowslice, F2v_slice, F2v_ei 255BA 15- Parallel GP support (parapply, pareval, parfor, parforprime, parselect, 256 parsum, parvector) 257 16- [libpari] residual_characteristic 258 17- GP function characteristic() 259 18- [libpari] muluui, diviuuexact 260 19- [libpari] Kronecker_to_ZXX, ZXX_mul_Kronecker 261BA 20- conversion from matrices of FFELTs to low level (Fq/Flxq/F2xq) kernels 262 for faster treatment. 263 21- FqM_det, FlxqM_det, FlxqM_inv, F2xqM_det, F2xqM_inv, F2xqM_image, 264 F2xqM_image, F2xqM_rank, FFM_det, FFM_image, FFM_ker, FFM_rank, FFM_inv 265 22- ZM_rank, ZM_indexrank, ZM_indeximage 266 23- GP function normlp 267BA 24- GP function vecsum 268 25- [libpari] pr_equal, ZC_nfval, ZC_nfvalrem, ZC_prdvd, ZV_Z_dvd 269 26- allow .p / .e / .f / .gen for modpr structures 270 27- function rnfpolredbest 271 28- functions qfnorm, qfbil 272 29- [libpari] ZM_multosym, RgM_multosym, RgMrow_RgC_mul, RgM_transmul, 273 RgM_transmultosym, ZM_transmultosym 274 30- [libpari] nf_rnfeq, nf_rnfeqsimple, eltreltoabs, eltabstorel, 275 eltabstorel_lift, nf_nfzk, nfeltup, QXV_QXQ_eval, QXX_QXQ_eval 276 31- [libpari] factor_pn_1_limit 277 32- [libpari] get_FpXQ_star, gener_FpXQ_local 278BA 33- move gpinstall to libpari 279 34- liftall() lifts recursively all t_INTMOD/t_PADIC/t_POLMOD components 280 35- liftint() lifts recursively all t_INTMOD/t_PADIC components 281 36- liftpol() lifts recursively all t_POLMOD components 282BA 37- GP function logint 283PB 38- [libpari] gen_matmul, gen_matcolmul, FFM_mul, FqM_FqC_mul, FqM_mul, 284 F2xqM_mul, F2xqM_F2xqC_mul, FlxqM_FlxqC_mul, FlxqM_mul. 285 39- [libpari] Flx_equal, F2x_equal 286BA 40- [libpari] FpM_powu/Flm_powu/F2m_powu 287 41- new GP function idealprincipalunits 288 42- [libpari] checkabgrp, abgrp_get_no, abgrp_get_cyc, abgrp_get_gen, 289 bid_get_grp, bid_get_no 290 43- [libpari] FpX_disc 291 44- [libpari] retmkcomplex 292 45- GP function expm1 (= exp - 1, avoiding cancellation) 293 294 Removed 295 1- optional flag to factorpadic() [ enabling Buchman-Lenstra + round2 ] 296 Use the default = round4 297 2- useless wrappers map_proto_GG, map_proto_GL, map_proto_lGG 298 3- [libpari] useless functions gand, gor 299 4- [libpari] useless function ratlift [ use Fp_ratlift ] 300 301Done for version 2.6.1 (released 20/09/2013): 302 303 Fixed 304 1- Allow compounding 1-letter flags to gp, e.g. qp -qf [ used to silently 305 ignore the 'f' ] 306 2- ellminimalmodel, followed by ellchangecurve ==> structure incorrectly 307 updated [wrong Q_MINIMALMODEL component] [2.6.0, #1416] 308 3- lift(1/2+O(2))=2/1 --> incorrect result + corrupt object [2.6.0, #1424] 309 4- local() could corrupt polynomial variable of the same name 310 5- write did not fclose() the output file handle [2.6.0, #1425] 311PB 6- issquare(Mod(1,2)) -> domain error [2.6.0, #1429] 312PB 7- issquare(Mod(0,2),&s); s -> Mod(2,0) error [2.6.0, #1430] 313 8- ellheight(E not given by minimal model,P) -> domain error [2.6.0, #1432] 314 9- ellchangecurve(E, [1,0,0,0]) lost Q_MINIMALMODEL ->SEGV later [2.6.0] 315 10- warning() would print "warning: user warning:"-> "user warning:" [2.6.0] 316 11- matinverseimage(A, t_MAT B) would treat individual columns B[,i] 317 independently and successively. Now use a single Gauss reduction. 318 12- Flm_Fl_mul returned a wrong result 319 13- ellinit(ellfromj(Mod(0,17))) -> curve defined over Z [2.6.0, #1436] 320 14- allocatemem: make sure fix_size() is called to avoid alignment 321 problems [#1437] 322 15- ellmodulareqn(2) did not clean the stack properly [2.6.0, #1442] 323 16- issquare(Mod(13,121)) --> not an n-th power residue in Qp_sqrt [2.6.0] 324 17- stack corruption in carberkowitz / charpoly(,,3) [ session crash ] 325 18- ellinit(E over Fp, t_FFELT) => error [2.6.0] 326 19- mateigen([5/3,7/45;0,21/10]) => precision error (missing eigenspace) 327 20- subst(O(x^2),x,0*x) => SEGV [#1447] 328 21- memory corruption in aprcl [2.6.0] 329 22- factormod(,2) => wrong result [2.6.0, #1451] 330 23- dirmul/dirdiv: incorrect result length when valuation > 1 331 24- x,y a t_PADIC, x === y always returned 0 [2.6.0] 332 25- bernpol(0) => memory corruption [2.6.0, #1458] 333 26- round((1e-40+x) / (1e-39+x)) would create the invalid object x/x 334 27- polgalois(x^11 + 627*x^4 - 584) -> F_110 instead of S_11 [#1460] 335 28- input lines with more than 2^31 characters (without \n) resulted in a 336 truncated read [#1461] 337 29- znlog(1,Mod(8,9)) -> division by 0 [#1463] 338 30- plot(x=1,2,x) gave a graph with 0<=y<=2, instead of ymin<=y<=ymax 339 31- ?= or even = would apparently hang GP (waiting for further input) 340 341 Added 342 1- genus2red: an implementation of Liu's algorithm to determine the 343 reduction of a genus 2 curve (at p > 2). Based on genus2reduction-0.3, 344 http://www.math.u-bordeaux1.fr/~liu/G2R/ (Cohen & Liu, 1994) 345 mostly rewritten from scratch: 346 - adapted to pari-2.* 347 - somewhat modularized 348 - fixes all known instances of 'bug27' and 'bug28' (at p = 3, reported 349 through Sage users). 350 - bench 'genus2red' contains a check of at least one instance of each 351 of Namikawa-Ueno's types + all cases on which the original 352 genus2reduction was known to fail. [CAVEAT: the interface will change] 353 2- allow to startup gp with flags --default key=val (or -D key=val): 354 execute default(key,val) on startup 355BA 3- functions Flm_center, Flv_center, zv_to_Flv, zm_to_Flm, zm_mul, 356 zm_zc_mul, scalar_Flm 357BA 4- function minim_raw 358 5- function QX_complex_roots 359PMo 6- function forpart for looping over partitions 360 7- [libpari] forcomposite_init / forcomposite_next, reimplement 361 forcomposite() using this iterator 362 8- Configure now generates a file 'config.log' to help debugging when it 363 makes a mistake (contains all messages from compilers) 364 9- [libpari] RgM_invimage, RgM_RgC_invimage, FpM_invimage, 365 FpM_FpC_invimage, Flm_invimage, Flm_Flc_invimage, Flm_neg 366 10- [libpari] serchop0, integser functions 367 11- psi(t_SER) using Luke's recursion, then lngamma, gamma, gammah 368 for t_SER arguments around an arbitrary complex z0 (was implemented 369 for z0 = 0,1 only) 370PB 12- PARI functions FlxqM_gauss, FlxqM_inv and FqM_gauss 371 13- PARI functions FpM_hess, FpM_charpoly, charpoly, RgM_Rg_sub, 372 RgM_Rg_sub_shallow 373 14- generic driver for GP's charpoly(): select appropriate algorith (flag) 374 depending on input type. 375BA 15- allow ellsearch(t_VEC) : search for curve with given name, in given 376 isogeny class or with given conductor; alias for the existing 377 ellsearch(t_STR) as per the ellconvertname correspondance 378 16- option flag to mateigen: also return the eigenvalues 379 17- [libpari] Z_lvalrem_stop, u_lvalrem_stop 380 18- [libpari] ZX_rescale_lt 381BA 19- Port of the program ISOM by Bernt Souvignier for computation of 382 automorphisms and isomorphisms of lattices. 383 New GP functions qfauto, qfisom, qfisominit, qfautoexport 384 20- [libpari] RgX_mullow, RgX_sqrlow 385 21- [libpari] embed_T2, embednorm_T2, embed_roots, embed_disc, embed_norm 386 22- arithmetic functions now accept factorization matrices, you can use any 387 of f(N), f(factor(N)) or f([N, factor(N)]) 388 23- GP function readstr 389 24- allow lists of elements in chinese() 390 391 Changed 392 1- gp --primelimit lim (gp -p lim) is deprecated. Use the generic form 393 'gp -D primelimit=lim' (setting primelimit is now mostly useless, anyway) 394 2- gp --stacksize lim is deprecated. Use gp -s lim or the generic form 395 'gp -D parisize=lim' 396 3- partitions() interface to match forpart() 397 4- improve qfbred(t_QFI) for "small" inputs 398 5- bnfnewprec: ensure we recompute bnf from scratch at most once (could 399 happen many times in makematal()) 400 6- [make bench] properly align results if 'printf' is available 401 7- [libpari] the *_invimage function no longer accept a t_COL second 402 argument: use the RgM_RgC_invimage variant. They now return NULL when 403 no solution exist (used to return a t_COL / t_MAT of length 1) 404 8- [libpari] replace the forvec_start() function by a standard 405 iterator: forvec_init() / forvec_next() 406 9- [libpari] Z_lvalrem would destroy its argument. No longer. 407 10- znprimroot(p^k) now always returns the smallest primitive root (was 408 only true for k = 1) 409 11- gmul / gsqr for t_SER with t_INTMOD coefficients: reduce to Z[X] + 410 Kronecker substititution (quasi-linear vs. Karatsuba) 411 12- Mulders/Hanrot-Zimmerman short products for power series 412HC 13- new mpveceint1 implementation: faster and more precise 413 14- version string for development versions: added number of reachable 414 commits (as per git rev-list). Affects version() [#1346] 415 416 Removed 417 1- drop support for "gp -b buffersize" (obsolete since 2.2.10, 04/2005) 418 2- drop backward compatibility 'gp -emacs', 'gp -test'. Use the '--emacs' 419 and '--test' forms. 420 421Done for version 2.6.0 (released 15/05/2013): 422 423 Fixed 424 1- Euclidean chains were confused by t_POLs with t_INTMOD/t_POLMOD coeffs 425 [ because a 0 polynomial could have lg() == 3 ] 426 2- numerical instability in ellheightoo [#1204] 427 3- Flm_gauss(m, smallish p): fix and enable the OK_ulong switch [ faster ] 428 4- remi2n didn't allow negative arguments [native kernel] [#1215] 429 5- ellrootno(e, p) started by computing a global minimal model for e 430 instead of a local one at p. 431 6- qfbred(t_QFR) wrong when frac( sqrt(D) ) > 0.5 432 7- add GC in sumalt() 433 8- problems with diagnostic messages when changing a 'default', e.g. \o3 434 9- divru() could call bfffo(0) => overflow in expo() 435AMe10- (t_FRAC<0) * t_INTMOD => wrong result 436 11- trace(t_POL or t_SER) could yield an unormalized object [0 leading term] 437LGr12- off-by-1 error in primepi() when argument is = primelimit 438 13- bestappr(0.*x+1) -> incorrect object 439 14- znlog(3, Mod(3,8), 2) -> error 440 15- crash when default(prettyprinter,...) points to a non-existent command 441 16- qfperfection(): wrong result in unlucky cases [#1223] 442 17- allocatemem() did not reset parse error [#1226] 443BA 18- (x->vector(1,j,x))(1) --> significant pointers lost [#1211] 444VL 19- [makefile] Incorrect -I and -L flags order [#1212] 445 20- nfbasis / nfdisc(f,, partial factorization) would sometimes spend a 446 lot of time trying to factorize a discriminant [#1227] 447 21- numerical instability in qfgaussred / qfsign [#1232] 448 22- missing consistency checks in conjvec [#1231] 449 23- numerical instability in polredabs [#1228, #1229] 450 24- wrong result in bezoutres [#1233] 451 25- wrong sign in polresultant() [#1234] 452 26- change default(realprecision) so that it returns the internal precision 453 [ as precision(1.) ], not the number of printed digits. [#1235] 454 27- subst(Y/X,X,x) -> 0 455PB 28- polrootsff(x^2-x-ffgen((v^2+1) * Mod(1,3))) -> SEGV [#1241] 456 29- intnum(t=[0,0],[1],(sin(t)/t)^2) -> "precision too low in mpsc1" 457BA 30- functions ending by the x[y]=z construct could corrupt the stack. 458 31- nfbasis(pol, 0, factorization containing (-1)^1) -> wrong [#1244] 459 32- qfminim(): better type checks for matrix entries 460 33- qfminim(): incorrect GC in smallvectors() 461 34- padicappr(x^2+1+O(3), -1+O(5^10)) --> no error 462 35- tests test-kernel and test-ploth were broken 463 36- lots of missing sanity checks in hilbert(x,y,p) 464 [ e.g. hilbert(O(3), Pi, 5) -> 0 ] 465BA 37- for(i=1,10^7,) + SIGINT -> SEGV [#1249] 466 38- ellwp: take flag into account also for t_SER output [ was: numerical 467 case only ] 468 39- factor(p) was much slower than isprime(p) for p a "small" prime 469BA 40- mateigen precision error was not trappable. 470 41- accuracy problems in bnfisunit [#1253] 471 42- broken rnfeltup [#1255] 472 43- x===y was always wrong for x,y t_SER 473BA 44- gamma(t_SER) with positive valuation did not work. 474 45- ispower(x < 0) could return an even value ! [#1259] 475 46- ispower(1 / n) return a wrong result [#1259] 476BA 47- [breakloop] initial context could be lost. 477BA 48- Ser([1+O(x)],x) returned an invalid object. 478BA 49- ispseudoprime used too much stack for huge operands. 479 50- [rnfidealup doc] idealgentoHNF() was incorrect. 480DS 51- elldivpol returned wrong result for degree n >=8. 481 52- overflow in mpbern(n) for huge n [#1256] 482 53- idealfactor(nf, non integral ideal) would remove a rational content 483 instead of factoring A/B with A,B coprime integer ideal. Which led 484 to costly factorizations [#1158] 485LGr54- the global variables associated to the primetable _maxprime / diffptr 486 could become inconsistent 487 55- psdraw() ignored plot colors 488BA 56- stack_base() was not C89 standard compliant. 489BA 57- my(f(x)=x+1);f --> SEGV [#1273] 490 58- ellheight([0, 0, 1, -1, 0], [0., 0.]) -> BUG 491 59- allow bnrL1 over Q [#1279] 492 60- factorpadic(,,,1) => SEGV when linear factors/Q [#1278] 493 61- mathnf(..., 4) didn't remove 0 columns from HNF [#1271] 494JD 62- possible SEGV in pari_init_opts [#1264] 495BA 63- ellorder(E,P*Mod(1,p)) did not work if E was defined over Z 496 64- allow writebin to save user functions (t_CLOSURE) [#1171] 497 65- sqrtn(1+O(5),5) -> error, ispower(1+O(5),5) -> error [#1261] 498 66- parimacro.tex: pdftex --output-format dvi would produce a PDF 499BA 67- pari_close failed to free all allocated memory [#1297] 500BA 68- pari_close did not restore GMP memory functions 501 69- avoid outputing ANSI escape sequences to reset terminal state when 502 unnecessary [#1289] 503BA 70- ellpointtoz was numerically unstable 504 71- issquarefree(0) => error [#1304] 505 72- sizebyte(t_LIST) returned the size of the wrapper type, not the list 506 itself [#1307] 507 73- ellgroup(E over Q, p) now returns the structure of the group of 508 non-singular points, when the curve has bad reduction at p. 509 74- factor_proven not taken into account in factor(n), where n is a 510 BPSW-pseudoprime 511 75- core(5*(huge composite)^2) was very slow [#1305] 512 76- sqrt(0.E-97-1.12-97*I) -> div by 0 [#1309] 513BA 77- FpX_gcd(0,x) -> div by 0 514 78- x; y; p; q; subst(Mod(q,p), q, x + y) --> Mod(1, p)*x [#1321] 515 79- off-by-1 error when placing prime table sentinel after e.g. 516 default(primelimit, 2); 517 80- t_REAL with huge exponents print incorrectly [#1322] 518 81- a1;a2;a3;a4;a6;ellinit([a1,a2,a3,a4,a6],1) was very slow 519BA 82- FpX_factorff and FpX_rootsff were not using standard argument order 520PB 83- printf("%.6f", 5E-5) -> SEGV [#1328] 521BA 84- diffop(Mod(y,x^2-y),[y],[1]) -> wrong result 522BA 85- calling a GP function with a lot of omitted arguments could cause a crash 523GH 86- missing solutions in thue(), e.g. thue(thueinit(x^3+92*x+1),3^3) 524 87- t_RFRAC == t_RFRAC could return a wrong result [#1339] 525 88- obscure bug in polroots() (sage #13314) 526 89- polinterpolate([1,2] * Mod(1,7), [2,3], 0) -> incorrect type in gabs 527BA 90- printf() did not flush output 528 91- logint() used too much memory and could return a wrong result: 529 logint(3^64, 3) --> 33 530 92- eint1(x < 0) normalization. Now eint1(x) = incgam(0, x) [#418] 531 93- polrootsff(2*x+1,2,y) -> SEGV [#1350] 532 94- resultant(x,x,y) -> 0 and related problems 533 95- thue((x^4+1)^2, 4) -> no solution 534BA 96- idealramgroups() and idealfrobenius() did not accept a bnf 535 97- using new operators with default(compatible,3) caused a crash 536 98- rare corruption in ECM [#1240] factorint(,1) => SEGV 537 99- add missing call to normalize() in lift(t_POL/t_SER) [#1359] 538BA 100- listput was not SIGINT safe 539BA 101- znorder(Mod(5,16),200) -> 5 instead of 4 540 102- e.tate lost accuracy 541 103- 2-adic ellinit 542 104- allow ellinit over C 543 105- ellpointtoz(E / Qp, ...) [ wrong result / error messages ] 544JD 106- galoisinit(x^3+x^2-2*x-1) -> uninitialized read [#1389] 545BA 107- polhermite(66) -> corrupted result [#1393] 546 108- nfhnf() would only accept matrices of maximal rank 547BA 109- galoisfixedfield() could return a wrong result for polynomials with 548 large roots [#1406] 549 110- bnrdisc could return a wrong result if the modulus had more than 550 2 prime divisors [#1399] 551 111- a = Mod(1,2)*x; gcd(a,a) return x instead of Mod(1,2)*x 552 112- changing primelimit from within forprime loop yielded unpredictable 553 results (potential SEGV) 554 113- y;z;(x^2+y)*w/z/x -> significant pointers lost [#1248] 555 114- log(t_FRAC close to 1) => junk (idem lngamma) [#1238] 556 115- thue(thueinit(x^3-1493,1),3) -> error 557LGr116- typo in modr_safe -> precision error [#1413] 558 117- nfhnfmod(non-integral module) => wrong result 559 nf=nfinit(y); A = [[1,1/2;0,1],[1,1]]; 560 nfhnfmod(nf, A, nfdetint(nf,A)) 561BA 118- [native kernel] FFT mulii relied on unspecified order of evaluation 562 563 Changed 564 1- mathnf: swapped flag 3 and 5. 565 2- allow ellinit([a4,a6]) [#1213] 566 3- ellinit(... singular curve ...]): return [] instead of raising an error 567 4- GP set elements are no longer converted to t_STR (requiring "eval" to 568 recover the underlying object). Arbitrary GENs can be stored in a set. 569 5- moved Odos/* to relevant src/systems subdirectory 570 6- removed Odos directory 571 7- no longer allow Vec()/Vecrev(), Col(), Vecsmall(), without argument. 572 Use [], []~, Vecsmall([]), respectively. 573 8- allow specifying an optional dimension in Vec/Vecrev, Col, Vecsmall. 574 9- allow Vecsmall(t_POL or t_SER) 575LGr10- nicer printout of small matrices: justify columns 576 11- improve gmul(t_REAL, t_FRAC) when numerator of t_FRAC is 1 577BA 12- [darwin] do not use dylib_ prefix to ld options [#1210] 578 13- allow idealhnf(nf, t_QFI / t_QFR) for quadratic fields 579 14- no longer allow 3 arguments in bestappr() [useless], no longer 580 mix Pade approximants and continued fractions [too confusing: must a 581 t_SER be converted to a t_RFRAC or be treated coefficientwise?] 582 15- if znlog() has no solution, return [] instead of error 583 16- znlog(x, g): no longer assume that g is a primitive root, nor that the 584 underlying (Z/N)^* is cyclic 585 17- renamed gen_eltorder -> gen_order 586 18- logfile: strip properly color escape sequences [#1225] 587 19- change nfbasis(T, flag, fa) to nfbasis(T, listP). flag was used to invoke 588 round2 instead of round4 (inefficient=> useless) OR to only 589 partially factor poldisc(T), up to primelimit (very dangerous since 590 primelimit is a global variable). Now listP describes a list of primes, 591 and we return a basis of an order which is p-maximal at all those primes: 592 either a vector of primes, a factorisation (as fa before) or an integer 593 B to indicated {p <= B} (a safe and flexible version of nfbasis(T, 1)). 594 nfdisc() was changed similarly. 595 20- first call isanypower() in BPSP_psp_nosmalldiv() when input is > 2^512 596 [ < 1% of required time, 1 order of magnitude faster when it succeeds ] 597 [ #1074 ] 598 21- sort polroots() output so that it no longer depends on current precision 599 22- delete README-subversion, replace with README-git 600 23- move README.os2 to src/system/os2/README 601 24- change compiler version printout in gp header 602 25- much faster final divisibility test in nfgcd() [#1214] 603 26- error type sqrter5 "not a quadratic residue in sqrt" now generalized 604 to denote "not an n-th power residue in sqrtn" 605BA 27- global_err_data is now a GEN. 606BA 28- more usable form of alarm(s, code): evaluate code, aborting after s 607 seconds. Return the result or a t_ERROR object. 608 29- [non-Unix systems] the name of the preferences file is now "gprc.txt" 609 (it remains ".gprc" on Unix systems) 610 30- also look for the preferences file in PARI's "datadir" 611 31- removed rootsold() code : polroots(x, 1) is no longer accepted 612 32- rewrite ellan using C-longs + new function anellsmall() 613 33- renamed all libpari error codes [ pari_err() arguments ] 614 34- allow t_VECSMALL in vecextract 615 35- look for a few more short vectors in polred(), only return subfields 616 and the best primitive polynomial [wrt discriminant] 617 36- [library] remove precdl argument in ellwp0: use a t_SER argument like 618 in all other transcendental functions. 619 37- ellsigma / ellzeta: allow t_SER arguments, like ellwp. 620 38- polcoeff(x+2*y,1,y) -> 2 [ was 2*x^0 ] 621 39- quadhilbert / quadray: replace final polredabs call by polredbest [#1025] 622 40- listsort() now uses the cmp() comparison function, and becomes fully 623 compatible with setsearch() [#1167] 624 41- vecsort(,,2) [lexicographic order] is now always on. The flag is 625 now deprecated and ignored. 626 42- allow t_SER with integral coefficients to use asymptotically fast 627 (ZX_mul / ZX_sqr) polynomial multiplication 628LGr43- let initprimes0 use an existing prime table 629 44- rename stackmalloc -> stack_malloc. Add stack_calloc 630 45- matimagecompl() now returns a permutation (t_VECMALL) no longer a t_VEC 631 46- remove config/gitversion from 'make snapshot' tarball 632JM 47- Better implementation of ellweilpairing/elltatepairing 633BA 48- agm now returns the optimal AGM 634 49- unify make_emacs_tags / make_vi_tags => make_tags + fix problems for 635 (exuberant-ctags)-based etags. Both tag files (emacs / vi) contain 636 the same tags now. 637 50- ellglobalred(E) now also returns the conductor factorization [4th compo] 638 51- library functions *_incremental_CRT no longer need the product of the 639 moduli, instead they compute it and update the running modulus. 640 52- factor_proven now affects all the factoring machinery, as documented, i.e 641 also multiplicative function (moebius, sumdiv,...) 642 53- allow t_VECSMALL in lex() 643 54- nfrootsof1(K) check whether K.pol is a translate of a cyclotomic pol. 644 [initial patch LGr, #1175] 645 55- format of cached Bernoulli table: now a t_VEC of t_FRAC / t_REALs. 646 Removed bern() macro. The new data must be accessed using bernfrac / 647 bernreal. 648 56- [libpari] simplify init_primepointer(n, p, &pd) interface 649 => init_primepointer(n, &pd). Remove argument 'p', ignore the previous 650 value of pd [ remove assumption that it pointed into a prime table ] 651 and always set pd to a pointer into the private prime table. 652 57- forprime loop: no longer allow to modify the loop index 653 ? forprime(p = 2, 10, p = []) 654 *** at top-level: forprime(p=2,10,p=[]) 655 *** ^--- 656 *** prime index read-only: was changed to []. 657 58- faster forparii() [ for() with t_INT lower bound ] 658 59- forprime(p = a, b, ...) now iterates over arbitrary ranges of primes, 659 independently of 'primelimit'. Parameter 'b' can be omitted (no upper 660 limit). More generally primelimit is no longer a true limit to iterate 661 over primes: all libpari functions use the forprime_t interface 662 60- rename ggval -> gvaluation 663BA 70- GP function ellpow is renamed to ellmul 664BA 71- rename powell->ellmul, addell->elladd, subell->ellsub 665 72- is_pth_power interface [ pass a forprime_t iterator ] 666 73- polrootsmod(, 4) is no longer accepted 667 74- revert to Ramanujan's formula to compute Pi [ + binary splitting ] 668 75- polinterpolate(,, 'x) use divide & conquer algorithm 669BA 76- binary(0) now return [] 670 77- polisirreducible() now avoids factoring in most cases 671HC 78- reimplement incgam() 672 79- allow eint1(t_COMPLEX) 673 80- when 'echo = 1', no longer echo commands if they were entered 674 interactively [commands ended up printed twice] 675 81- unless 'echo = 1', no longer log commands entered non-interactively 676 when 'log = 1'. '\r file' used to log the entire content of 'file'. 677 82- allow thue(t_POL, rhs) for thue(thueinit(t_POL, rhs)) 678 83- elltors now uses division polynomials by default 679 84- modified "Hit Return to Continue" message so that it becomes a comment 680 when copy-pasted 681 85- rnf_fix_pol() takes an extra argument, the calling function's name 682 86- fast gerepilecopy() for leaves 683 87- rename leftright_pow_fold -> gen_pow_fold, leftright_pow_fold_i 684 -> gen_pow_fold_i 685 88- upowuu now returns 0 on overflow 686 89- primes(n) no longer needs precomputed primes 687 90- prime(n) no longer needs precomputed primes 688 91- primepi(n) no longer needs precomputed primes 689 92- removed 3s delay when recompiling PARI after modifying a header 690 [ Was there to avoid problems on slightly out-of-synch NFS fileserver 691 host. Had become an annoyance on fast multicore servers, esp. when 692 bisecting to find a broken commit. ] 693 93- improve Configure --tune + let tune -t/-tt/-ttt print more and more 694 verbose messages [ old 'tune -t' corresponds to current 'tune -tt' ] 695 94- arithmetic functions no longer accept vector / matrix arguments [ to 696 later allow passing factorization matrices ]: use apply() 697BA 95- rename RgX_check_ZXY -> RgX_check_ZXX, ZXY_max_lg -> to ZXX_max_lg 698 96- elleta() and elleisnum(e, 2) to use a theta series formula in 699 O~(prec^(3/2)) instead of O~(prec^2). 700BA 97- zv_cmp0 renamed to zv_equal0 701 98- allow ellinit / Qp for arbitrary reduction type 702 99- ellpointtoz(E / Qp, ...), now return phi(P) [ used to return the same 703 result for phi(P) and phi(-P) [ split multiplicative reduction ], 704 resp. phi(P) + 1/phi(P) [ non-split reduction ] 705 100- ellinit(E / Qp).tate : the u component is now always a square root 706 of u2, also in the non-split case (in which case it lives in a 707 quadratic extension of Qp) 708 101- renamed library function divsum() => sumdivexpr() 709 102- listpop(empty list) => no-op [ was "domain error" ] 710 103- ellap, ellak, ellan: allow non-minimal model 711 104- when timer = 1, no longer print timing if the time is negligible; 712 in particular, no timing should be printed when defining a user function 713 or and alias. 714 105- The proper way to initialize an nf structure when the polynomial 715 discriminant is hard to factor is nfinit([T, listP]), where listP 716 specifies a list of primes (see ??nfinit). nfdisc, nfbasis, all the 717 polred functions allow analogous arguments (see Changed-19). This is 718 cleaner and more flexible than old flags relying on the value 719 primelimit (e.g. nfinit([T, nfbasis(T, 1)]), now deprecated). Also, 720 the nfinit function now sees the local specifications and can 721 take steps to avoid problems (instead of taking for granted a basis, 722 without knowing whether it is correct or not). The result can 723 also be certified (nfcertify) 724 106- polredabs() with (deprecated) nf_PARTIALFACT flag (or new [T,listP] 725 argument) now returns 0 if the resulting order cannot be proven to be 726 maximal. 727 107- rename bezout() -> gcdext(), polresultant() -> polresultantext() 728 108- the prime table is now computed once and for all on startup and can 729 no longer be increased by modifying primelimit: the dynamic forprime 730 machinery allows fast primes up to primelimit^2 which is more than 731 enough even with a small table. The default value of 500.000 is already 732 larger than necessary 733 109- removed the mechanism allowing prime gaps larger than 255 in the 734 prime table: as a result it now limited to 436273290, allowing fast 735 primes up to 1.9 10^17 736BA110- permtonum/numtoperm now use the standard lexicographic numbering 737 111- issquare(t_INTMOD), ispower(t_INTMOD): factor modulus incrementally, 738 in case we hit a local non-residue -> early abort [#1376] 739 112- gphelp + OS/X : make "open" the default PDF viewer (was "acroread") 740 113- renamed exp_Ir -> expIr 741 742 Added 743 1- mathnf for matrices over K[X] [#41] 744BA 2- GP function ellheegner 745BA 3- asm inline macro addllx8 for faster addition 746BA 4- Library function FpXQ_autpowers 747 5- GP default 'linewrap' 748 6- functions Fp_issquare, Fq_issquare. 749 7- GP function cmp [ universal comparison ] 750 8- library functions Fp_addmul, addmulii, addmulii_inplace, addmuliu, 751 addmuliu_inplace, lincombii, mulsubii, submulii, submuliu, 752 submuliu_inplace 753LGr 9- Catalan's constant [ Catalan() ] 754BA 10- library functions F2x_issquare/F2x_sqrt 755BA 11- [INSTALL] Documentation of RUNTEST 756 12- library function bestapprPade 757 13- library function gen_factored_order, Fp_factored_order 758 14- macros retmkvec, retmkvec2, retmkvec3, retmkvec4, retmkcol, retmkcol2, 759 retmkmat, retmkmat2, retmkintmod, retmkpolmod 760 retmkintmod, retmkpolmod, retconst_col, retconst_vec 761 15- allow Ser(t_VECSMALL) 762BA 16- library function gsprintf/gvsprintf 763BA 17- new PARI type t_ERROR (error messages) 764BA 18- new error trapping system and GP functions iferr,iferrname 765BA 19- implement lngamma(t_PADIC) 766LGr20- new PARI functions F2m_gauss, F2m_inv, F2m_rank, F2m_image, matid_F2m, 767 F2m_mul, F2m_F2c_mul 768BA 21- GP function getenv 769 22- new error class e_PRIME [ pari_err() ] 770BA 23- low-level function int_bit 771 24- library function stack_strcat 772 25- function polredbest [ adapting a preliminary patch by BA ] 773BA 26- library functions Fl_invsafe, F2x_halfgcd, Flx_Flxq_eval and Flx_FlxqV_eval. 774BA 27- support for sparse matrix and Wiedemann algorithm 775 28- GP function vecsearch() [ use with vecsort() ] 776BA 29- library function Z_issmooth 777BA 30- linear sieve algorithm for Fp_log/znlog 778BA 31- library functions Flx_to_FlxX, F2m_to_Flm, F2c_to_Flc, and Flxq_powu 779 32- GP function idealnumden() 780LGr33- library function uprecprime() 781 34- library function ZM_pivots() 782 35- library functions nm_Z_mul, ZM_togglesign, ZM_nm_mul [ to improve Zlm_gauss ] 783BA 36- [breakloop] GP functions dbg_up/dbg_down (like gdb up/down) 784 37- library functions rootsof1_Fp, rootsof1u_Fp, rootsof1_Fl 785BA 38- GP functions dbg_x (like \x) and dbg_err (current error data) 786 39- matconcat() 787BA 40- library functions Flm_Fl_add, Flm_invimage, FlxY_evalx 788BA 41- library functions Flx_ffisom, Flx_ffintersect, Flxq_ffisom_inv 789BA 42- library functions Flx_is_irred, Flx_is_smooth, F2x_is_irred 790BA 43- accessors functions for t_CLOSURE: closure_arity,closure_codestr,closure_get_* 791 44- library functions ZMs_ZC_mul, ZpMs_ZpCs_solve, gen_ZpM_Dixon 792BA 45- [breakloop] GP function breakpoint 793BA 46- GP function ffnbirred 794BA 47- cubic sieve algorithm for Flxq_log 795BA 48- library functions F2x_F2xqV_eval, F2x_F2xq_eval 796BA 49- forqfvec() 797BA 50- library functions FqM_image, FqM_rank, FpXQXQ_powers, FpXQXQ_matrix_pow 798BA 51- ellgroup(,,1): also return the generators 799BA 52- library functions FpVV_to_mod, FpE_changepoint, FpE_changepointinv 800BA 53- GP syntax [a..b] : [a,a+1,...,b] 801BA 54- GP syntax [a(x)|x<-b,c(x)] : apply(a,select(c,b)) 802BA 55- GP syntax M[a..b,^c] : vecextract(M,"a..b","^c") 803BA 56- library function FpE_log 804 57- select(f, v, 1) for indirect selection 805 58- hamming() function [initial implementation CG] 806 59- ispowerful() function 807 60- polgraeffe() function 808 61- functions poliscyclo(), poliscycloprod(), polcyclofactors() 809 62- function setbinop(f,X,Y) = { f(x,y), x in X, y in Y } 810 63- libpari function moebiusu() 811 64- sumdigits() function 812 65- libpari functions addiu, addui, subiu, subui, uissquare 813 66- randomprime() function. Allow random([a,b]) (return n, a <= n <= b) 814 67- ispolygonal() function 815 68- libpari functions uissquarefree, uposisfundamental, unegisfundamental 816 69- istotient() function 817 70- implement Haible/Papanikolaou binary splitting 818BA 71- PARI functions FlxqX_nbroots, FpXQX_nbroots, FpXQX_nbfact. 819BA 72- PARI function zv_search 820BA 73- GP syntax: multiif if(a==1,b,a==2,c,default). 821BA 74- GP syntax: multi assignement: [a,b,c]=V -> a=V[1];b=V[2];c=V[3] 822BA 75- PARI functions gen_gener, gen_ellgroup, gen_ellgens, gen_powers 823BA 76- FlxqE functions family (for elliptic curves over field of small characteristic>3) 824BA 77- PARI functions Flxq_sqrt, FpXQ_sqrt 825 78- bernpol() function 826 79- sumformal() function 827BA 80- PARI functions ZX_equal1, zvV_equal, ZXV_equal, FpXX_neg, FqX_neg 828BA 81- FpXQE functions family (for elliptic curves over field of large characteristic) 829BA 82- added GP function ellcard 830BA 83- PARI functions FpXQ_powu, Fq_powu, FpXX_mulu, Fq_mulu, Fq_div 831BA 84- PARI functions FqXQ_powers, FqXQ_matrix_pow, FqX_mulu, FqX_Fq_add 832BA 85- PARI functions FqXY_eval, FqXY_evalx, FpXY_Fq_evaly 833BA 86- SEA over non-prime finite field (for char p > 1000) 834LGr87- Add clock_gettime timer option 835 88- add new error type e_DOMAIN 836BA 89- Add black box finite fields for generic linear algebra 837BA 90- PARI functions FlxqM_image, FlxqM_ker, FqM_deplin 838BA 91- GP function ellneg 839BA 92- PARI functions Fp_ellcard, FpXQ_ellcard, Flxq_ellcard 840LGr93- vecmax / vecmin: add optional pointer argument (to hold index of a 841 largest/smallest entry) 842 94- printsep() function 843CG 95- isprimepower() function 844 96- PARI functions F2v_to_F2x, F2x_valrem, F2x_deflate, F2x_shift 845 97- PARI function RgV_polint 846BA 98- GP function digits 847 99- GP default 'sopath' [ rewritten from initial patch by GTo ] 848LGr100- allow polylog(n, t_SER) around a != 0 849BA 101- PARI functions ZX_shifti, ZX_remi2n, ZXV_remi2n 850 102- PARI functions cxexp1, mpsincos1 851BA 103- GP function ellfromj 852 103- GP function forcomposite 853 104- new error class e_PRIORITY [ pari_err() ] 854BA 105- Add black box algebra for Brent and Kung algorithm 855 106- PARI function RgM_dimensions() 856BA 107- PARI functions RgX_splitting(), Flx_splitting() 857 108- made public the CATCH / TRY interface, renamed pari_CATCH / pari_TRY 858 PARI functions err_get_num(), err_get_compo(), pari_err_last() 859 109- PARI function stack_sprintf() 860 110- PARI function RgX_is_QX() 861BA 111- PARI functions retmkmat2,retmkcol2,mkmat2,mkcol2,mkcols,mkcol2s et al. 862BA 112- PARI functions ZXV_dotproduct(), ZXX_Z_divexact() 863BA 113- PARI function gen_ZpX_Newton() 864 114- optional argument to contfracpnqn: return all convergents up to 865 p_n/q_n, not only the last 2 866BA 115- PARI functions Flxq_autpow, F2xq_autpow 867BA 116- PARI functions FpX_divrem_Barrett and unconditional FpX_rem_Barrett 868BA 117- PARI functions F2xq_sqrt_fast, Flxq_lroot, Flxq_lroot_fast 869BA 118- PARI functions FlxqV_dotproduct, FlxV_red 870BA 119- PARI functions ZpXQ_inv, ZpXQ_invlift, ZpXQ_log 871 120- PARI functions absi_shallow, mpabs_shallow, absfrac_shallow, 872 Q_abs_shallow 873BA 121- PARI functions FlxX_Flx_add, FlxX_Fl_mul, FlxX_Flx_mul, FlxX_neg 874BA 122- PARI functions Fp_ellj, FpXQ_ellj, Flxq_ellj 875BA 123- PARI functions FpX_mulu, Flx_mulu, ZX_mulu 876BA 124- PARI functions FlxqXQV_autpow, FlxqXQV_autsum 877BA 125- PARI functions FpXQXQV_autpow, FpXQXQV_autsum 878BA 126- PARI functions FpXT_red, FlxT_red, ZXT_to_FlxT, ZXT_remi2n 879BA 127- Support for preconditionned reduction in FpXQ/Flxq 880 128- PARI functions padic_to_Q, padic_to_Q_shallow, QpV_to_QV, Q_pvalrem, 881 ZX_Zp_root, Zp_appr, Fp_muls, retmkfrac 882BA 129- Add safegel et al. for GP2C -C option 883HC 130- Function sqrtnint 884 131- sumdivmult() to sum multiplicative functions 885 132- ?? online help: allow searching labels, e.g. ??"se:priority"@ 886 133- PARI function ZpM_echelon, zlm_echelon 887 134- GP functions matqr and mathouseholder, PARI functions QR_init, 888 QgM_QR_init, gaussred_from_QR, R_from_QR, gtomp, RgC_gtomp, RgM_gtomp 889 135- PARI functions trivial_fact, prime_fact 890 136- PARI function rfrac_to_ser 891 137- PARI functions padic_lindep, Xadic_lindep 892 138- GP function seralgdep 893BA 139- arm, mips and mips64 level0 inline assembly kernel 894 140- new error class e_COMPONENT 895 141- PARI functions init_primepointer_geq, init_primepointer_gt, 896 init_primepointer_leq, init_primepointer_lt 897BA 142- new default strictargs for mandatory arguments 898 143- GP function nfcertify 899 144- GP function ellchangepointinv 900 145- optional 'variable' argument to polresultantext() 901 146- export part of the ifac_* interface (ifact_start, ifact_next, 902 ifac_read, ifac_skip, ifac_isprime) 903 147- PARI function expIxy 904 148- poor man's graphic engine 'plotps' (Configure --graphic=ps) when 905 no graphic library is available; dumps the hi-res plot to a temporary 906 PostScript file, then opens a PostScript viewer ('open -W' by default, 907 $GP_POSTSCRIPT_VIEWER otherwise). Works around #1354 on OS/X. 908PMo149- GP function lambertw / library functions mplambertW, glambertW 909 910 Removed 911 1- dropped DOS support 912 2- qfrep(): bit 2 of flag is now meaningless, we now always return a 913 t_VECSMALL 914 3- file language/errmsg.c and global errmessage[] array: all error 915 messages are now part of pari_err_display()) 916 4- error types arither1,mattype1,notpoler (merged with typeer), matinv1 917 (merged with gdiver) 918 5- legacy lindep and PSLQ implementations [algdep/lindep with 919 negative flags]: now use LLL in all cases. 920BA 6- [libpari] removed unusable functions dbg_close/dbg_release. 921 7- [libpari] gisfundamental, gkronecker, gbigomega, geulerphi, 922 gissquarefree, gmoebius, gnextprime, gnumbdiv, gomega, gprecprime, 923 gsumdiv, gdumdivk, znprimroot0 924 8- ellsigma: flags 3 and 4 [ inefficient algorithm using the product 925 formula ] 926 9- Member function 'w' (this is technical, and no longer needed:-) 927 10- obsolete function weipell(). Use ellwpseries() 928 11- [libpari] obsolete function Polred. Use polredbest 929 12- old logo misc/pari.xpm, see http://pari.math.u-bordeaux1.fr/logo.html 930