Skip to content / Đến nội dung
ThichHocToan.com

MathNet 2003 — Part 01 Question 98

Math Olympiad Vault · MathNet 2003 — Part 01

Question 98

There are 2003 pieces of candy on a table. Two players alternately make moves. A move consists of eating one candy or half of the candies on the table (the "lesser half" if there is an odd number of candies); at least one candy must be eaten at each move. The loser is the one who eats the last candy. Which player - the first or the second - has a winning strategy?