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).
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 ^^)
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).
a mexican triangle has 1 cartel member in each row
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 ^^)
Continue like that !!
12:47 I don't think p(c) is unique. It seems easy to find a counterexample for n=3.
I don’t even understand the question…
so glad you guys are jump scaring the sleepy bad bad naughty students with a stunning explosion special effect