INTERNATIONAL MATH OLYMPIAD 2023 | Problem 5

[@calimath6701]

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

[@brockobama257]

a mexican triangle has 1 cartel member in each row

[@samuelnuyts2035]

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)

[@calimath6701]

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 ^^)

[@AnoName-g3b]

Continue like that !!

[@ilemt0923]

12:47 I don't think p(c) is unique. It seems easy to find a counterexample for n=3.

[@AryanChhotray]

It all seems very complex, it would be great if you could make a video starting from grass root level of maths and explaining all concepts irrespective of it being long otherwise great video🫡

[@calimath6701]

Thanks. I see your point. Starting from grass root level in all aspects is not feasible right now. However: we will have a video attempting exactly that for probability theory in a few weeks. So, this is going to help with this video a lot :)

[@usptact]

I don’t even understand the question…