(Drew here.) Let's take a dive into a problem from the 2023 IMO Shortlist. This is C5, one of the hardest shortlist problems this year (but let's be honest, the whole C list was devilishly hard).
(This is Glen.) As you may have noticed from my previous posts, my go-to method for approaching geometry problems is bashing, normally with coordinates. Anyone who's tried to bash a problem (especially with coordinates) would have probably found out the hard way that circles generally lead to trouble, but years of bashing have led me to devise some tricks to get around this.
(David here.) In this blogpost, we'll go off on a tangent and explore what it means to learn from data . In the process, we will get slightly closer (but not quite there) to the context where Rademacher complexity emerges.