olymmath

KöMaL 2010 B4313

    AA, BB, CC, DD, EE and FF are a group of six people. nn bars of chocolate given to the group in the following way: Everyone gets at least one, AA gets less than BB, BB gets less than CC, CC gets less than DD, DD gets less than EE, and finally, FF gets the most. The members of the group know these conditions, they know the value of nn, and of course, they know how many bars of chocolate they were given themselves. They have no other information available for them. What is the smallest possible value of nn for which it is possible to give them the bars of chocolate so that no one can tell how many bars of chocolate everyone has?

    Official text KöMaL. 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 hu-komal/2010/b4313 · Tag 9Q4X6MP22Z · Edit this page on GitHub · Keys: j next, k previous