KnowraGoldbach's conjectureLinked fromLinked fromThe 13 pages that link to Goldbach's conjecture, each with the reason it gives.All 13Broader topic 2Related 9Narrower topic 1Compared with 1Number theoryBroader topic: It poses a simple question about additive patterns in primes that remains unproved.Sieve theoryRelated: Sieve methods yield near-results, including representations with an almost-prime summand.Analytic number theoryRelated: Analytic techniques prove broad partial results, but the full assertion remains open.Twin prime conjectureCompared with: It is another famous unresolved conjecture about additive patterns among primes.Additive number theoryRelated: It is the best-known unresolved question about representing integers by primes.Circle methodRelated: Hardy's and Littlewood's circle-method framework produced influential conditional estimates for prime representations.Hardy–Littlewood circle methodRelated: The circle method gives asymptotic results for related prime sums, though not a proof of the binary conjecture.Hardy–Littlewood conjecturesRelated: Hardy and Littlewood used their framework to predict asymptotics for Goldbach representations.Waring's problemRelated: It is a parallel additive problem with primes replacing powers.Mathematical conjectureBroader topic: Extensive computational checks have not yet supplied a general proof.Vinogradov's theoremNarrower topic: Vinogradov's theorem proves the analogous three-prime statement for sufficiently large odd integers.Goldbach–Euler theoremRelated: This is the standard modern name for the Goldbach–Euler theorem.Lemoine's conjectureRelated: It is a closely related additive prime conjecture with a different parity pattern.