Papers › An elementary heuristic for Hardy-Littlewood extended Goldbach's conjecture
An elementary heuristic for Hardy-Littlewood extended Goldbach's conjecture
Christian Táfula
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
The goal of this paper is to describe an elementary combinatorial heuristic that predicts Hardy and Littlewood's extended Goldbach's conjecture. We examine common features of other heuristics in additive prime number theory, such as Cram\'er's model and density-type arguments, both of which our heuristic draws from. Apart from the prime number theorem, our argument is entirely elementary, in the sense of not involving complex analysis. The idea is to model sums of two primes by a hypergeometric probability distribution, and then draw heuristic conclusions from its concentration behavior, which follows from Hoeffding-type bounds.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections