| Age | Commit message (Expand) | Author |
|---|
| 2020-05-05 | math/big: add (*Int).FillBytes | Filippo Valsorda |
| 2019-11-12 | math/big: implement recursive algorithm for division | Rémy Oudompheng |
| 2019-11-07 | math/big: allow all values for GCD | Brian Kessler |
| 2019-08-28 | math/big: fast path for Cmp if same | Illya Yalovyy |
| 2019-04-04 | math/big: do not panic in Exp when y < 0 and x doesn't have an inverse | Filippo Valsorda |
| 2019-03-12 | math/big: implement Int.TrailingZeroBits | Brian Kessler |
| 2019-02-27 | math/big: handle alias of cofactor inputs in GCD | Brian Kessler |
| 2018-08-22 | math/big: streamline divLarge initialization | Brian Kessler |
| 2018-06-14 | math/big: handle negative exponents in Exp | Brian Kessler |
| 2018-05-30 | math/big: implement Atkin's ModSqrt for 5 mod 8 primes | Brian Kessler |
| 2018-05-08 | math/big: implement Lehmer's extended GCD algorithm | Brian Kessler |
| 2018-05-01 | math/big: handle negative moduli in ModInverse | Brian Kessler |
| 2018-04-30 | math/big: return nil for nonexistent ModInverse | Brian Kessler |
| 2017-11-30 | math/big: protect against aliasing in nat.divLarge | Alberto Donizetti |
| 2017-11-01 | math/big: implement CmpAbs | griesemer |
| 2017-10-24 | math/big: implement Lehmer's GCD algorithm | Brian Kessler |
| 2017-10-16 | math/big: fix ModSqrt optimized path for x = z | Filippo Valsorda |
| 2017-08-16 | math/big: recognize z.Mul(x, x) as squaring of x | Brian Kessler |
| 2017-04-03 | all: fix minor misspellings | Eric Lagergren |
| 2017-02-07 | math/big: add IsInt64/IsUint64 predicates | Robert Griesemer |
| 2016-10-17 | math/big: add (*Int).Sqrt | Russ Cox |
| 2016-10-11 | math/big: move ProbablyPrime into its own source file | Russ Cox |
| 2016-10-11 | math/big: test and optimize Exp(2, y, n) for large y, odd n | Russ Cox |
| 2016-10-10 | math/big: make division faster | Russ Cox |
| 2016-09-27 | math/big: support negative numbers in ModInverse | Michal Bohuslávek |
| 2016-09-14 | math/big: cut 2 minutes off race tests | Brad Fitzpatrick |
| 2016-01-13 | math/big: fix Exp(x, x, x) for certain large x | Russ Cox |
| 2015-12-29 | build: shorten a few packages with long tests | Russ Cox |
| 2015-12-16 | math/big: additional Montgomery cleanup | Russ Cox |
| 2015-10-03 | math/big: check return value from quick.Check() for GCD tests | Damian Gryski |
| 2015-09-25 | math/big: move Int/Rat gob/json/xml functionality in separate files | Robert Griesemer |
| 2015-08-29 | math/big: use optimized formula in ModSqrt for 3 mod 4 primes | David Leon Gil |
| 2015-08-21 | math/big: fix TestBytes test | Robert Griesemer |
| 2015-07-11 | all: link to https instead of http | Brad Fitzpatrick |
| 2015-06-19 | math/big: fix GCD in presence of aliasing | Robert Griesemer |
| 2015-04-30 | math/big: add modular square-root and Jacobi functions | Bryan Ford |
| 2015-04-07 | math/big: fix Exp when exponent is 1 | ALTree |
| 2015-04-01 | math/big: faster Int.Binomial(n, k) for k > n/2 | Robert Griesemer |
| 2015-03-27 | math/big: fix copy-paste mistake in int_test.go | Jeremy Schlatter |
| 2015-02-25 | math/big: apply a round of go vet | Robert Griesemer |
| 2015-02-06 | all: don't refer to code.google.com/p/go{,-wiki}/ | Péter Surányi |
| 2015-01-30 | math/big: split int conversion routines and tests into separate files | Robert Griesemer |
| 2015-01-20 | math/big: permit internal nat.scan to accept decimal point | Robert Griesemer |
| 2015-01-20 | math/big: better test coverage, misc. cleanups | Robert Griesemer |
| 2015-01-16 | math/big: bug in AndNot(x,y) for x>0,y<0. | Keith Randall |
| 2015-01-05 | math/big: panic if n <= 0 for ProbablyPrime | Shenghou Ma |
| 2014-10-14 | math/big: Allow non-prime modulus for ModInverse | Keith Randall |
| 2014-10-02 | math/big: math.Exp should return result >= 0 for |m| > 0 | Robert Griesemer |
| 2014-09-08 | build: move package sources from src/pkg to src | Russ Cox |
