2000 character limit reached
Almost-Primes Represented by Quadratic Polynomials (1910.02885v1)
Published 26 Sep 2019 in math.NT
Abstract: In his paper Almost-Primes Represented by Quadratic Polynomials, Iwaniec proved that the polynomial n2 + 1 takes on values with at most two prime factors (counted with multiplicity) infinitely often. He states that "in order to avoid technical complications, we shall restrict our proof to the polynomial n2 + 1.". In this exposition, we follow Iwaniec's proof and show that for any irreducible quadratic polynomial G(n) (satisfying some obviously necessary hypotheses), G(n) has at most two prime factors for infinitely many values of n.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.