2 papers
cs.DS2010★ 4 cited
An O(M(n) log n) algorithm for the Jacobi symbol
Richard P. Brent, Paul Zimmermann
The best known algorithm to compute the Jacobi symbol of two n-bit integers runs in time O(M(n) log n), using Schönhage's fast continued fraction algorithm combined with an identit…
math.NT2010★ 2 cited
The great trinomial hunt
Richard P. Brent, Paul Zimmermann
We describe a search for primitive trinomials of high degree and its interaction with the Great Internet Mersenne prime search (GIMPS). The search is complete for trinomials whose…