Goldbach Comet
Goldbach’s conjecture says every even number above 2 is a sum of two primes. The Goldbach comet plots, for each even number n, how many such prime pairs it has — the Goldbach function g(n). The points spray out into a comet with dense bands, and colouring by n’s residues mod small primes splits the comet into the famous streaks. This tool computes g(n) up to a limit you choose and draws the scatter, a live illustration of a conjecture still unproven after nearly three centuries.
Runs 100% in your browser — simulations are computed locally on your device.
Read the full guide to this tool
Notes
- g(n) counts the unordered pairs of primes p ≤ q with p + q = n.
- The comet’s separate bands come from n’s divisibility by small primes like 3 and 5.
- g(n) trends upward and never hit zero in any computer search, but Goldbach’s conjecture is still unproven.
- Runs 100% in your browser — simulations are computed locally on your device.