Q1:

2026: Actual Paper

Puzzles

Medium

N is a whole number between 1 and 25, inclusive of both. The following statements are made about N. Each statement may be either correct or incorrect.

I) N is even.

II) N is a multiple of 3.

III) N is greater than 12.

IV) N is a multiple of 4.

V) N is a multiple of 5.

For how many values of N, EXACTLY one of the above statements about N is incorrect?

Answer options
Option 1
Correct Answer
Explanation for 2026: Actual Paper LR question 1

Q2:

2026: Actual Paper

Puzzles

Hard

A date from the current year is chosen from the twelve listed below.

March 17, March 19, April 19, May 15, May 16, May 19, May 20, June 18, July 14, July 15, July 16, July 18.

Mathew is told only the month part of the chosen date, while Hari is told only the day of the month, but not the month. At the beginning itself, both are aware of the complete list of twelve possible dates. Consider the following sequence of statements below to be true.

  • Mathew: "I do not know the date."
  • Hari: "I do not know it either."
  • Mathew: "I still do not know it."
  • Hari: "I know the date now."

Which date was chosen?

Answer options
Option 4
Correct Answer
Explanation for 2026: Actual Paper LR question 2

Q3:

2026: Actual Paper

Puzzles

Hard

A security door opens for some badges and not for others. Every badge has three attributes, with permitted values as given below:

AttributePermitted values
Shapecircle or square or triangle
Colourred or blue or green
Bordersolid or dashed

The door's rule has the following characteristics:

  • The rule carries at most one condition per attribute.
  • A condition names a single permitted value for that attribute.
  • An attribute carrying no condition is unrestricted.
  • The door opens only for those badges that satisfy every condition in the rule.

For example, one possible rule is "green and solid", which would open for every green badge with a solid border, of any shape. Another possible rule is "triangle", which would open for every triangular badge, irrespective of its colour and border.

Two badges have been tested with the present rule. The attributes of the badges and the corresponding results are given below.

Badge No.AttributesResult
1circle, red, soliddoes not open
2circle, green, dashedopens

How many rules are possible?

Answer options
Option 2
Correct Answer
Explanation for 2026: Actual Paper LR question 3

Q4:

2026: Actual Paper

Puzzles

Medium

A security door opens for some badges and not for others. Every badge has three attributes, with permitted values as given below:

AttributePermitted values
Shapecircle or square or triangle
Colourred or blue or green
Bordersolid or dashed

The door's rule has the following characteristics:

  • The rule carries at most one condition per attribute.
  • A condition names a single permitted value for that attribute.
  • An attribute carrying no condition is unrestricted.
  • The door opens only for those badges that satisfy every condition in the rule.

For example, one possible rule is "green and solid", which would open for every green badge with a solid border, of any shape. Another possible rule is "triangle", which would open for every triangular badge, irrespective of its colour and border.

Two badges have been tested with the present rule. The attributes of the badges and the corresponding results are given below.

Badge No.AttributesResult
1circle, red, soliddoes not open
2circle, green, dashedopens

Which badge(s) among the following combination of attributes is/are certain not to open the door?

(i) triangle, blue, dashed

(ii) square, green, solid

Answer options
Option 2
Correct Answer
Explanation for 2026: Actual Paper LR question 4

Q5:

2026: Actual Paper

Puzzles

Hard

A security door opens for some badges and not for others. Every badge has three attributes, with permitted values as given below:

AttributePermitted values
Shapecircle or square or triangle
Colourred or blue or green
Bordersolid or dashed

The door's rule has the following characteristics:

  • The rule carries at most one condition per attribute.
  • A condition names a single permitted value for that attribute.
  • An attribute carrying no condition is unrestricted.
  • The door opens only for those badges that satisfy every condition in the rule.

For example, one possible rule is "green and solid", which would open for every green badge with a solid border, of any shape. Another possible rule is "triangle", which would open for every triangular badge, irrespective of its colour and border.

Two badges have been tested with the present rule. The attributes of the badges and the corresponding results are given below.

Badge No.AttributesResult
1circle, red, soliddoes not open
2circle, green, dashedopens

Testing a badge with which combination of the attributes from the following would yield no additional information about the present rule?

(i) square, blue, solid

(ii) triangle, red, solid

Answer options
Option 3
Correct Answer
Explanation for 2026: Actual Paper LR question 5

Q6:

2026: Actual Paper

Puzzles

Hard

A security door opens for some badges and not for others. Every badge has three attributes, with permitted values as given below:

AttributePermitted values
Shapecircle or square or triangle
Colourred or blue or green
Bordersolid or dashed

