olymmath

PAMO 2009 Problem 4

  • Day 2

Consider nn children in a playground, where n≥2n\ge 2 . Every child has a coloured hat, and every pair of children is joined by a coloured ribbon. For every child, the colour of each ribbon held is different, and also different from the colour of that child's hat. What is the minimum number of colours that needs to be used?

Dataset text AI-MO AoPS. Quoted with source.

Official text: Pan-African Mathematics Olympiad 2009 official paper, page 1.

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

Similar problems

These problems have the most words in common with this statement.

Locator pamo/2009/p4 · Tag FH8JZM9XBQ · Edit this page on GitHub · Keys: j next, k previous