|
Try GP in your browser Main Download Packages Funding SEARCH Help / Community FAQ Documentation Tutorials Mailing Lists Bugs Timeline Ateliers PARI/GP Library Publications Contributed GP scripts Links Fun! Development Latest Changes Version Control Coding Guidelines PariDroid Logo Tests & benchmarks Buildlogs Coverage Report Doc Coverage Refcards test Benchmarks WWW Stats |
Changes commited to PARI GIT during the last two weekse5d817ee12 | Bill Allombert | Wed, 7 Jan 2026 23:44:47 +0100 Doc: polclass: missing leading space 1 1 src/functions/polynomials/polclass c72b2decfc | Bill Allombert | Tue, 6 Jan 2026 23:40:52 +0100 bnfinit: improve rnd_rel (missing chunk 2) 1 1 src/basemath/buch2.c 660848baa4 | Bill Allombert | Tue, 6 Jan 2026 22:14:33 +0100 bnfinit: improve rnd_rel (missing chunk) 7 7 src/basemath/buch2.c 812dd05845 | Karim Belabas | Tue, 6 Jan 2026 01:12:53 +0100 document bnr_sanitize + use one more time 1 0 CHANGES 5 0 doc/usersch6.tex 1 1 src/basemath/buch3.c bbb75e9497 | Karim Belabas | Mon, 5 Jan 2026 03:20:26 +0100 refactor (and simplify) a bnr_sanitize function 12 4 src/basemath/buch3.c 1 2 src/basemath/kummer.c 1 0 src/headers/paridecl.h 71f0fa63a1 | Karim Belabas | Mon, 5 Jan 2026 02:09:32 +0100 bnrclassfieldvec: missing check for variable priority [#2658] 9 3 src/basemath/kummer.c 6 3 src/test/32/bnrclassfield 3 1 src/test/in/bnrclassfield 8c72ccb5e4 | Karim Belabas | Mon, 5 Jan 2026 01:47:42 +0100 bnr_vecchar_sanitize: remove useless and misleading bnrc = bnr initialization bnrc is recomputed anyway later. And it better be since bnr could be a yet unsanitized bnf. 1 1 src/basemath/buch3.c dc49c45655 | Karim Belabas | Mon, 5 Jan 2026 00:29:47 +0100 fix comment 2 2 src/basemath/ifactor1.c 7789a77f07 | Bill Allombert | Sun, 4 Jan 2026 17:12:19 +0100 bnfinit: improve rnd_rel by allowing to change test modulus 47 34 src/basemath/buch2.c 1 1 src/functions/number_fields/bnfinit 1 1 src/headers/paripriv.h 2 2 src/test/32/bnf 1 1 src/test/in/bnr a3cd9a95e8 | Karim Belabas | Sat, 3 Jan 2026 13:20:20 +0100 quadunitnorm: avoid full factorization of D if possible 84 0 src/basemath/ifactor1.c 2 14 src/basemath/quad.c 1 0 src/headers/paridecl.h 9dde311de8 | Karim Belabas | Sat, 3 Jan 2026 11:02:39 +0100 improve comments 2 1 src/basemath/ifactor1.c f48aaf3b76 | Karim Belabas | Sat, 3 Jan 2026 10:59:10 +0100 moebius, ispowerful: avoid duplicate trial division by 3,5,7 3 3 src/basemath/ifactor1.c 30cd175d91 | Karim Belabas | Fri, 2 Jan 2026 23:56:19 +0100 quadunitnorm: test for prime divisor = 3 mod 4 [#2657] Then norm is +1. We can factor D (at a subexponential cost): the naive continued fraction expansion is much more costly, in O~(D^(1/2)) 14 0 src/basemath/quad.c 2 1 src/test/32/quadclassunit 1 0 src/test/in/quadclassunit c914ee0c77 | Karim Belabas | Fri, 2 Jan 2026 11:44:27 +0100 bnf_increase_LIMC(LIMC, D): allow answer> D Primes of norm <= D generate Cl(K) under GRH. Nevertheless, the index calculus algorithm may fail when the bound is too small (for instance because the sub factorbase for random relations has a single element). Useful for small discriminints, e.g., setrand(40567);bnf=bnfinit(x^2-x-1) (oo loop) 12 10 src/basemath/buch1.c 3 0 src/test/in/bnf f14e077362 | Karim Belabas | Tue, 30 Dec 2025 14:39:01 +0100 subFB_change: don't shadow the 'l' variable in internal loops Functionally equivalent to previous code 2 6 src/basemath/buch2.c 01bb95f8b7 | Karim Belabas | Mon, 29 Dec 2025 23:59:54 +0100 fix documentation for factor over Q(i) [#2654] factors are ordered by increasing imaginary part 5 4 src/functions/number_theoretical/factor 5afb5f96cd | Karim Belabas | Mon, 29 Dec 2025 17:45:59 +0100 fix comment 1 1 src/basemath/buch1.c |
PARI/GP Development
Last Modified: 2025-11-17 10:46:31
Copyleft © 2003-2025
the PARI group.