olymmath

NO-ABEL 2004 Problem 4

    Among the nn inhabitants of an island, where nn is even, every two are either friends or enemies. Some day, the chief of the island orders that each inhabitant (including himself) makes and wears a necklace consisting of marbles, in such a way that two necklaces have a marble of the same type if and only if their owners are friends. (a) Show that the chief's order can be achieved by using n2/4n^2/4 different types of stones. (b) Prove that this is not necessarily true with less than n2/4n^2/4 types.

    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

    Similar problems

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

    Locator no-abel/2004/p4 · Tag XMHB36GMY5 · Edit this page on GitHub · Keys: j next, k previous