Invariant-Finding Defines Hardest Math Competition Problems — E8 Intelligence Research

Abstract

FINDING: The "hardest" competition problems cluster around invariant-finding, combinatorial geometry, and logical self-reference — not computational brute force. The 2011 IMO windmill problem and the Putnam "hardest" both hinge on discovering a conserved quantity or a monotonic invariant under a dynamic process. | MATH: Windmill (IMO 2011 Q2): Given \(n\) points in general position, a "windmill" line rotates about a pivot point, switching pivots when it hits another point. Key invariant: the number of points on each side of the line changes by \(\pm 1\) per switch; the line must visit every point as pivot infinitely often if \(n\) is odd — the proof uses a parity/balance argument on the partition \((k, n-k)\) where \(k\) is fixed by the initial configuration. Putnam (hardest, e.g., 1985 B6 or similar): often involves a polynomial or sequence where the invariant is a constant term, e.g., \(\sum_{i=1}^n x_i^2\) or a determinant that remains fixed under a transformation. Boolos' "hardest Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com