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 100100 students, 7373 like coffee, 8080 like tea and 5252 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

  1. A

    4848

    Answer A in PrepSoc practice
  2. B

    5252

    Answer B in PrepSoc practice
  3. C

    4747

    Answer C in PrepSoc practice
  4. D

    5353

    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)

4747

Solution

  • Maximize the intersection: It's just the size of the smallest group. min⁡(73,80,52)=52\min(73, 80, 52) = 52.

  • Minimize the intersection: Count the "haters" (complements).

  • Haters: 100−73=27100-73 = 27 no coffee, 2020 no tea, 4848 no lemonade.

  • Max total haters if they are all different people = 27+20+48=9527+20+48 = 95.

  • Remaining people MUST like all three: 100−95=5100 - 95 = 5.

  • Difference = 52−5=4752 - 5 = 47. Done in 15 seconds!

Detailed explanation

Concept: Set Theory and Venn Diagrams

Let the total number of students be N=100N = 100.

Let n(C)=73n(C) = 73, n(T)=80n(T) = 80, and n(L)=52n(L) = 52.

We need to find the maximum and minimum possible values of n(C∩T∩L)n(C \cap T \cap L).

To find the maximum intersection, we assume the sets are as subset-like as possible.

The maximum value of n(C∩T∩L)n(C \cap T \cap L) is limited by the smallest set.

Thus, Max n(C∩T∩L)=min⁡(73,80,52)=52n(C \cap T \cap L) = \min(73, 80, 52) = 52.

To find the minimum intersection, we use the principle of inclusion-exclusion and complementary sets.

Let C′,T′,L′C', T', L' be the number of students who DO NOT like Coffee, Tea, and Lemonade respectively.

n(C′)=100−73=27n(C') = 100 - 73 = 27.

n(T′)=100−80=20n(T') = 100 - 80 = 20.

n(L′)=100−52=48n(L') = 100 - 52 = 48.

The maximum number of students who do not like AT LEAST ONE drink is the sum of these non-likers: 27+20+48=9527 + 20 + 48 = 95.

The minimum number of students who like ALL THREE drinks occurs when the non-likers are entirely distinct.

Min n(C∩T∩L)=N−(n(C′)+n(T′)+n(L′))n(C \cap T \cap L) = N - (n(C') + n(T') + n(L')).

Min n(C∩T∩L)=100−95=5n(C \cap T \cap L) = 100 - 95 = 5.

Max = 52, Min = 5.

Difference = 52−5=4752 - 5 = 47.

Practise similar questions

Practice 1 CAT_2022_SLOT1_QA_Q05_SQ01

In a sports club of 120120 members, 8585 play tennis, 9595 play badminton and 7070 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

  1. A

    5555

  2. B

    6060

  3. C

    6565

  4. D

    7070

Show answer and solution

Answer: (B)

6060

Solution

  • Maximum intersection is capped by the smallest set: min⁡(85,95,70)=70\min(85, 95, 70) = 70.

  • To minimize intersection, maximize the non-players (complements): 120−85=35120 - 85 = 35, 120−95=25120 - 95 = 25, 120−70=50120 - 70 = 50.

  • Total non-players if mutually disjoint: 35+25+50=11035 + 25 + 50 = 110.

  • Minimum playing all three: 120−110=10120 - 110 = 10 (or using 85+95+70−2(120)=1085 + 95 + 70 - 2(120) = 10).

  • Difference between max and min: 70−10=6070 - 10 = 60.

Practice 2 CAT_2022_SLOT1_QA_Q05_SQ02

In a tech company of 150150 engineers, 110110 know Python, 125125 know Java and 8585 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

  1. A

    6060

  2. B

    7070

  3. C

    6565

  4. D

    8585

Show answer and solution

Answer: (C)

6565

Solution

  • Maximum intersection is simply the smallest group size: min⁡(110,125,85)=85\min(110, 125, 85) = 85.

  • Count the non-proficient engineers for each language: 150−110=40150 - 110 = 40, 150−125=25150 - 125 = 25, and 150−85=65150 - 85 = 65.

  • Maximum possible non-proficient engineers if sets do not overlap: 40+25+65=13040 + 25 + 65 = 130.

  • Minimum engineers knowing all three: 150−130=20150 - 130 = 20.

  • Difference between maximum and minimum: 85−20=6585 - 20 = 65.

Set Theory questions from other CAT papers

  1. CAT 2025 Slot 3 Quant Q6
    In a class of 150 students, 75 students chose physics, 111 students chose mathematics and 40 students chose…
  2. CAT 2024 Slot 3 Quant Q9
    In a group of 250 students, the percentage of girls was at least 44\% and at most 60\% . The rest of the…
  3. CAT 2020 Slot 2 Quant Q20
    Students in a college have to choose at least two subjects from Chemistry, Mathematics and Physics. The…
  4. CAT 2019 Slot 1 Quant Q14
    A club has 256 members of whom 144 can play football, 123 can play tennis, and 132 can play cricket.…
  5. CAT 2018 Slot 1 Quant Q30
    If among 200 students, 105 like pizza and 134 like burger, then the number of students who like only burger…

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

Practise in PrepSoc