On the greatest prime factor and uniform equidistribution of quadratic polynomials
arXiv:2505.00493
Abstract
We show that the greatest prime factor of is at least infinitely often. This gives an unconditional proof for the range previously known under the Selberg eigenvalue conjecture. Furthermore, we get uniformity in under a natural hypothesis on real characters. The same uniformity is obtained for the equidistribution of the roots of quadratic congruences modulo primes. We also prove a variant of the divisor problem for , which was used by the second author to give a conditional result about primes of that shape.
v2: minor corrections