On Selberg's approximation to the twin prime problem

DOI10.4064/AA8558-3-2017MaRDI QIDQ5348036zbMATH OpenOpenAlexFDO

Authors R. Balasubramanian, Priyamvad Srivastav

Publication date 11 August 2017

Published in Acta Arithmetica (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1504.04347

zbMATH Keywords

almost primesSelberg sieve

Mathematics Subject Classification ID

Distribution of primes (11N05) Applications of sieve methods (11N36) Asymptotic results on arithmetic functions (11N37)

Abstract: In his Classical approximation to the Twin prime problem, Selberg proved that for $x$ sufficiently large, there is an $nin(x,2x)$ such that $2^{Omega(n)}+2^{Omega(n+2)}leqlambda$ with $lambda=14$, where $Omega(n)$ is the number of prime factors of $n$ counted with multiplicity. This enabled him to show that for infinitely many $n$, $n(n+2)$ has atmost $5$ prime factors, with one having atmost $2$ and the other having atmost $3$ prime factors. By adopting Selberg's approach and using a refinement suggested by Selberg, we improve this value of $lambda$ to about $lambda=12.59$.

Recommendations

• scientific article; zbMATH DE number 4116641
• The weighted linear sieve and Selberg's λ^2-method
• On the prime twins problem
• On the upper bound for π₂(x)
• scientific article; zbMATH DE number 1944010

Cited in

(4)

• Sieving for twin smooth integers with solutions to the Prouhet-Tarry-Escott problem
• On twin primes associated with the Hawkins random sieve
• Twin primes via exceptional characters
• Some numerical results in the Selberg sieve method

This page was built for publication: On Selberg's approximation to the twin prime problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5348036)