Scribd
Upload
359 views5 pages

Set Theory: Different Types On Word Problems On Sets

This document contains examples of word problems involving sets and their solutions. It demonstrates using set operations like union, intersection and complements to calculate the number of elements in different sets based on information provided in the word problems. Formulas involving set operations are used to systematically arrive at the solutions. Various types of word problems involving people in groups, students in classes, awards in categories etc. are solved using concepts of sets and relationships between sets.

Uploaded by

Denaiya Watton Leeh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
359 views5 pages

Set Theory: Different Types On Word Problems On Sets

This document contains examples of word problems involving sets and their solutions. It demonstrates using set operations like union, intersection and complements to calculate the number of elements in different sets based on information provided in the word problems. Formulas involving set operations are used to systematically arrive at the solutions. Various types of word problems involving people in groups, students in classes, awards in categories etc. are solved using concepts of sets and relationships between sets.

Uploaded by

Denaiya Watton Leeh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as ODT, PDF, TXT or read online on Scribd
You are on page 1/ 5

Set Theory

1. Let A and B be two finite sets such that n(A) = 20, n(B) = 28 and n(A B) = 36, find n(A B).
Solution:
Usin the fo!"u#a n(A B) = n(A) $ n(B) % n(A B).
then n(A B) = n(A) $ n(B) % n(A B)
= 20 $ 28 % 36
= &8 % 36
= 12
2. 'f n(A % B) = 18, n(A B) = (0 and n(A B) = 2), then find n(B).
Solution:
Usin the fo!"u#a n(A B) = n(A % B) $ n(A B) $ n(B % A)
(0 = 18 $ 2) $ n(B % A)
(0 = &3 $ n(B % A)
n(B % A) = (0 % &3
n(B % A) = 2(
*ow n(B) = n(A B) $ n(B % A)
= 2) $ 2(
= )2
Different types on word problems on sets:
3. 'n a !ou+ of 60 +eo+#e, 2( #i,e co#d d!in,s and &2 #i,e hot d!in,s and each +e!son #i,es at #east one
of the two d!in,s. -ow "an. #i,e both coffee and tea/
Solution:
Let A = 0et of +eo+#e who #i,e co#d d!in,s.
B = 0et of +eo+#e who #i,e hot d!in,s.
Given
(A B) = 60 n(A) = 2( n(B) = &2 then1
n(A B) = n(A) $ n(B) % n(A B)
= 2( $ &2 % 60
= 62 % 60 = 2
= 2
3he!efo!e, 2 +eo+#e #i,e both tea and coffee.
4. 3he!e a!e 3) students in a!t c#ass and )( students in dance c#ass. 4ind the nu"be! of students who a!e
eithe! in a!t c#ass o! in dance c#ass.
5 6hen two c#asses "eet at diffe!ent hou!s and 12 students a!e en!o##ed in both acti7ities.
5 6hen two c#asses "eet at the sa"e hou!.
Solution:
n(A) = 3), n(B) = )(, n(A B) = 12
(Let A be the set of students in a!t c#ass.
B be the set of students in dance c#ass.)
(i) 6hen 2 c#asses "eet at diffe!ent hou!s n(A B) = n(A) $ n(B) % n(A B)
= 3) $ )( % 12
= 22 % 12
= 80
(ii) 6hen two c#asses "eet at the sa"e hou!, AB = n (A B) = n(A) $ n(B) % n(A B)
= n(A) $ n(B)
= 3) $ )(
= 22
Further concept to solve word problems on sets:
5. 'n a !ou+ of 100 +e!sons, (2 +eo+#e can s+ea, 8n#ish and &3 can s+ea, 4!ench. -ow "an. can
s+ea, 8n#ish on#./ -ow "an. can s+ea, 4!ench on#. and how "an. can s+ea, both 8n#ish and
4!ench/
Solution:
Let A be the set of +eo+#e who s+ea, 8n#ish.
B be the set of +eo+#e who s+ea, 4!ench.
A % B be the set of +eo+#e who s+ea, 8n#ish and not 4!ench.
B % A be the set of +eo+#e who s+ea, 4!ench and not 8n#ish.
A B be the set of +eo+#e who s+ea, both 4!ench and 8n#ish.
Given,
n(A) = (2 n(B) = &3 n(A B) = 100
*ow, n(A B) = n(A) $ n(B) % n(A B)
= (2 $ &3 % 100
= 11) % 100
= 1)
3he!efo!e, *u"be! of +e!sons who s+ea, both 4!ench and 8n#ish = 1)
n(A) = n(A % B) $ n(A B)
n(A % B) = n(A) % n(A B)
= (2 % 1)
= )(
and n(B % A) = n(B) % n(A B)
= &3 % 1)
= 28
3he!efo!e, *u"be! of +eo+#e s+ea,in 8n#ish on#. = )(
*u"be! of +eo+#e s+ea,in 4!ench on#. = 28
Word problems on sets using the different properties (Union & Intersection):
6. 'n a co"+etition, a schoo# awa!ded "eda#s in diffe!ent cateo!ies. 36 "eda#s in dance, 12 "eda#s in
d!a"atics and 18 "eda#s in "usic. 'f these "eda#s went to a tota# of &) +e!sons and on#. & +e!sons ot
"eda#s in a## the th!ee cateo!ies, how "an. !ecei7ed "eda#s in e9act#. two of these cateo!ies/
Solution:
Let A = set of +e!sons who ot "eda#s in dance.
B = set of +e!sons who ot "eda#s in d!a"atics.
: = set of +e!sons who ot "eda#s in "usic.
Given,
n(A) = 36 n(B) = 12 n(:) = 18
n(A B :) = &) n(A B :) = &
6e ,now that nu"be! of e#e"ents be#onin to e9act#. two of the th!ee sets A, B, :
= n(A B) $ n(B :) $ n(A :) % 3n(A B :)
= n(A B) $ n(B :) $ n(A :) % 3 ; & <<..(i)
n(A B :) = n(A) $ n(B) $ n(:) % n(A B) % n(B :) % n(A :) $ n(A B :)
3he!efo!e, n(A B) $ n(B :) $ n(A :) = n(A) $ n(B) $ n(:) $ n(A B :) % n(A B :)
4!o" (i) !e=ui!ed nu"be!
= n(A) $ n(B) $ n(:) $ n(A B :) % n(A B :) % 12
= 36 $ 12 $ 18 $ & % &) % 12
= (0 % 6(
= 3
Apply set opertions to solve the word problems on sets:
7. 8ach student in a c#ass of &0 +#a.s at #east one indoo! a"e chess, ca!!o" and sc!abb#e. 18 +#a.
chess, 20 +#a. sc!abb#e and 2( +#a. ca!!o". ( +#a. chess and sc!abb#e, 12 +#a. sc!abb#e and ca!!o" and
& +#a. chess, ca!!o" and sc!abb#e. 4ind the nu"be! of students who +#a. (i) chess and ca!!o". (ii)
chess, ca!!o" but not sc!abb#e.
Solution:
Let A be the set of students who +#a. chess
B be the set of students who +#a. sc!abb#e
: be the set of students who +#a. ca!!o"
3he!efo!e, 6e a!e i7en n(A B :) = &0,
n(A) = 18, n(B) = 20 n(:) = 2(,
n(A B) = (, n(: B) = 12 n(A B :) = &
6e ha7e
n(A B :) = n(A) $ n(B) $ n(:) % n(A B) % n(B :) % n(: A) $ n(A B :)
3he!efo!e, &0 = 18 $ 20 $ 2( % ( % 12 % n(: A) $ &
&0 = 62 > 12 % n(: A)
&0 = )0 % n(: A) n(: A) = )0 % &0
n(: A) = 10
3he!efo!e, *u"be! of students who +#a. chess and ca!!o" a!e 10.
A#so, nu"be! of students who +#a. chess, ca!!o" and not sc!abb#e.
= n(: A) % n(A B :)
= 10 > &
= 6
3he!efo!e, we #ea!ned how to so#7e diffe!ent t.+es of wo!d +!ob#e"s on sets without usin ?enn
dia!a".

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy