8 citations · 16 across the 7 of their papers we have counts for
9 papers
An Efficient Modular Exponentiation Proof Scheme
Darren Li, Yves Gallot
We present an efficient proof scheme for any instance of left-to-right modular exponentiation, used in many computational tests for primality. Specifically, we show that for any $(…
Addendum to the paper: "Artin Prime Producing Quadratics" [Abh. Math. Sem. Univ. Hamburg 77 (2007), 109--127; MR2379332 (2008m:11194)] by P. Moree
Yves Gallot, Pieter Moree
Can one find an integer and a polynomial , such that is a primitive root for many consecutive (different) prime values assumed by ? Moree considered this problem in 2…
Sister Beiter and Kloosterman: a tale of cyclotomic coefficients and modular inverses
Cristian Cobeli, Yves Gallot, Pieter Moree +1
For a fixed prime , the maximum coefficient (in absolute value) of the cyclotomic polynomial , where and are free primes satisfying exists. Si…
The family of ternary cyclotomic polynomials with one free prime
Yves Gallot, Pieter Moree, Robert Wilms
A cyclotomic polynomial Φ_n(x) is said to be ternary if n=pqr with p,q and r distinct odd primes. Ternary cyclotomic polynomials are the simplest ones for which the behaviour of th…
The Erdős--Moser equation revisited using continued fractions
Yves Gallot, Pieter Moree, Wadim Zudilin
If the equation of the title has an integer solution with , then . This was the current best result and proved using a method due to L. Moser (1953). Th…
Neighboring ternary cyclotomic coefficients differ by at most one
Yves Gallot, Pieter Moree
A cyclotomic polynomial Phi_n(x) is said to be ternary if n=pqr with p,q and r distinct odd prime factors. Ternary cyclotomic polynomials are the simplest ones for which the behavi…