Asymptotic sieve for primes
Abstract
This article develops a new sieve method which by adding an additional axiom to the classical formulation breaks the well-known parity problem and allows one to detect primes in thin, interesting integer sequences. In the accompanying paper [math.NT/9811184] the practicality of the axiom is demonstrated by verifying it (and the other axioms) to produce primes in the sequence a2+b4 with the relevant asymptotics.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.