Video summary

Самая Сложная Задача В Истории Самой Сложной Олимпиады

Main summary

Key takeaways

Summary of the Video

Context: The IMO (International Mathematical Olympiad)

  • Each year, over 100 countries send teams of six school-aged participants.
  • The competition lasts two days.
  • Participants solve three problems in 4.5 hours total (i.e., three problems over two days).
  • Problems are intentionally ordered by difficulty into three informal tiers:
    1. The first problem is usually solvable by a large majority.
    2. The second problem is typically the main and most difficult one.
    3. The third problem is designed to be very hard—often solvable only by the strongest contenders aiming for top scores.
  • Historically, the overall hardest problem tends to have extremely low success rates.

Identifying the Hardest “Third Problem” in IMO History

  • The speaker reviews statistics across many IMO editions and claims there was a particular third problem on the first day of a specific IMO (referred to as “2K Olympiad” / “this year”) that became the most difficult / least solved in IMO history.
  • Claimed indicators include:
    • Only a couple of participants achieved a perfect solution, with only two fully solving it.
    • Only about 80 participants scored above zero.
    • The combined score across all participants was 26.
  • The speaker also mentions examples where Russians (or Russia overall) did well/poorly in different years when similarly difficult tasks were solved.

The Problem Statement: Hare and Wolf Game

  • After the statistics, the video presents the full problem:
    • A hare and a wolf move on a 2D plane.
    • They start from the same point and take turns.
  • Rules:
    • Hare’s move:
      • The hare jumps exactly 1 meter.
      • Then it gives the wolf a hint: a point chosen by the hare that is within 1 meter of the hare’s true landing point.
      • So the wolf receives an approximate hare position with error ≤ 1.
    • Wolf’s move:
      • The wolf also jumps exactly 1 meter.
      • The wolf sees the hare perfectly (i.e., the hare may move adversarially, and the wolf must react based on the hint/information structure).
  • Main question:
    • Can the hare ensure that after a billion moves, it is still at least 100 meters away from the wolf?
    • Or can the wolf prevent this even with optimal play?

Key Strategy Idea (Proof Sketch)

  • The speaker argues the distance dynamics can be analyzed using geometry and the triangle inequality.
  • Intuition:
    • Since both move by exactly 1 meter per turn, it seems the wolf might always “track” the hare.
  • Hare’s strategy (as described):
    • The hare exploits the information structure: the wolf only receives an error-bounded hint about the hare’s position.
    • The hare moves in a controlled way, initially at a small angle relative to the line connecting wolf and hare.
    • This forces the wolf’s “best” consistent response to constrain it along a particular line.
    • Meanwhile, the hare gradually increases the separation until a critical point.
  • The argument:
    • Repeated use of triangle inequality / geometry shows the wolf cannot reduce the distance faster than the hare’s strategy increases it.
    • A quantitative estimate shows how quickly the square of the distance can grow.
    • The conclusion is that over huge time (e.g., a billion moves), the hare can grow the separation enough to ultimately maintain at least 100 meters distance.

Why This Problem Was Statistically Hard but Solvable for Top Competitors

  • The speaker claims that although the global solve rate was extremely low, the official solution (once known) is surprisingly easy.
  • Possible reasons offered:
    1. Some teams/countries may have weaker training in strategic/algorithmic thinking. Similar strategic geometry problems (e.g., “Turbo snail”, “duck problem”) are referenced as stylistically comparable.
    2. Solving the third problem requires time and momentum—many participants get stuck on the second problem or begin the third too late.
    3. The second problem can become a time sink (functional/technical), while the third feels more like strategy/lottery, where it’s easy to waste time without progress.

Speakers / Mentions in the Video

  • The main narrator / presenter (unnamed in the summary)
  • “Maffin 2049” (mentioned as a Telegram channel; likely an author/tutor figure, not clearly the narrator)
  • “maffin 2 bot” (service mentioned; not necessarily a separate speaker)
  • IMO “jury” / “authors” (discussed as roles in context, not distinct speakers)
  • “Naum” (a reference used during the explanation; not a separate real speaker)

Original video