CAT 2019 Slot 1 DILR Q12

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

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 12

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 of the same type as box 45 in boxes 1 to 44 and 43 items of the same type as box 45 in boxes 46 to 100.

What is the maximum possible number of different types of items?

  1. A

    6

    Answer A in PrepSoc practice
  2. B

    4

    Answer B in PrepSoc practice
  3. C

    3

    Answer C in PrepSoc practice
  4. D

    5

    Answer D in PrepSoc practice

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

Show answer and solution

Answer: (D)

5

Solution

Concept: Subset Partition Summation & Residual Capacity Optimization

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

• Deconstructing the Segmented Box Clue:

• Let TT denote the prize type inside box 45.

• Aggregating across the three disjoint segments:

• Boxes 1 to 44: 31 items of type $T$.

• Box 45: 1 item of type $T$ (by definition).

• Boxes 46 to 100: 43 items of type $T$.

$$n(T) = 31 + 1 + 43 = 75$$

• Determining the Structural Position of Type TT:

• Type TT cannot be type aa since n(a)=1≠75n(a) = 1 \ne 75.

• If a subsequent type TnextT_{\text{next}} existed, doubling would force n(Tnext)≥2(75)=150>100n(T_{\text{next}}) \ge 2(75) = 150 > 100.

• Since 150 items exceed total box capacity, no type can follow TT. Thus, type TT is terminal.

• Maximizing Preceding Types within Residual Capacity:

• All preceding types must fit within the remaining capacity: 100−75=25100 - 75 = 25.

• To maximize distinct types, we minimize earlier counts: n(a)=1n(a) = 1, min⁡n(b)=2\min n(b) = 2, min⁡n(c)=4\min n(c) = 4, min⁡n(d)=8\min n(d) = 8.

• Cumulative sum for these 4 types is 1+2+4+8=15≤251 + 2 + 4 + 8 = 15 \le 25.

• An additional preceding type would require at least 2(8)=162(8) = 16 items, yielding 15+16=31>2515 + 16 = 31 > 25, which is impossible.

• Thus, at most 4 types (a,b,c,da, b, c, d) can precede type TT.

• Including terminal type TT itself (T=eT = e), the maximum possible number of distinct types is 4+1=54 + 1 = 5.

• Constructive Feasibility for 5 Types:

• Assign n(a)=1,n(b)=2,n(c)=4,n(d)=18,n(e)=75n(a) = 1, n(b) = 2, n(c) = 4, n(d) = 18, n(e) = 75.

• Checking inequalities: 2≥2,4≥4,18≥8,75≥362 \ge 2, 4 \ge 4, 18 \ge 8, 75 \ge 36. Sum = 100. Fully valid.

• Option Matching:

• The maximum possible number of different types of items is 5.

• Distractors 6, 4, and 3 are either infeasible or suboptimal. Choice 5 corresponds to Option 4.

• Therefore, Option 4 is the correct choice.

Topper Take

• Residual Bound Triage: Summing 31+1+43=7531 + 1 + 43 = 75 shows that one type takes 75 boxes. Doubling requires 2×75=150>1002 \times 75 = 150 > 100, confirming it is terminal. The remaining 25 boxes fit at most 4 types (1+2+4+8=15≤251 + 2 + 4 + 8 = 15 \le 25, while adding 16 gives 31>2531 > 25). Thus, 4+1=54 + 1 = 5 types total, yielding Option 4 in under 45 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. Q11. Which of the following is not possible?

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