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.
Show answer and solution
Answer:
2
Solution
Concept: Geometric Progression Lower Bounds & Minimal Type Partitioning
Master State Table
| Prize Tier | Value Rank | Recurrence Inequality | Min Count | Cumulative Min | Feasibility () |
|---|---|---|---|---|---|
| Type a | Rank 1 (Highest) | Passage invariant: | 1 | 1 | Baseline diamond ring |
| Type b | Rank 2 | 2 | 3 | Feasible () | |
| Type c | Rank 3 | 4 | 7 | Feasible () | |
| Type d | Rank 4 | 8 | 15 | Feasible () | |
| Type e | Rank 5 | 16 | 31 | Feasible () | |
| Type f | Rank 6 | 32 | 63 | Feasible () | |
| Type g | Rank 7 | 64 | 127 | Infeasible () | |
| Total Pool | Up to | 100 | Box order arbitrary |
Question Deduction
• Passage Invariant Decomposition:
• Exactly 100 boxes numbered 1 to 100 contain one mystery prize each: .
• Prize types are ordered by decreasing value.
• Type is the diamond ring, fixed at exactly one unit: .
• Quantities at least double for each successive type: .
• Infeasibility of Single Prize Type ():
• If only one prize type existed (), all 100 boxes would contain type , requiring .
• This directly contradicts the passage invariant . Thus, .
• Constructive Proof of Feasibility for Two Types ():
• Consider two prize types: type and type .
• Fix , and allocate the remaining boxes to type : .
• Verifying the doubling inequality:
$$n(b) \ge 2 \cdot n(a) \iff 99 \ge 2 \cdot 1 = 2$$
• Since holds, all passage rules are satisfied: , , and .
• Thus, the minimum possible number of different prize types is 2.
• Numerical Answer:
• 2.
Topper Take
• Spotting the Invariant Trap: Since type is strictly capped at 1 item, is impossible. Allocating all remaining 99 items to type satisfies immediately, settling this TITA question in under 20 seconds.
Other questions in this set
- Q10. What is the maximum possible number of different types of prizes?
- Q11. Which of the following is not possible?
- 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
- CAT 2025 Slot 1 DILR Q9
- CAT 2025 Slot 1 DILR Q10
- CAT 2025 Slot 1 DILR Q11
- CAT 2025 Slot 1 DILR Q12
- CAT 2025 Slot 1 DILR Q13
Practise this question with timing, notes and your mistake notebook.
Practise in PrepSoc