A Positive Lower Bound for the Sum of Log-Reciprocal Twin Prime Products via Weighted Sieve

2025/11/17 by Chenghui Ren, Ren, Chenghui
Computer Science · Mathematics · #11A41 #11B83 #11N35 #Algebraic Geometry and Number Theory #Analytic Number Theory Research #Cryptography and Residue Arithmetic #FOS: Mathematics #Number Theory (math.NT)

paper · pdf · doi:10.48550/arxiv.2511.12944

openalex publication_date 2025/11/17 · openalex created_date 2025/11/19 · openalex updated_date 2026/08/02

Abstract

The twin prime conjecture asserts that there are infinitely many pairs of primes that differ by two. While recent advances have improved our understanding of bounded prime gaps, the conjecture remains unresolved. This paper refines the weighted sieve method to estimate a sum over twin prime pairs, where each term is of the form \((1/p)(log(x^α/p))^k\). We establish a strict positive lower bound for this sum, which implies the infinitude of twin prime pairs.

Related

• A Sieve for Twin Primes
• Sieve methods and the twin prime conjecture
• Twin Prime Sieve
• A proof of the strong twin prime conjecture
• A Constructive Heuristic Sieve for the Twin Prime Problem