Triangular and Fibonacci Running Equality Expressions Generator
Created by Inder J. Taneja
Searches for identities where the digits 1–9 (ascending), 9–1 (descending), or 9–0 (descending through zero) each
appear exactly once, in strict order, split across an equals sign into two sides that evaluate to the same value k.
Equality partitions split the digit run into contiguous, non-overlapping chunks
(for example, a double equality may split 9 digits into three groups of 3) — every chunk still uses its digits
exactly once, and no digit is ever shared between chunks. Double and triple equalities add search time because
more partition points must be checked.
This only sets how many equations are shown per k when the search first
finishes — every distinct equation the search actually finds for a k is stored and can be reached via the
"showing" +/- control below, and downloads always include the full stored set, not just what's currently
displayed. Results are ranked by a transparent complexity score, with the simplest verified identities first.
Interval mode retunes the search to favor values
near your chosen range instead of small numbers — this is what makes ranges like 1010–1033 reachable, at the cost
of no longer finding much outside it. Only the digit runs selected above are searched, and only k values
inside [From, To] are kept.
Exact-target mode concentrates the search on one
chosen value of k and retains only identities that pass a strict independent numerical recheck.
0distinct k values
0equations stored
–k range
–equations by digit run
Select a k value on the left.
Click "Run search" to build the table. This runs entirely in your browser.
Square-root, factorial, Triangular, and Fibonacci choices increase the search time; the progress line above shows
which stage is running.