Comprehension
In a game played by two people there were initially N match sticks kept on the table. A move in the game consists of a player removing either one or two matchsticks from the table. The one who takes the last matchstick loses. Players make moves alternately. The player who will make the first move is A. The other player is B.
Question: 1

The smallest value of N (greater than 5) that ensures a win for B is

Show Hint

Find the losing positions for the player who is about to move; the one who must take the last stick loses.
Updated On: Nov 7, 2026
  • 6
  • 7
  • 10
  • 8
Show Solution
collegedunia
Verified By Collegedunia

The Correct Option is B

Solution and Explanation

Step 1: Losing positions.
With 1 stick left the player to move must take it and loses. So \( n = 1 \) is a losing position for the mover.
With 2 or 3 sticks left, the mover takes 1 or 2 and leaves exactly 1 stick, so he wins.
With 4 sticks left, whatever the mover takes (1 or 2), he leaves 3 or 2, a winning position for the opponent. So 4 is losing. Continuing, the losing positions for the mover are \( n \equiv 1 \pmod 3 \): 1, 4, 7, 10, ...

Step 2: Apply to the game.
A moves first. B wins exactly when the starting N is a losing position for A, i.e. \( N \equiv 1 \pmod 3 \). (B then always plays so that A and B together remove 3 sticks per round.)

Step 3: Smallest N greater than 5.
\( N = 7 \) (since \( 7 = 3 \times 2 + 1 \)). Among the options, 10 is also of the form \( 3k+1 \) but is larger; 6 and 8 are not of this form.

Final Answer:
The correct option is (2): 7
Was this answer helpful?
0
0
Question: 2

The largest of N (less than 50) that ensures a win for B is

Show Hint

Use the same pattern: B wins exactly when the starting number of sticks leaves A in a losing position.
Updated On: Nov 7, 2026
  • 46
  • 47
  • 49
  • 48
Show Solution
collegedunia
Verified By Collegedunia

The Correct Option is C

Solution and Explanation

Step 1: Recall the rule.
The player to move loses when the number of sticks is \( n \equiv 1 \pmod 3 \) (1, 4, 7, ...). B wins exactly when A, who moves first, faces such a number, i.e. \( N \equiv 1 \pmod 3 \).

Step 2: Check the options.
46 = 45 + 1 (remainder 1), 47 (remainder 2), 48 (remainder 0), 49 = 48 + 1 (remainder 1). So 46 and 49 are wins for B.

Step 3: Largest below 50.
49 is the largest.

Final Answer:
The correct option is (3): 49
Was this answer helpful?
0
0