Media Summary: Prove that from a set of ten distinct two-digit numbers (in the decimal system), it is possible to select two disjoint subsets whose ... 00:00 Intro 25 - 45/90 - 150 Take 15 00:30 Lessons from shooting the A line is "sunny" if it avoids three simple directions. How many sunny lines can you use to cover a triangular grid of points?

Imo 1972 Problem 1 - Detailed Analysis & Overview

Prove that from a set of ten distinct two-digit numbers (in the decimal system), it is possible to select two disjoint subsets whose ... 00:00 Intro 25 - 45/90 - 150 Take 15 00:30 Lessons from shooting the A line is "sunny" if it avoids three simple directions. How many sunny lines can you use to cover a triangular grid of points? Can you prove that within any set of 10 two-digit numbers, there will always be two disjoint subsets with the same sum? In ... Welcome! In this video, we will be going through Q1 from the

Photo Gallery

IMO 1972 Problem 1
The Pigeonhole Principle - IMO 1972 Problem 1
IMO 1992 - Problem 1
IMO 1972 Problem 1 | Pigeon Hole Principle | Math Olympiad Combinatorics
An IMO Divisibility Problem [IMO 1964 Problem 1]
Solving a Famous IMO Problem (The Sunny Lines | IMO 2025 Problem 1)
Solving an IMO problem in 5 minutes: IMO 1962 – Problem 1
Solving the 2006 IMO Problems: Day 1
Moving Digits!| IMO 1962 P1
The unexpectedly hard windmill question (2011 IMO, Q2)
The 1972 IMO Problem That Everyone Should Know | Pigeonhole Principle | Explained | Hindi
IMO 1972 Problem 6 Solution (Part 1) #SoME2
View Detailed Profile
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 ...

IMO 1992 - Problem 1

IMO 1992 - Problem 1

00:00 Intro 25 - 45/90 - 150 Take 15 00:30 Lessons from shooting the

IMO 1972 Problem 1 | Pigeon Hole Principle | Math Olympiad Combinatorics

IMO 1972 Problem 1 | Pigeon Hole Principle | Math Olympiad Combinatorics

Try this combinatorics

An IMO Divisibility Problem [IMO 1964 Problem 1]

An IMO Divisibility Problem [IMO 1964 Problem 1]

Today we solve

Solving a Famous IMO Problem (The Sunny Lines | IMO 2025 Problem 1)

Solving a Famous IMO Problem (The Sunny Lines | IMO 2025 Problem 1)

A line is "sunny" if it avoids three simple directions. How many sunny lines can you use to cover a triangular grid of points?

Solving an IMO problem in 5 minutes: IMO 1962 – Problem 1

Solving an IMO problem in 5 minutes: IMO 1962 – Problem 1

olympiad #math #algebra #jee #trigonometry #geometry #gmat #mathstrick #olympiad2022 ⭐ Join this channel ...

Solving the 2006 IMO Problems: Day 1

Solving the 2006 IMO Problems: Day 1

The 2006 US

Moving Digits!| IMO 1962 P1

Moving Digits!| IMO 1962 P1

IMO

The unexpectedly hard windmill question (2011 IMO, Q2)

The unexpectedly hard windmill question (2011 IMO, Q2)

The famous (infamous?) "windmill"

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 ...

IMO 1972 Problem 6 Solution (Part 1) #SoME2

IMO 1972 Problem 6 Solution (Part 1) #SoME2

In this video, I attempt to solve an

International Mathematics Olympiad 1972 | Q1 in 5 minutes

International Mathematics Olympiad 1972 | Q1 in 5 minutes

Welcome! In this video, we will be going through Q1 from the