b***k
发帖数: 2673 | 1 ☆─────────────────────────────────────☆
iq200 (iq 200) 于 (Fri Dec 28 20:29:57 2007) 提到:
Alice and Bob play a game in which they take turns
removing stones from a heap that initially has n stones.
The number of stones removed at each turn must be one
less than a prime number. The winner is the player who
takes the last stone. Alice plays first. Prove that there
are infinitely many n such that Bob has a winning strat-
egy. (For example, if n = 17, then Alice might take
6 leaving 11; then Bob | h********2
发帖数: 23 | 2 iq200, are you sure you asked the right question? Since u ask to prove Bob
has a winning strategy, but the example you gave show Alice won. | d****n
发帖数: 12 | 3 晕
做金融分析的还要学数论嘛，貌似关系不大吧。
【在 b***k 的大作中提到】
: ☆─────────────────────────────────────☆
: iq200 (iq 200) 于 (Fri Dec 28 20:29:57 2007) 提到:
: Alice and Bob play a game in which they take turns
: removing stones from a heap that initially has n stones.
: The number of stones removed at each turn must be one
: less than a prime number. The winner is the player who
: takes the last stone. Alice plays first. Prove that there
: are infinitely many n such that Bob has a winning strat-
: egy. (For example, if n = 17, then Alice might take
: 6 leaving 11; then Bob
|
|
