Nested square roots allow the construction of any integer using exactly four instances of the digit 2.
*A century‑old digit puzzle finds a universal answer through nested square roots. *The solution, traced to Paul Dirac, turns a classroom curiosity into a mathematical certainty.
A modest brain‑teaser has been haunting students and mathematicians for a century: produce any natural number using exactly four copies of the digit 2 and any allowed mathematical operation. The puzzle scales from kindergarten arithmetic—1 = (2+2)/(2+2)—to high‑school exponentials—65536 = 2^{2^{2^{2}}}—and even to graduate‑level constructs involving Gamma functions and complex numbers. In the 1920s, the challenge was a favorite pastime among mathematicians, until Paul Dirac unveiled a sweeping solution that works for every integer. Dirac’s answer hinges on nested square roots and a clever substitution that restores the four‑2 count, turning a whimsical game into a provable theorem.
The challenge asks for exactly four instances of the digit 2 and any combination of mathematical operations to produce a target natural number. Elementary examples include 1 = (2+2)/(2+2), 2 = 2/2 + 2/2, 3 = 2·2 - 2/2, 4 = 2+2+2-2, 5 = 2·2 + 2/2 and 6 = 2·2·2 - 2. Middle‑school tools expand the range: 18 = 2^{2^{2}}+2, 28 = (2+2)!+2+2, 256 = (2+2)^{2+2}, 65536 = 2^{2^{2^{2}}}. Tricks treat the concatenated 22 as two 2s, yielding 26 = 22+2+2, 11 = 22/√(2+2) and 444 = 222·2. The puzzle scales with advanced functions, but the core rule remains: no digit other than 2 may appear.
Dirac introduced a nested‑square‑root construction that uses only three 2s. Repeatedly applying the square root n times gives √…√2 = 2^{2^{-n}}. Taking base‑2 logarithms twice yields -n, so n = -log_{2}(log_{2}(√…√2)). To meet the four‑2 requirement, Dirac replaced a single 2 with √(2+2), which itself equals 2. The final formula becomes n = -log_{√(2+2)}(log_{2}(√…√2)). This expression contains exactly four 2s and only elementary operations. Dirac’s method proves any integer n can be expressed, the only practical obstacle being the visual complexity of deep nesting.
Traditional constructions struggle with 7, but the puzzle permits advanced tools. Using the Gamma function, 7 = Γ(2)+2+2+2, which respects the four‑2 limit. Dirac’s universal formula also handles 7: 7 = -log_{√(2+2)}(log_{2}(√√√√√√√2)), where the square root is applied seven times. Both approaches meet the digit constraint while employing only reasonable mathematical operations.
The four‑2s puzzle illustrates how a simple combinatorial restriction can inspire deep mathematical insight. Dirac’s nested‑root technique links elementary arithmetic to exponentiation, logarithms and limits, showing that even playful constraints can expose structural properties of numbers. The result also highlights a historical thread: mathematicians in the 1920s relished the puzzle until Dirac’s general solution rendered it a solved problem. Today, the formula serves as a reminder that ingenuity often turns curiosity into universal truth.
It asks for exactly four digit 2s and any mathematical operations to generate a target natural number, with examples ranging from 1 = (2+2)/(2+2) to 65536 = 2^{2^{2^{2}}}.
Dirac used nested square roots: applying the square root n times gives 2^{2^{-n}}; two base‑2 logarithms yield -n, and substituting √(2+2) for a missing 2 restores the four‑2 count, producing n = -log_{√(2+2)}(log_{2}(√…√2)).
Yes; using the Gamma function, 7 = Γ(2)+2+2+2, and Dirac's formula also works: 7 = -log_{√(2+2)}(log_{2}(√√√√√√√2)) with seven nested square roots.
Dirac’s four‑2 formula transforms a light‑hearted puzzle into a universal statement about number construction. It proves that with enough mathematical depth, even the most restrictive digit games yield to systematic solution. The legacy of the puzzle endures, reminding us that curiosity, when paired with rigorous insight, can resolve problems once thought intractable. Future educators may use the story to illustrate how abstract theory can emerge from simple constraints, keeping the spirit of the four‑2s challenge alive for new generations.
Sources: Hacker News (Making any integer with four 2s (2025))