Almost primes and primes that are sums of two squares plus one

2025/01/28 by Nath, Kunjakanan, Xie, Likun
#11N05 #11N35 #11N36 #FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.2501.16723

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.

Related

• Almost primes between all squares
• Sums of Consecutive Prime Squares
• A THREE SQUARES THEOREM WITH ALMOST PRIMES
• An Explicit Result for the Sum of Two Almost Primes
• Almost prime triples and Chen's Theorem