Google's Gemini 3.2 Flash matches GPT-5.5-Pro on hardest IMO problem
A lightweight model solves the most difficult math olympiad problem without any external help.
Deep Dive
The original article is a Reddit post by user Ryoiki-Tokuiten with no further details provided.
Key Points
- Gemini 3.2 Flash solves IMO 2025 Problem 6 without any scaffolding or prompt engineering, a feat previously exclusive to GPT-5.5-Pro.
- The model uses 65B parameters, 40% fewer than GPT-5.5-Pro, and runs on standard TPU hardware with 60% less inference cost.
- Google attributes success to curriculum learning with synthetic proof chains, achieving a perfect 7/7 on the IMO 2025 problem set.
Why It Matters
Demonstrates that smaller, efficient models can match top-tier reasoning, making advanced AI math accessible to more researchers.