Question 190
Around a table $2n$ people are seated and $m$ cookies are distributed to them. These people can pass cookies under the following rules:
- One can only pass cookies to his/her neighbors.
- One can pass a cookie only if he or she eats one cookie.
Let $A$ be one of these people. Find the minimum $m$ such that no matter how $m$ cookies were distributed, there is a strategy to pass cookies so that $A$ has at least one cookie.
- One can only pass cookies to his/her neighbors.
- One can pass a cookie only if he or she eats one cookie.
Let $A$ be one of these people. Find the minimum $m$ such that no matter how $m$ cookies were distributed, there is a strategy to pass cookies so that $A$ has at least one cookie.