Wiki
Research notes on every problem, and a library of the papers behind them. Built from the open erdos repository.
Updated
Claim. Theorem 1.1 of A. J. Irving, The largest prime factor of , states: let and let be sufficiently large; then for at least a positive proportion of the integers , has a prime factor exceeding . For this gives for all large , in the notation of Problem 976. It improves the exponent of Heath-Brown's 2001 theorem.
Covers. The first question for . It does not give .
Depends on. No page of this wiki.
Acceptance. Refereed: Acta Arithmetica 171 (2015), no. 1, 67--80. The site labels the problem OPEN.
Linked from (2)
Graph