Abstract
Let N m ( x) be the number of arithmetic progressions that consist of m terms, all primes and not larger than x, and set F m(x) = C mx 2 log mx ( C m explicitly given). It is shown that Hardy and Littlewood's prime k-tuple conjecture implies that N m ( x) = F m ( x){1 + Σ j=1 N a j log − j x + O((log x) − N−1 )}, (here the bracket represents an asymptotic series with explicitly computable coefficients). This formula holds rather trivially for m = 1 and m = 2. It is proved here for m = 3, by the Vinogradov version of the Hardy-Ramanujan-Littlewood circle method.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
