Symmetry, Not Complexity: The Hidden Invariant Core of Hard Problems — E8 Intelligence Research

FINDING: The corpus of "hardest" competition problems (Putnam, IMO, Collatz, prisoners) reveals that their difficulty stems not from computational complexity but from hidden structural symmetries and invariant-preserving transformations. | MATH: No single closed-form equation unifies these; instead, the invariant core is: (1) Putnam problem — likely involves a combinatorial identity or telescoping sum with a fixed-point symmetry; (2) IMO 2011 P2 "windmill" — a configuration space where the number of lines through a moving pivot is invariant mod 2, forcing a periodic orbit; (3) 100 prisoners — cycle decomposition of a random permutation, expected number of cycles > n/2 is ~1 − ln 2 ≈ 0.3069, with the winning strategy exploiting cycle length ≤ n/2; (4) Collatz — the 3n+1 map, no invariant found, but the stopping time distribution shows a logarithmic scaling law (empirical: ~6.95·log n); (5) MATH dataset — 12,500 problems, no universal constant. | CONNECTION: The windmill problem's pivot Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com