FINDING: The "hardest" competition problems cluster around invariant theory, combinatorial geometry, and logical self-reference — not advanced calculus. The 2011 IMO windmill problem and the Boolos logic puzzle are the most structurally significant. | MATH: Windmill problem (IMO 2011 Q2): Given n points in general position, a "windmill" line rotates about a pivot point, switching pivots when it hits a point. Prove that for any starting line, there exists a pivot sequence such that the line visits each point infinitely often. Key invariant: the number of points on each side of the rotating line changes by ±1 at each switch; the parity of the count on the left side is invariant modulo 2. The solution uses a combinatorial argument on the cyclic order of points — no explicit equation, but the structure is a discrete dynamical system on the permutation group S_n. Boolos puzzle: Three gods (True, False, Random) answer yes/no in unknown languages ("da"/"ja"). Solution requires self-referentia Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com
No takes yet. Share an insight, caveat, or question.
Andrew Stewart Caldin (2026) studied this question.
Synapse has enriched 5 closely related papers on similar clinical questions. Consider them for comparative context: