Making any integer with four 2s (2025)
Points and comments are a snapshot, not live.
Paul Dirac found a general solution to express any integer using exactly four 2s with nested square roots and logarithms.
The classic math puzzle asks to represent any natural number with exactly four instances of the digit 2 and any mathematical operations. Elementary solutions use basic arithmetic; middle school adds exponents and factorials; advanced tricks include concatenation (22), the Gamma function, complex numbers, and integrals. Paul Dirac ruined the puzzle by finding a general formula: n = -log₂(log₂(√√...√2)), where square roots are applied n times, using three 2s. Adding a fourth 2 via 2=√(2+2) yields a solution for any integer using only four 2s.
What commenters are saying
Several commenters debated what counts as "using" a digit, especially for square roots (which imply a 2 as the root index). One camp argues the square root symbol inherently consumes a 2; others counter that exponentiation and division similarly imply hidden digits. Alternative general solutions appeared: using the Peano successor function S(a)=a+1, or using sin(arctan()) as a repeatable operator. Some noted that concatenation (like 22) is base-10-specific and arguably cheating. A related puzzle finds the smallest integer not expressible with four of a given digit using only basic arithmetic.