Closed-Form Identity Miner

Paste a decimal. The miner searches small closed forms built from 1, π, e, √2, √3, √5, φ, ln 2, ln 3, Euler–Mascheroni γ, Catalan G, ζ(3) and returns every match within your precision, simplest first.

What it searches. For each transform y of your number (x, 1/x, x², √x, ln x, e^x): y = (p/q)·C^k with k ∈ {±½, ±1, ±2, 3}, q ≤ 64; and y = (a + b·C)/q with q ≤ 12, |b| ≤ 48. Tolerance comes from the digits you typed. Limits: double precision (about 15 digits), small coefficients only, no products of two constants. A match is a numerical coincidence until proved: with fewer than ~10 digits, expect chance hits, so the table shows how many candidate forms were tested.