JBMO-SL 2019 C3

Combinatorics
Answer

In a $5 \times 100$ table we have coloured black $n$ of its cells. Each of the 500 cells has at most two adjacent (by side) cells coloured black. Find the largest possible value of $n$ .

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

302

Solutions

No solution is on olymmath yet. Official and human solutions come first when they arrive. AI solutions come after them, with a label.

Add a solution

Locator jbmo-sl/2019/c3 · Tag 1FYWN9YFFR · Edit this page on GitHub · Keys: j next, k previous