CAT 2019 Slot 1 DILR Q11

  • Data Interpretation and Logical Reasoning
  • Logical Reasoning › Math Puzzles
  • Medium
  • Multiple choice
  • CAT_2019_SLOT1_DILR_Q11

Data set · questions 9–12

A new game show on TV has 100 boxes numbered 1, 2,..., 100 in a row, each containing a mystery prize. The prizes are items of different types, a, b, c, ..., in decreasing order of value. The most expensive item is of type a, a diamond ring, and there is exactly one of these. You are told that the number of items at least doubles as you move to the next type. For example, there would be at least twice as many items of type b as of type a, at least twice as many items of type c as of type b and so on. There is no particular order in which the prizes are placed in the boxes.

Question 11

Which of the following is not possible?

  1. A

    There are exactly 60 items of type d.

    Answer A in PrepSoc practice
  2. B

    There are exactly 30 items of type b

    Answer B in PrepSoc practice
  3. C

    There are exactly 45 items of typе с

    Answer C in PrepSoc practice
  4. D

    There are exactly 75 items of type e

    Answer D in PrepSoc practice

Answer this questionOr tap an option. Opens in practice mode, free, no sign-in.

Show answer and solution

Answer: (C)

There are exactly 45 items of typе с

Solution

Concept: System of Diophantine Inequalities & Option Feasibility Testing

Master State Table

Prize TierValue RankRecurrence InequalityMin CountCumulative MinFeasibility (N≤100N \le 100)
Type aRank 1 (Highest)Passage invariant: n(a)=1n(a) = 111Baseline diamond ring
Type bRank 2n(b)≥2⋅n(a)n(b) \ge 2 \cdot n(a)23Feasible (3≤1003 \le 100)
Type cRank 3n(c)≥2⋅n(b)n(c) \ge 2 \cdot n(b)47Feasible (7≤1007 \le 100)
Type dRank 4n(d)≥2⋅n(c)n(d) \ge 2 \cdot n(c)815Feasible (15≤10015 \le 100)
Type eRank 5n(e)≥2⋅n(d)n(e) \ge 2 \cdot n(d)1631Feasible (31≤10031 \le 100)
Type fRank 6n(f)≥2⋅n(e)n(f) \ge 2 \cdot n(e)3263Feasible (63≤10063 \le 100)
Type gRank 7n(g)≥2⋅n(f)n(g) \ge 2 \cdot n(f)64127Infeasible (127>100127 > 100)
Total PoolUp to k≤6k \le 6∑i=1kn(xi)=100\sum_{i=1}^k n(x_i) = 100n(xi)≥1n(x_i) \ge 1100Box order 1…1001 \dots 100 arbitrary

Question Deduction

• Analytical Framework:

• A configuration is feasible if positive integers n(xi)n(x_i) satisfy n(a)=1n(a) = 1, n(xi+1)≥2⋅n(xi)n(x_{i+1}) \ge 2 \cdot n(x_i), and ∑n(xi)=100\sum n(x_i) = 100.

• Rigorous Disproof of Option 3 (n(c)=45n(c) = 45):

• Suppose n(c)=45n(c) = 45.

• If type dd exists, doubling mandates n(d)≥2(45)=90n(d) \ge 2(45) = 90, requiring total items ≥1+2+45+90=138>100\ge 1 + 2 + 45 + 90 = 138 > 100, which is impossible. Thus, type cc must be terminal (k=3k = 3).

• If type cc is terminal, sum conservation requires 1+n(b)+45=100  ⟹  n(b)=541 + n(b) + 45 = 100 \implies n(b) = 54.

• Checking doubling between types bb and cc:

$$n(c) \ge 2 \cdot n(b) \iff 45 \ge 2 \cdot 54 = 108$$

• This is a contradiction (45<10845 < 108).

• Enforcing n(c)≥2⋅n(b)n(c) \ge 2 \cdot n(b) caps n(b)≤⌊45/2⌋=22n(b) \le \lfloor 45 / 2 \rfloor = 22, yielding at most 1+22+45=68<1001 + 22 + 45 = 68 < 100 items and leaving 32 boxes unfilled.

• Hence, having exactly 45 items of type cc is strictly impossible.

• Validation of Feasible Alternative Options:

• Option 1 (n(d)=60n(d) = 60): Feasible with a=1,b=9,c=30,d=60a=1, b=9, c=30, d=60 (9≥2,30≥18,60≥609 \ge 2, 30 \ge 18, 60 \ge 60; sum = 100).

• Option 2 (n(b)=30n(b) = 30): Feasible with a=1,b=30,c=69a=1, b=30, c=69 (30≥2,69≥6030 \ge 2, 69 \ge 60; sum = 100).

• Option 4 (n(e)=75n(e) = 75): Feasible with a=1,b=2,c=4,d=18,e=75a=1, b=2, c=4, d=18, e=75 (2≥2,4≥4,18≥8,75≥362 \ge 2, 4 \ge 4, 18 \ge 8, 75 \ge 36; sum = 100).

• Option Matching:

• Options 1, 2, and 4 are possible. Option 3 is impossible as it violates doubling (45<10845 < 108).

• Therefore, Option 3 is the correct response.

Topper Take

• Two-Step Mental Filter: If c=45c = 45, type dd requires ≥90\ge 90 items (45+90>10045 + 90 > 100), forcing cc to be terminal. But then b=100−45−1=54b = 100 - 45 - 1 = 54, which contradicts c≥2bc \ge 2b (45<10845 < 108). This simple check identifies Option 3 in under 40 seconds.

Other questions in this set

  1. Q9. What is the minimum possible number of different types of prizes?
  2. Q10. What is the maximum possible number of different types of prizes?
  3. Q12. You ask for the type of item in box 45. Instead of being given a direct answer, you are told that there are 31 items…

Math Puzzles questions from other CAT papers

  1. CAT 2025 Slot 1 DILR Q9
    What was the occupancy factor for segment D – E?
  2. CAT 2025 Slot 1 DILR Q10
    How many tickets were booked from Station A to Station E?
  3. CAT 2025 Slot 1 DILR Q11
    How many tickets were booked from Station C?
  4. CAT 2025 Slot 1 DILR Q12
    What is the difference between the number of tickets booked to Station C and the number of tickets booked to…
  5. CAT 2025 Slot 1 DILR Q13
    How many tickets were booked to travel in exactly one segment?

Practise this question with timing, notes and your mistake notebook.

Practise in PrepSoc