olymmath

JBMO-SL 2012 C2

    nn nails nailed on a board are connected by two via a string. Each string is colored in one of nn given colors. For any three colors there exist three nails conne.cted by two with strings in these three colors. Can nn be: (a) 6, (b) 7?

    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

    Locator jbmo-sl/2012/c2 · Tag 8ETQZ0XSE7 · Edit this page on GitHub · Keys: j next, k previous