108 citations · 814 across the 70 of their papers we have counts for
Showing 2019 · math.NTShow all
3 papers · 2 filters
math.NT2019★ 3 cited
A lower bound on the LCM of polynomial sequences
James Maynard, Zeev Rudnick
Let be a polynomial of degree with integer coefficients which is irreducible over the rationals. Cilleruelo conjectured that the least common multiple of the value…
math.NT2019
Gaussian primes in almost all narrow sectors
Bingrong Huang, Jianya Liu, Zeév Rudnick
We study Gaussian primes lying in narrow sectors, and show that almost all such sectors contain the expected number of primes, if the sectors are not too narrow.
math.NT2019
On Cilleruelo's conjecture for the least common multiple of polynomial sequences
Zeév Rudnick, Sa'ar Zehavi
A conjecture due to Cilleruelo states that for an irreducible polynomial with integer coefficients of degree , the least common multiple of the sequence $f(1)…