INTERNATIONAL MATH OLYMPIAD 2023 | Problem 5
ฝัง
- เผยแพร่เมื่อ 25 มิ.ย. 2024
- In this video, we present a solution to IMO 2023/5.
00:00 Problem Statement
01:05 Motivation (1st part)
04:54 Upper bound
07:19 Motivation (2nd part)
10:54 Lower bound
Check out our website www.calimath.org to find past problems, solutions and other cool stuff.
Solution PDF: calimath.org/pdf/IMO2023-5.pdf
branch: combinatorics
difficulty: 10
Our website: www.calimath.org
Contact us: calimath.business@gmail.com
I made a technical error at 14:25. k >= p(c) is not necessarily true. However, the fact that we always find a circle c such that r(p(c)) >= log(n+1) tells us that k >= log(n+1).
so glad you guys are jump scaring the sleepy bad bad naughty students with a stunning explosion special effect
a mexican triangle has 1 cartel member in each row
I'd love an intro to prob. theory from your channel!
Really nice video! It’s great to have slightly longer videos like here, where more motivation is given as if its just a straight solution its hard to see where everything is coming from. (I think you meant IMO 2023/5 in the description :D)
Hey, thanks for the feedback. Since I am currently trying to develop my motivation-presentation-game, it is really nice to hear that you enjoyed it in this video :). (You were right about the description ^^)