The largest prime factor of an irreducible cubic polynomial
Ivan Ermoshin

TL;DR
This paper generalizes Heath-Brown's result on large prime factors of integers of the form n^3+2 to all monic irreducible cubic polynomials, establishing that a positive proportion of such values have large prime factors.
Contribution
It extends Heath-Brown's theorem from the specific polynomial n^3+2 to all monic irreducible cubic polynomials, introducing polynomial-dependent exponents.
Findings
Positive proportion of polynomial values have large prime factors
Generalization from specific to all monic irreducible cubics
Introduction of polynomial-dependent exponent c_p
Abstract
Heath-Brown proved that for a positive proportion of integers , has a prime factor larger than with . We generalize this result to arbitrary monic irreducible cubic polynomial of with replaced by an exponent dependent on the polynomial.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAnalytic Number Theory Research · Mathematical Dynamics and Fractals · Algebraic Geometry and Number Theory
