CAT 2019 Slot 1 DILR Q9

  • Data Interpretation and Logical Reasoning
  • Logical Reasoning › Math Puzzles
  • Medium
  • Type in the answer (TITA)
  • CAT_2019_SLOT1_DILR_Q09

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 9

What is the minimum possible number of different types of prizes?

Type-in-the-answer (TITA) question: no options are given; enter the value.

Answer this question Opens in practice mode, free, no sign-in.

Show answer and solution

Answer:

2

Solution

Concept: Geometric Progression Lower Bounds & Minimal Type Partitioning

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

• Passage Invariant Decomposition:

• Exactly 100 boxes numbered 1 to 100 contain one mystery prize each: ∑i=1kn(xi)=100\sum_{i=1}^k n(x_i) = 100.

• Prize types a,b,c,…a, b, c, \dots are ordered by decreasing value.

• Type aa is the diamond ring, fixed at exactly one unit: n(a)=1n(a) = 1.

• Quantities at least double for each successive type: n(xi+1)≥2⋅n(xi)n(x_{i+1}) \ge 2 \cdot n(x_i).

• Infeasibility of Single Prize Type (k=1k = 1):

• If only one prize type existed (k=1k = 1), all 100 boxes would contain type aa, requiring n(a)=100n(a) = 100.

• This directly contradicts the passage invariant n(a)=1n(a) = 1. Thus, k≥2k \ge 2.

• Constructive Proof of Feasibility for Two Types (k=2k = 2):

• Consider two prize types: type aa and type bb.

• Fix n(a)=1n(a) = 1, and allocate the remaining 100−1=99100 - 1 = 99 boxes to type bb: n(b)=99n(b) = 99.

• Verifying the doubling inequality:

$$n(b) \ge 2 \cdot n(a) \iff 99 \ge 2 \cdot 1 = 2$$

• Since 99≥299 \ge 2 holds, all passage rules are satisfied: n(a)=1n(a) = 1, n(b)=99n(b) = 99, and n(a)+n(b)=100n(a) + n(b) = 100.

• Thus, the minimum possible number of different prize types is 2.

• Numerical Answer:

• 2.

Topper Take

• Spotting the Invariant Trap: Since type aa is strictly capped at 1 item, k=1k=1 is impossible. Allocating all remaining 99 items to type bb satisfies b≥2ab \ge 2a immediately, settling this TITA question in under 20 seconds.

Other questions in this set

  1. Q10. What is the maximum possible number of different types of prizes?
  2. Q11. Which of the following is not possible?
  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