Almost primes and primes that are sums of two squares plus one
Abstract
In this paper, we obtain a lower bound for the number of primes p≤ x such that p-1 is a sum of two squares and p+2 has a bounded number of prime factors. The proof uses the vector sieve framework, involving a semi-linear sieve and a linear sieve.
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.