olymmath

MEMO 2014 T4

    In Happy City there are 20142014 citizens called A1,A2,…,A2014A_1, A_2, \dots , A_{2014} . Each of them is either happy or unhappy at any moment in time. The mood of any citizen AA changes (from being unhappy to being happy or vice versa) if and only if some other happy citizen smiles at AA . On Monday morning there were NN happy citizens in the city.

    The following happened on Monday during the day: the citizen A1A_1 smiled at citizen A2A_2 , then A2A_2 smiled at A3A_3 , etc., and, finally, A2013A_{2013} smiled at A2014A_{2014} . Nobody smiled at anyone else apart from this. Exactly the same repeated on Tuesday, Wednesday and Thursday. There were exactly 20002000 happy citizens on Thursday evening.

    Determine the largest possible value of NN .

    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 memo/2014/t4 · Tag RXEY1HPPZ3 · Edit this page on GitHub · Keys: j next, k previous