CAT 2022 Slot 1 Quant Q5
- Quantitative Aptitude
- Modern Math › Set Theory
- Hard
- Multiple choice
- CAT_2022_SLOT1_QA_Q05
Question 5
In a class of students, like coffee, like tea and like lemonade. It may be possible that some students do not like any of these three drinks. Then the difference between the maximum and minimum possible number of students who like all the three drinks is
Show answer and solution
Answer: (C)
Solution
-
Maximize the intersection: It's just the size of the smallest group. .
-
Minimize the intersection: Count the "haters" (complements).
-
Haters: no coffee, no tea, no lemonade.
-
Max total haters if they are all different people = .
-
Remaining people MUST like all three: .
-
Difference = . Done in 15 seconds!
Detailed explanation
Concept: Set Theory and Venn Diagrams
Let the total number of students be .
Let , , and .
We need to find the maximum and minimum possible values of .
To find the maximum intersection, we assume the sets are as subset-like as possible.
The maximum value of is limited by the smallest set.
Thus, Max .
To find the minimum intersection, we use the principle of inclusion-exclusion and complementary sets.
Let be the number of students who DO NOT like Coffee, Tea, and Lemonade respectively.
.
.
.
The maximum number of students who do not like AT LEAST ONE drink is the sum of these non-likers: .
The minimum number of students who like ALL THREE drinks occurs when the non-likers are entirely distinct.
Min .
Min .
Max = 52, Min = 5.
Difference = .
Practise similar questions
Practice 1 CAT_2022_SLOT1_QA_Q05_SQ01
In a sports club of members, play tennis, play badminton and play squash. It may be possible that some members do not play any of these three sports. Then the difference between the maximum and minimum possible number of members who play all the three sports is
Show answer and solution
Answer: (B)
Solution
-
Maximum intersection is capped by the smallest set: .
-
To minimize intersection, maximize the non-players (complements): , , .
-
Total non-players if mutually disjoint: .
-
Minimum playing all three: (or using ).
-
Difference between max and min: .
Practice 2 CAT_2022_SLOT1_QA_Q05_SQ02
In a tech company of engineers, know Python, know Java and know C++. It may be possible that some engineers do not know any of these three programming languages. Then the difference between the maximum and minimum possible number of engineers who know all the three languages is
Show answer and solution
Answer: (C)
Solution
-
Maximum intersection is simply the smallest group size: .
-
Count the non-proficient engineers for each language: , , and .
-
Maximum possible non-proficient engineers if sets do not overlap: .
-
Minimum engineers knowing all three: .
-
Difference between maximum and minimum: .
Set Theory questions from other CAT papers
- CAT 2025 Slot 3 Quant Q6
- CAT 2024 Slot 3 Quant Q9
- CAT 2020 Slot 2 Quant Q20
- CAT 2019 Slot 1 Quant Q14
- CAT 2018 Slot 1 Quant Q30
Practise this question with timing, notes and your mistake notebook.
Practise in PrepSoc