Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 134 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 22 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 60 tok/s Pro
Kimi K2 192 tok/s Pro
GPT OSS 120B 427 tok/s Pro
Claude Sonnet 4.5 37 tok/s Pro
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.

Summary

We haven't generated a summary for this paper yet.

Dice Question Streamline Icon: https://streamlinehq.com

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.