Goldbach Conjecture Verifier
Split an even number into two primes, with the first three pairs listed and an odd input refused outright.
Goldbach Conjecture Verifier
Split an even number into two primes, with the first three pairs listed and an odd input refused outright.
How this page computes
Primality is decided by trial division to the square root, which is instant for candidates below ten million. That bound is a performance ceiling, not a limit of the conjecture.
The calculation runs entirely in this browser tab; nothing is uploaded.
The page finds pairs of primes that sum to an even number and prints the smallest prime first. 28 is 5 plus 23, and the page also lists 11 plus 17 so the decomposition is not presented as unique.
Goldbach's conjecture says every even number above 2 has such a pair. The page verifies one number at a time up to ten million; an odd input is refused, because the conjecture is stated for even numbers.
How to use the Goldbach Conjecture Verifier
Enter one even whole number and press Run. The first line gives the pair with the smallest first prime, and a second line lists up to two more pairs.
The page refuses an odd number, a value below 4 and a value above ten million. Each refusal names the rule so the next attempt can be correct.
The rule this page applies
A Goldbach pair is two primes whose sum is the given even number. The page tests candidates from 2 upward and checks both members of the pair for primality, so the first pair it prints really is the smallest.
Primality is decided by trial division to the square root, which is instant for candidates below ten million. That bound is a performance ceiling, not a limit of the conjecture.
What to Expect
Best for
- Verifying one even number quickly
- Seeing that a decomposition is not unique
- Checking a small case of the conjecture
Not ideal for
- Proving the conjecture
- Numbers above ten million
- Odd numbers, which the page refuses
What this tool keeps
- The even number and its exact prime pairs
What may need cleanup
- Nothing: the pairs are exact primes
Common errors
- An odd number is refused, because the conjecture concerns even numbers
- A value below 4 is refused, because the smallest pair is 2 plus 2
Example use cases
- Decompose 28
- Show that 100 has several pairs
Sample input
28
Sample output
28 = 5 + 23 also: 11 + 17
Who this is for
- Students meeting the conjecture
- Readers checking a decomposition by hand
Frequently asked questions
Is the decomposition unique?
No. 28 is 5 plus 23 and also 11 plus 17, so the page prints the first pair plus up to two more. A single pair would suggest a uniqueness the conjecture does not claim.
Why is 4 allowed?
4 is the smallest even number that is a sum of two primes, namely 2 plus 2. The page therefore starts at 4 and refuses 2, which has no such decomposition.
Does this verify the conjecture?
No. It verifies one even number at a time up to ten million. The conjecture itself is unproved, and the page never claims otherwise.
Is anything uploaded?
Nothing is uploaded. The numbers are read and the arithmetic runs in this browser tab with JavaScript, and reloading the page discards both the input and the result.
Build custom tools for your store
Join the SDK program to create useful ecommerce utilities for your store.