A Simple Heuristic Proof of Hardy and Littlewood's Conjecture B

DOI10.2307/2324298MaRDI QIDQ3139915zbMATH OpenOpenAlexWikidataFDO

Authors Michael O. Rubinstein

Publication date 26 April 1994

Published in The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL https://doi.org/10.2307/2324298

zbMATH Keywords

twin primesHardy-Littlewood formulaheuristic arguments

Mathematics Subject Classification ID

Goldbach-type theorems; other additive questions involving primes (11P32) Primes (11A41)

Recommendations

• Preuve d'une conjecture de Hardy et Littlewood
• scientific article; zbMATH DE number 549093
• A simple proof of the Bieberbach conjecture
• scientific article; zbMATH DE number 579569
• An elementary heuristic for Hardy-Littlewood extended Goldbach's conjecture
• A generalization of the Hardy-Littlewood conjecture
• An application of the Hardy-Littlewood conjecture
• A proof of the Bieberbach conjecture
• The Hardy-Littlewood conjecture. An algebraic approach
• The Hardy-Littlewood conjecture. An algebraic approach

Cited in

(8)

• Average prime-pair counting formula
• Ramanujan-Fourier series and the conjecture D of Hardy and Littlewood.
• scientific article; zbMATH DE number 1943105 (Why is no real title available?)
• scientific article; zbMATH DE number 3995801 (Why is no real title available?)
• A simple proof that the \((n^{2} - 1)\)-puzzle is hard
• Golomb's -calculus and the Bateman-Horn conjecture
• Twin prime statistics
• Distribution of twin primes in the set of natural numbers

This page was built for publication: A Simple Heuristic Proof of Hardy and Littlewood's Conjecture B

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