Let
A = no of people who have exactly 1
B = no of people who have exactly 2
C = no of people who have exactly 3
We can set up 2 equations:
A + B + C = 40
1(A) + 2(B) + 3(C) = (23 + 28 + 31) = 82
Maximize C
Step 1: solve by subtracting the 2equations
A + 2B + 3C = 82
- ( A + B + C = 40)
____________
B + 2C = 42
“surplus” of 42——-each person who gets two will account for +1 of this surplus and each person who gets all three (and a commendation) will account for +2 of this surplus
To maximize the no. of people who are part of all 3 sets, we should minimize the no. of people part of 2 sets (i.e., minimize B)
Let B = 0 ———> 0 + 2C = 42 ——-> C = 21
If C = 21, can both of the original equations be satisfied?
A + B + 21 = 40
A + 2B + (3)(21) = 82
————————
A + B = 19
A + 2B = 82 - 63 = 19
We can have 19 people get exactly 1 pass and have 21 get all 3 passes and the commendation
21 is the Maximum Value of C
Minimum
A + B + C = 40
To minimize the no. of ppl who pass all three (C) ———> we should Maximize the no. of ppl who pass exactly two (B)———-> for which we should Minimize the no. of ppl who pass exactly one (A)
Case 1: let’s try A = 0
0 + B + C = 40
0 + 2B + 3C = 82
———————
To solve for both equations through combination, multiply the 1st equation by *(-2) on each side and then Add the two equations
2B + 3C = 82
+ (-2B - 2C = 80)
_____________
C = 2 = Minimum no. of people part of all three sets
Does C = 2 and A = 0 satisfy our equations?
40 = 0 + B + 2 ————> B = 38 ppl who pass Exactly Two
82 = 0 + 2B + (3)(2)
76 = 2B ———> B = 38 ppl who pass exactly two
Works!
Answer:
Max = 21
Min = 2
Posted from my mobile device