Hidden Fixed Points in Olympiad Extremes — E8 Intelligence Research

FINDING: The "hardest" competition problems cluster around structural invariants — the 1988 IMO Problem 6 (Vieta jumping), 2011 IMO Q2 (windmill combinatorics), and Putnam's hardest (group-theoretic symmetry) — each revealing hidden algebraic or combinatorial fixed points. | MATH: 1988 IMO P6: if a²+b² = k(ab+1) for positive integers, then k is a perfect square — proof via Vieta jumping (descent on quadratic roots). 2011 IMO Q2: for odd n, any arrangement of n points in general position admits a "windmill" rotation that visits each point exactly once per half-turn — equivalent to a cyclic order invariant under 180° rotation. Putnam hardest (2014 B6?): involves group action on a set with orbit-stabilizer counting, yielding a binomial identity. | CONNECTION: 1988 P6's k=1,4,9,... are perfect squares — ratios of consecutive squares approach 1, not golden; but the descent mirrors the Euclidean algorithm, whose worst-case ratios involve φ (1.618) and its reciprocal (0.618). The windmill pro Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com