The door's rule has the following characteristics:

  • The rule carries at most one condition per attribute.
  • A condition names a single permitted value for that attribute.
  • An attribute carrying no condition is unrestricted.
  • The door opens only for those badges that satisfy every condition in the rule.

For example, one possible rule is "green and solid", which would open for every green badge with a solid border, of any shape. Another possible rule is "triangle", which would open for every triangular badge, irrespective of its colour and border.

Two badges have been tested with the present rule. The attributes of the badges and the corresponding results are given below.

Badge No.AttributesResult
1circle, red, soliddoes not open
2circle, green, dashedopens

Suppose a third badge with attributes - circle, green, solid - is now tested, and the door opens. How many rules remain possible now?

Answer options
Option 2
Correct Answer
Explanation for 2026: Actual Paper LR question 6

Q7:

2026: Actual Paper

Puzzles

Hard

A pile holds 21 matchsticks. Two players Anil and Bela, make moves alternately. A move consists of removing either 1, or 2 or 3 sticks. Whoever takes the last stick wins. Anil makes the first move.

Assume that both players adopt the best strategy. Who would win and what is the correct opening move?

Answer options
Option 4
Correct Answer
Explanation for 2026: Actual Paper LR question 7

Q8:

2026: Sample Paper

Puzzles

Hard

The numbers 1,2,3,…,201,2,3,\ldots,20 are written on a board.

A move is made as follows: choose any two numbers currently on the board, rub out both of them, and write one new number equal to the larger number minus the smaller number.

Every move leaves the board with one number fewer. The process continues until only one number remains.

Which one of the following CANNOT be the number finally left?

Answer options
Option 3
Correct Answer
Explanation for 2026: Sample Paper LR question 8

Q9:

2026: Sample Paper

Puzzles

Hard

The numbers 1,2,3,…,201,2,3,\ldots,20 are written on a board.

A move is made as follows: choose any two numbers currently on the board, rub out both of them, and write one new number equal to the larger number minus the smaller number.

Every move leaves the board with one number fewer. The process continues until only one number remains.

Suppose instead that the numbers 1,2,3,…,211,2,3,\ldots,21 are written on the board at the start, and the same moves are made until one number is left. Which one of the following could be the number finally left?

Answer options
Option 3
Correct Answer
Explanation for 2026: Sample Paper LR question 9

Q10:

2026: Sample Paper

Puzzles

Hard

The numbers 1,2,3,…,201,2,3,\ldots,20 are written on a board.

A move is made as follows: choose any two numbers currently on the board, rub out both of them, and write one new number equal to the larger number minus the smaller number.

Every move leaves the board with one number fewer. The process continues until only one number remains.

As the moves are carried out, which one of the following never changes?

Answer options
Option 4
Correct Answer
Explanation for 2026: Sample Paper LR question 10

Q11:

2026: Sample Paper

Puzzles

Hard

The numbers 1,2,3,…,201,2,3,\ldots,20 are written on a board.

A move is made as follows: choose any two numbers currently on the board, rub out both of them, and write one new number equal to the larger number minus the smaller number.

Every move leaves the board with one number fewer. The process continues until only one number remains.

Suppose instead that the numbers written on the board at the start are 3,6,9,…,603,6,9,\ldots,60, the first twenty multiples of 3. The same moves are then made until one number is left. Which one of the following CANNOT be the number finally left?

Answer options
Option 1
Correct Answer
Explanation for 2026: Sample Paper LR question 11

Q12:

2026: Sample Paper

Puzzles

Medium

Exactly one of 100 cables is faulty. The cables can be tested in groups with any number of cables in a group. A tester can be connected to any group of cables and reports only whether the faulty cable lies somewhere in that group. Each test may be chosen after seeing the result of the one before it. What is the least number of tests that guarantees finding the faulty cable?

Answer options
Option 2
Correct Answer
Explanation for 2026: Sample Paper LR question 12

Q13:

2026: Sample Paper

Puzzles

Medium

A drawer holds 12 black socks, 10 blue socks and 8 grey socks, all mixed together. Socks are taken out one at a time in the dark. What is the least number of socks that must be taken out to be certain of holding at least two socks of each of the three colours?

Answer options
Option 1
Correct Answer
Explanation for 2026: Sample Paper LR question 13

Q14:

2026: Sample Paper

Puzzles

Medium

One hundred people stand in a circle, numbered 1 to 100 clockwise. Starting with person 1, they count off round the circle and every second person leaves: person 2 goes first, then person 4, and so on. The counting continues round after round with those who remain, until one person remains. Which position is the survivor standing in?

Answer options
Option 4
Correct Answer
Explanation for 2026: Sample Paper LR question 14