---

Claim. The unnumbered main theorem of Ivan Ermoshin, The Largest Prime Factor of an Irreducible Cubic Polynomial (arXiv:2602.03642, v3 of 12 June 2026, p. 3), states that for every monic irreducible cubic $f\in\mathbb Z[X]$ there is $c_f>0$ such that, as $x\to\infty$, a positive proportion of the integers $m\in[x,2x]$ have a prime factor of $f(m)$ exceeding $x^{1+c_f}$; in particular $P^+\!\left(\prod_{m\le x}f(m)\right)\gg_f x^{1+c_f}$, which is $F_f(n)\gg_f n^{1+c_f}$ in the notation of Problem 976. The statement is recorded on the theorem card.

Covers. The first question for monic irreducible cubics. It gives no exponent uniform in $f$ and does not give $F_f(n)\gg n^3$.

Depends on. No page of this wiki.

Standing. An arXiv preprint, first posted on 3 February 2026, with no journal publication recorded. The site labels the problem OPEN.