Invariant Discovery, Geometry, and Self-Reference: Keys to Hardest Competition Problems — E8 Intelligence Research

FINDING: The hardest competition problems often hinge on invariant discovery, combinatorial geometry, or logical self-reference, not on advanced calculus or obscure constants. MATH: No universal equation emerges; key invariants include parity, modular arithmetic, fixed-point properties, and symmetry groups (e.g., windmill problem uses rotational symmetry of odd/even point counts). CONNECTION: The windmill problem (2011 IMO Q2) implicitly uses rotational symmetry and fixed-angle rotations (π/3, π/2), linking to crystallographic point groups (e.g., 3-fold, 4-fold symmetry). The "hardest logic puzzle" reduces to ternary logic and self-referential truth tables, echoing base-3 or base-60 cyclic patterns in ancient calendars. DEPTH: 6 — Profound in pedagogical elegance and problem design, but no new universal constants or geometric ratios (0.382, 0.618, etc.) are derived. The value lies in demonstrating how simple symmetry and invariant reasoning can solve seemingly intractable problem Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com