Rita and Sam play the following game with n sticks on a table. Each must remove 1, 2, 3, 4 or 5 sticks at a time on altemate tums, and no stick that is removed is put back on the table.The one who removes the last stick(or sticks) from the table wins. If Rita goes first, which of the following is a value of n such that Sam can always win no matter how Rita plays?



7

10

11

12

16

考题讲解
还没有题目讲解(毕出老师会陆续发布对官方考题的解读,请保持关注)。

登录注册 后可以参加讨论

GMATAdvanced-PS