Skip to main content

Combinatorics + Game Theory Puzzle

Source: Random search on


Two players A and B play the following game:

Start with the set S of the first 25 natural numbers: S={1,2,…,25}.

Player A first picks an even number x_0 and removes it from S: We have S:=S−{x_0}.

Then they take turns (starting with B) picking a number x_n∈S which is either divisible by x_n-1 or divides x_n-1 and removing it from S.

The player who can not find a number in S which is a multiple or is divisible by the previous number looses.

Which player has the winning strategy and what is it?


  1. This comment has been removed by the author.

  2. B wins. Pair up the numbers in 1...25, except for 1 and primes more than 11, as below:

    (2,14) (3,15)
    (4,16) (5,25)
    (6,12) (7,21)
    (8,24) (9,18)
    (10,20) (11,22)

    When A chooses one of the above numbers, B responds with the other in its pair, which will ensure B always has a number to choose. A will eventually have to pick 1, to which B responds with 23 for the win.

  3. A wins. He chooses 16 on his first chance, and on his next he chooses a multiple of 3. After a few moves, B will be forced to choose 1, when A chooses 23

    1. Certainly B wins as pointed out by Mike Earnest, but the pairs of number as response for B is not unique.
      Certain pairs are uniquely determined. They are:
      (22,11); (18,9); (2,14); (10,20); (5,25); (3,15); (21,7)

      They have also been pointed out by Mike. But for other the following three sets of possibility are there:

      1st : (4,16); (8,24); (6,12) % Same as that pointed by mike
      2nd : (8,16); (4,24); (6,12)
      3rd : (8,16); (4,12); (6,24)

      so say if A chooses 24, then B can respond with 8, 6 or 4.

      The substantive question is if n is any natural number, is there always a wining strategy for B?

    2. if n=27, then A has a winning strategy,

      A will choose 18. then the remaining numbers are paired thus:

      (2,14) (3,15)
      (4,16) (5,25)
      (6,12) (7,21)
      (8,24) (9,27)

      unpaired nos. are {1,17,19,23}

      A will follow the strategy of completing pair. ultimately B will choose 1, then A will choose 23.

  4. Note that B starts. I claim that B wins.
    B chooses 23, A has to choose 1
    B chooses 17, A has nothing to choose!

    1. I think that u have to start with a even number


Post a Comment

Popular posts from this blog

Asking a girl out

This is not a puzzle. So, for those of you who follow this puzzle blog, please bear with me for just one post. Interesting Math in this article though :P

Most of my friends already read an article that I wrote more than an year back - "Speak Up"

Here, inspired by the movie, The Beautiful Mind, I give a mathematical analysis of asking a girl out. Nice time it is. Feb 10. No plans for Feb 14 and I am sure this article makes me look even more geekier and all the more reason for me to believe that I will be alone, yet again. But what the hell, lets do it!

Note: This is not an independent analysis. There are many "mathematics sites" which does "similar" analysis.

@Consultants, correct me if I am wrong in my estimates. :P

Why is there a need to be selective?

From the age of 15, I guess there are approximately 3,600 girls I have liked (On average days, I don't see new girls. But going outside, I like about 30 girls. Saying that I go out once every week right …

Consecutive Heads

Let's say A keep tossing a fair coin, until he get 2 consecutive heads, define X to be the number of tosses for this process; B keep tossing another fair coin, until he get 3 consecutive heads, define Y to be the number of the tosses for this process.

1) Calculate P{X>Y}
2) What's the expected value of X
3) What's the expected value of Y

This is probably the hardest puzzle I have ever put on my blog. Hence, I will post its solution in the post directly rather than on comment.

(Solved by me finally after 13 months :))

Make a state diagram. Let the state be (a,b) where a is the number of consecutive heads streak "A" is on currently and b is the number of consecutive heads streak "B" is on currently.

So, (0,3) (1,3) are final accepted states and (2,0) (2,1) (2,2) (2,3) are failure states. If you get tails, your contribution to the state reaches to "0"

f(State) = P(X>Y | "State" configuration initially)

f(0,0) = 1/4[f(…

Fraction Brainteaser

Sent to me by Gaurav Sinha

Siddhant writes a Maths test and correctly answers 5 out of 6 Arithmetic questions and 20 out of 28 Geometry questions. In total, Siddhant scores 25 out of 34. 

Vaibhav writes another Maths test and correctly answers 20 out of 25 Arithmetic questions and 6 out of 9 Geometry questions. in total, Vaibhav scores 26 out of 34.

Note that
a) Vaibhav scores more than Siddhant
b) Siddhant score better than Vaibhav in both individual topics - 5/6 > 20/25 and 20/28 > 6/9

How is it possible?