Media Summary: a bunch of factorials and powers of prime factors. Hello everybody in this lecture we will be solving 1973 Prove that from a set of ten distinct two-digit numbers (in the decimal system), it is possible to select two disjoint subsets whose ...

Imo 1972 Problem 3 - Detailed Analysis & Overview

a bunch of factorials and powers of prime factors. Hello everybody in this lecture we will be solving 1973 Prove that from a set of ten distinct two-digit numbers (in the decimal system), it is possible to select two disjoint subsets whose ... mathematics International Mathematical Olympiad ( What's the ultimate speed limit for a function? We're diving deep into Can you prove that within any set of 10 two-digit numbers, there will always be two disjoint subsets with the same sum? In ...

Photo Gallery

IMO 1972 Problem 3
1972 IMO Problem #3
1973 IMO Problem #3
The unexpectedly hard windmill question (2011 IMO, Q2)
IMO 1972 Problem 1
The Pigeonhole Principle - IMO 1972 Problem 1
1970 IMO | Problem 3
IMO 2024 Problem 3 - *MONSTER* combinatorics - how many will get 7?
Solving the "Impossible" Math Olympiad Problem (IMO 2025 P3)
IMO 2025 Problem 3 - *BONZA* number theory functional equation!
IMO 1997 Problem 3
solving 2025 IMO Problem 3 - PART 1
View Detailed Profile
IMO 1972 Problem 3

IMO 1972 Problem 3

a bunch of factorials and powers of prime factors.

1972 IMO Problem #3

1972 IMO Problem #3

This is a number theory

1973 IMO Problem #3

1973 IMO Problem #3

Hello everybody in this lecture we will be solving 1973

The unexpectedly hard windmill question (2011 IMO, Q2)

The unexpectedly hard windmill question (2011 IMO, Q2)

The famous (infamous?) "windmill"

IMO 1972 Problem 1

IMO 1972 Problem 1

An old, easy and elegant

The Pigeonhole Principle - IMO 1972 Problem 1

The Pigeonhole Principle - IMO 1972 Problem 1

Prove that from a set of ten distinct two-digit numbers (in the decimal system), it is possible to select two disjoint subsets whose ...

1970 IMO | Problem 3

1970 IMO | Problem 3

We prove two statements of

IMO 2024 Problem 3 - *MONSTER* combinatorics - how many will get 7?

IMO 2024 Problem 3 - *MONSTER* combinatorics - how many will get 7?

mathematics #olympiad #math International Mathematical Olympiad (

Solving the "Impossible" Math Olympiad Problem (IMO 2025 P3)

Solving the "Impossible" Math Olympiad Problem (IMO 2025 P3)

What's the ultimate speed limit for a function? We're diving deep into

IMO 2025 Problem 3 - *BONZA* number theory functional equation!

IMO 2025 Problem 3 - *BONZA* number theory functional equation!

mathematics #olympiad #math International Mathematical Olympiad (

IMO 1997 Problem 3

IMO 1997 Problem 3

A beautiful solution is discussed for

solving 2025 IMO Problem 3 - PART 1

solving 2025 IMO Problem 3 - PART 1

Today we'll be solving

The 1972 IMO Problem That Everyone Should Know | Pigeonhole Principle | Explained | Hindi

The 1972 IMO Problem That Everyone Should Know | Pigeonhole Principle | Explained | Hindi

Can you prove that within any set of 10 two-digit numbers, there will always be two disjoint subsets with the same sum? In ...