扫描二维码，直接登录
题库 / GMATAdvanced-PS-11
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
还没有题目讲解（毕出老师会陆续发布对官方考题的解读，请保持关注）。
這種"B附著於A"的遊戲類型需要找到兩者的附著關係i.e.這題中,A拿幾個會決定B拿的數量
These games are made to have a sure shot winner (if both players play intelligently and to win) under certain conditions. If A and B are playing, B's move will be decided by A's move if B has to win i.e. there are complementary moves. For example, in this question, if A picks 2 sticks, B must pick 4 sticks. If A picks 3 sticks, B must pick 3 too. So to solve these questions you need to find this particular complementary relation.
登录 或 注册 后可以参加讨论