On the greatest prime factor of for a prime p and other expressions
There exist infinitely many integers such that the greatest prime factor of is at least . The proof is a combination of Hooley’s method – for reducing the problem to the evaluation of Kloosterman sums – and the majorization of Kloosterman sums on average due to the authors.