The document Sets - Examples (with Solutions), Algebra, Quantitative Aptitude part 2 Quant Notes | EduRev is a part of the Quant Course Quantitative Aptitude for GMAT.

All you need of Quant at this link: Quant

**A venn diagram is used to visually represent the relationship between various sets.**

What do each of the areas in the figure represent?

I â€“ only A;

II â€“ A and B but not C;

III â€“ Only B;

IV â€“ A and C but not B;

V â€“ A and B and C;

VI â€“ B and C but not A;

VII â€“ Only C

**n(A U B U C) = n(A) + n(B) + n(C) â€” n(A n B) â€” n(A n C) â€“ n(B n C) + n(A n B n C)**

As per the above diagram,

n(A) = I + II + IV + V

n(B) = II + III + V + VI

n(C) = IV + V + VI + VII

n(A n B) = II + V

n(B n C) = V + VI

n(C n A) = IV + V

n(A n B n C) = V

n(A U B U C) = I + II + III + IV + V + VI + VII

**Note: **While doing such questions, it is advisable that you take the least no. of variables to fill up the empty space. As a practice if n(A n B n C) is missing, take that as â€˜xâ€™ and proceed.

**For Maximum and Minimum of values**, the key point to note is:

If you allot a value to the intersection, it will get added to all the individual sets but will bring down the total.

**Example:** In a survey it was found that 80% like tea whereas 70% like coffee. What is the maximum and minimum number of those who like both?**Ans: **First thing to note is that no information is mentioned about the people who donâ€™t like either of them. So that value is flexible and can change.

n(tea) = 80

n(coffee) = 70

n(total) = 100 {This includes those who like neither.}

n(tea n coffee) = ??? {We donâ€™t know this value and it is flexible}

If we want to **maximize those who like both**, we have to maximize the value in the intersection. So, we have to minimize the value of the union.

n(tea n coffee)_{max }= 70 {It is limited by the higher of the two values}

In this case, our venn diagram will look something like this (Red is tea & Purple is coffee):

In this case 20% of people like neither tea nor coffee.

If we want to **minimize those who like both**, we have to minimize the value in the intersection. So, we have to maximize the value of the union. We know that the maximum possible value of the union ie n(tea U coffee) = 100

So, we need to figure out the surplus : n(tea) + n(coffee) = 80 + 70 = 150.

The surplus is = 150 â€“ 100 = 50

So, the value of the intersection = value of the surplus = 50

This could have also been obtained by the formula

n(a U b) = n(a) + n(b) â€“ n (a n b)

In this case, our venn diagram will look something like this (Red is tea & Purple is coffee):

In this case, there is no one who likes neither coffee nor tea.

Let us look at a slightly more complicated problem when we have to deal with three sets and the value of union of the sets is fixed.

**Example:** In a survey it was found that 40 % like tea, 50 % like coffee and 60 % like milk. Every person likes at least one of the three items â€“ tea / coffee / milk. What are the maximum and minimum possible values of those who like all three?**Solution:** Currently our Venn Diagram looks like this:

First of all, we need to figure out the surplus.

Surplus = 40 +50 + 60 â€“ 100 = 50

The surplus should be taken care of by adding to the intersection of all three or any of the two.

If we want to **maximize those who like all three**, we need to maximize the intersection of all three. Adding â€˜1â€™ to the intersection of all three takes care of a surplus of â€˜2â€™. To take care of a surplus of 50, we need to make

n (tea n coffee n milk) = 25**Note: **If the union of the sets was not fixed i.e. the line â€˜Every person likes at least one of the three items â€“ tea / coffee / milkâ€™ was not given in the question then the answer would have been 40.

Our venn diagram will now look like this:

If we want to **minimize those who like all three,** we need to minimize the intersection of all three. But we have to take care of the surplus of 50. We can do that adding them to the intersection of any two of them. Adding â€˜1â€™ to the intersection of two sets, takes care of a surplus of â€˜1â€™. So,

n (tea n coffee n milk)_{min} = 0

We can take care of the surplus 50 in many ways by adding them in any order to the intersection of two sets. Three of those many ways are given below in Venn Diagrams.

85 videos|100 docs|176 tests

### Set Theory - Miscellaneous, Quantitative Reasoning

- Video | 03:46 min
### Test: Overlapping SETS- 1

- Test | 15 ques | 30 min
### Test: Overlapping SETS- 2

- Test | 10 ques | 20 min

- Test: Sets- 2
- Test | 25 ques | 50 min
- Test: Sets- 1
- Test | 8 ques | 10 min