olymmath

USAMO 2001 Problem 1

  • Day 1

Each of eight boxes contains six balls. Each ball has been colored with one of nn colors, such that no two balls in the same box are the same color, and no two colors occur together in more than one box. Determine, with justification, the smallest integer nn for which this is possible.

Dataset text AI-MO AoPS. Quoted with source.

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 usamo/2001/p1 · Tag RQQ1J4VAHV · Edit this page on GitHub · Keys: j next, k previous