IMO 2025 Problems 1-2 and Shortlist N2: Combinatorial Geometry, Geometry, and Number Theory — E8 Intelligence Research

FINDING: IMO 2025 Problem 1 is a combinatorial geometry problem involving "sunny lines" (Sonnige Leitungen) — likely a configuration of lines/points with visibility constraints; Problem 2 is a geometry problem; Shortlist N2 is a number theory problem about a Koala's maximum leaves (graph-theoretic extremal). | MATH: No explicit equations/constants extracted from titles alone; Problem 1 likely involves counting or extremal configurations of lines in the plane (e.g., number of "sunny" lines ≤ n or similar bound); Problem 2 likely involves angle chasing or cyclic quadrilaterals; N2 involves extremal graph theory (max leaves in a tree under constraints). | CONNECTION: None directly stated. However, combinatorial geometry problems of this type often reduce to lattice/root-system symmetries (e.g., A₂ root system for triangular grids) or to ratios like 1.618 if Fibonacci-type recurrence appears in extremal bounds. No evidence of 0.382, 0.618, 0.786, 2.618, or base-60 in titles. | DEPTH: 3 — T Author: Andrew Stewart Caldin, Independent Researcher, UK. Part of the E8 Intelligence Research series. Platform: e8intelligence.com