Recent Issues
Volume 15, Issue 3
Volume 15, Issue 2
Volume 15, Issue 1
Volume 14, Issue 3-4
Volume 14, Issue 2
Volume 14, Issue 1
Volume 13, Issue 4
Volume 13, Issue 3
Volume 13, Issue 2
Volume 13, Issue 1
Volume 12, Issue 4
Volume 12, Issue 3
Volume 12, Issue 2
Volume 12, Issue 1
Volume 11, Issue 4
Volume 11, Issue 3
Volume 11, Issue 2
Volume 11, Issue 1
Volume 10, Issue 4
Volume 10, Issue 3
Volume 10, Issue 2
Volume 10, Issue 1
Volume 9, Issue 4
Volume 9, Issue 3
Volume 9, Issue 2
Volume 9, Issue 1
Volume 8, Issue 4
Volume 8, Issue 3
Volume 8, Issue 2
Volume 8, Issue 1
Older Issues
Volume 7, Issue 4
Volume 7, Issue 3
Volume 7, Issue 2
Volume 7, Issue 1
Volume 6, Issue 4
Volume 6, Issue 2-3
Volume 6, Issue 1
Volume 5, Issue 4
Volume 5, Issue 3
Volume 5, Issue 1-2
Volume 4, Issue 4
Volume 4, Issue 3
Volume 4, Issue 2
Volume 4, Issue 1
Volume 3, Issue 3-4
Volume 3, Issue 2
Volume 3, Issue 1
Volume 2, Issue 4
Volume 2, Issue 3
Volume 2, Issue 2
Volume 2, Issue 1
Volume 1, Issue 4
Volume 1, Issue 3
Volume 1, Issue 2
Volume 1, Issue 1
Abstract
Heath-Brown proved that, for a positive proportion of integers
n ,
n 3
+ 2 has a prime
factor larger than
n 1 + c
with
c
= 1 0 − 3 0 3 .
We generalize this result to arbitrary monic irreducible cubic polynomials of
ℤ [ x ] with
c replaced by
an exponent
c p
dependent on the polynomial.
Keywords
irreducible polynomial with positive leading coefficient,
prime, largest prime divisor, cubic, polynomial,
Chebyshev's problem, largest prime factors in polynomial
sequences, sieve
Mathematical Subject Classification
Primary: 11N32
Milestones
Received: 3 February 2026
Revised: 12 June 2026
Accepted: 14 July 2026
Published: 16 October 2026
© 2026 MSP (Mathematical Sciences
Publishers).