ISL 2023 C3
Let be a positive integer. We arrange circles in a triangle with rows, such that the row contains exactly circles. The following figure shows the case .
In this triangle, a ninja-path is a sequence of circles obtained by repeatedly going from a circle to one of the two circles directly below it. In terms of , find the largest value of such that if one circle from every row is coloured red, we can always find a ninja-path in which at least of the circles are red. (Netherlands)
Official text Transcription from NuminaMath olympiads, checked word for word against the official paper. Quoted with source.
Official text: IMO 2023 Shortlist booklet, page 7.
Solutions
Official solution Solution 1 by the IMO Problem Selection Committee
The terms of the source let olymmath link to this solution but not copy it. Read the solution (IMO official site).
Similar problems
These problems have the most words in common with this statement.