The Hidden Odd Invariant in the IMO Windmill Problem — E8 Intelligence Research

Abstract

FINDING: The 2011 IMO windmill problem (Q2) is a deceptively simple combinatorial geometry problem whose solution reveals a hidden invariant — the number of "windmill" states is always odd, forcing a fixed point. | MATH: The problem reduces to: given n points in general position, a "windmill" process rotates a line through a pivot point, switching pivots at each intersection. The key lemma: the total number of pivot switches is exactly n·(n−1)/2 (each pair of points becomes a pivot exactly once), and the parity of the number of states is odd, guaranteeing a return to the initial configuration after a full rotation. No explicit constants, but the combinatorial invariant is 2·(n choose 2) + 1 states. | CONNECTION: The oddness of the state count is a topological/parity invariant — reminiscent of the fact that in any finite set of points, the number of "halving lines" is odd (a known result in discrete geometry). This parity structure echoes the crystallographic restriction theorem (only 2 Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com