Some numerical implications of the Hardy and Littlewood analysis of the 3-primes problem

DOI10.1023/A:1009821519507zbMath0944.11032OpenAlexW185987795MaRDI QIDQ1124966

Gove Effinger

Publication date: 19 September 2000

Published in: The Ramanujan Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1009821519507

zbMATH Keywords

numericsHardy-Littlewood circle methodVinogradov methodJFM 48.0143.04three primes problem

Mathematics Subject Classification ID

Goldbach-type theorems; other additive questions involving primes (11P32) Applications of the Hardy-Littlewood method (11P55) Software, source code, etc. for problems pertaining to number theory (11-04)

Related Items (2)

Computers as a novel mathematical reality. IV: The Goldbach problem ⋮ A complete Vinogradov 3-primes theorem under the Riemann hypothesis

This page was built for publication: Some numerical implications of the Hardy and Littlewood analysis of the 3-primes problem