olymmath

HMMT 2003 C5

  • Combinatorics

We wish to color the integers 1,2,3,…,101,2,3, \ldots, 10 in red, green, and blue, so that no two numbers aa and bb, with a−ba-b odd, have the same color. (We do not require that all three colors be used.) In how many ways can this be done?

Dataset text NuminaMath olympiads. 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

Similar problems

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

Locator hmmt/2003/c5 · Tag GBJZVPCS0J · Edit this page on GitHub · Keys: j next, k previous