.
For convenience, I will represent the given part in modified form
by numbering statements for easy referring.
A survey of 130 pet owners yielded the following information:
(1) 47 own fish; 53 own a bird; 50 own a cat; 64 own a dog;
(2) 2 own all four;
(3) 11 own only fish; 14 own only a bird;
(4) 10 own fish and a bird; 21 own fish and a cat; 24 own a bird and a dog; 27 own a cat and a dog;
(5) 3 own fish, a bird, a cat, and no dog;
(6) 1 owns fish, a bird, a dog, and no cat;
(7) 9 own fish, a cat, a dog, and no bird;
(8) 10 own a bird, a cat, a dog, and no fish.
How many of the surveyed pet owners have no fish, no birds, no cats, and no dogs?
(They own other types of pets.)
~~~~~~~~~~~~~~~~~
I present here another solution, which entirely is build on using Inclusion-Exclusion principle.
Simply saying, they want you find the union set of owners, who own either fish, or birds, or cats or dogs,
and then calculate the COMPLEMENT of this set to 130.
It would be a standard Inclusion-Exclusion problem, if the numbers of elements in single sets
F (fish owners), B(bird owners), C (cat owners) and D (dog owners) be given, along with
their in-pairs intersections, triple intersections and quadruple intersection.
But in the problem, the given are other combinations of intersections.
THEREFORE, if you want to reduce the problem to standard Inclusion-Exclusion, you should restore
information about standard intersection subsets, based on given data.
We just have single subsets F, B, C, D given in statement (1), and a quadruple intersetion given in statement (2).
From statements (5), (6), (7), and (8), we can easy restore all triple intersections by adding FBCD = 2
to given values in (5), (6) (7) and (8)
FBC = 3 + 2 = 5; (11)
FBD = 1 + 2 = 3; (12)
FCD = 9 + 2 = 11; (13)
BCD = 10 + 2 = 12. (14)
Regarding in-pair intersections, we just have given FB = 10, FC = 21, BD = 24, CD = 27 in statement (4).
So, of in-pair intersections, we need to restore FD and BC, that are not given in the input.
It is obvious, that the set F - F_only is the union of three subsets FB, FC and FD:
F - F_only = FB U FC U FD; so n(F - F_only) = FB + FC+ FD, or (applying Inclusion-Exclusion)
47 - 11 = FB + FC + FD - FBC - FBD - FCD + FBCD = 10 + 21 + FD - 5 - 3 - 11 + 2.
It gives an equation 36 = 14 + FD, from which FD = 36-14 = 22.
Similarly, the set B - B_only is the union of three subsets FB, BC and BD:
B - B_only = FB U BC U BD; so n(B - B_only) = FB + BC+ BD, or (applying Inclusion-Exclusion)
53 - 14 = FB + BC + BD - FBC - FBD - BCD + FBCD = 10 + BC + 24 - 5 - 3 - 12 + 2.
It gives an equation 39 = 16 + BC, from which BC = 39-16 = 23.
Now the union (F U B U C U D) contains, according to Inclusion-Exclusion principle,
F + B + C + D - FB - FC - FD - BC - BD - CD + FBC + FBD + FCD + BCD - FBCD =
= 47 + 53 + 50 + 64 - 10 - 21 - 22 - 23 - 24 - 27 + 5 + 3 + 11 + 12 - 2 = 116 owners.
The complement of 116 to 130 is 14 owners.
ANSWER. 14 owners have other types of pets.
Solved.
--------------
Notice that in my solution, the meaning of symbols FB, FC, FD, BC, BD, CD, FBC, FBD, FCD, BCD, FBCD
is different from that in the post of the other tutor.
In my post, they mean in-pair, triples and quadruple intersection of the base subsets F, B, C and D.
///////////////////
On inclusion-exclusion principle, see this Wikipedia article
https://en.wikipedia.org/wiki/Inclusion%E2%80%93exclusion_principle
To see many other similar (and different) solved problems, see the lessons
- Counting elements in sub-sets of a given finite set
- Advanced problems on counting elements in sub-sets of a given finite set
- Challenging problems on counting elements in subsets of a given finite set
- Selected problems on counting elements in subsets of a given finite set
- Inclusion-Exclusion principle problems
in this site.