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