Enter a top row of numbers; each row below is the sequence of absolute differences of the row above, so an N-term top row generates a triangular array. Gilbreath’s conjecture (Proth 1878, Gilbreath 1958) asserts that when the top row is the primes, the left edge below the first row is entirely 1s. Build the array from primes, prime gaps, a single spike, or the random models studied in the paper; colour it by parity or magnitude; toggle the live left-diagonal check; and view large arrays on a canvas.
A visual companion to the paper “Gilbreath’s conjecture: a Cramér random model and a deterministic analysis” (Zachary Chase, Zach Hunter, Terence Tao) — arXiv preprint · blog discussion. Runs entirely in your browser.