olymmath

BALTIC-WAY 2023 Problem 6

  • Answer

Let nn be a positive integer. Each cell of an n×nn \times n table is coloured in one of kk colours where every colour is used at least once. Two different colours AA and BB are said to touch each other, if there exists a cell coloured in AA sharing a side with a cell coloured in BB. The table is coloured in such a way that each colour touches at most 2 other colours. What is the maximal value of kk in terms of nn ?

Dataset text NuminaMath olympiads. Quoted with source.

Show the answer

k=2n-1 \text{ when } n \neq 2 \text{ and } k=4 \text{ when } n=2

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 baltic-way/2023/p6 · Tag 4F9GA6ZZJA · Edit this page on GitHub · Keys: j next, k previous