Professional Documents
Culture Documents
WS 1.1.2 - Sets
WS 1.1.2 - Sets
______________1. If 𝐴 = {𝑎|𝑎 𝑖𝑠 𝑎 𝑐𝑜𝑛𝑠𝑜𝑛𝑎𝑛𝑡 𝑙𝑒𝑡𝑡𝑒𝑟} and 𝐸 = {𝑎, 𝑒, 𝑖, 𝑜, 𝑢}, then sets A and E are disjoint sets.
______________2. If 𝐴 = {𝑝, 𝑟, 𝑖, 𝑑, 𝑒}, and 𝑁 = {𝑛, 𝑜, 𝑖, 𝑠, 𝑒}, then 𝐴 = 𝑁.
______________3. If 𝐺 = {𝑔|𝑔 𝑖𝑠 𝑎 𝑣𝑜𝑤𝑒𝑙 𝑙𝑒𝑡𝑡𝑒𝑟 𝑓𝑟𝑜𝑚 𝑡ℎ𝑒 𝑤𝑜𝑟𝑑 “giraffe”}, then 𝑛F𝑃(𝐺)J = 8.
______________4. If 𝐿 = {0, 2, 4, 6, 8} 𝑎𝑛𝑑 𝑂 = {2, 4, 8}, then 𝑂 ⊂ 𝐿.
______________5. If 𝑛(𝐾) = 4, then set K has at most 18 possible subsets.
______________6. If 𝑀 = {𝑚|𝑚 > 5, 𝑚 𝑖𝑠 𝑎 𝑛𝑎𝑡𝑢𝑟𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟}, then set M is a finite set.
______________7. If 𝑆 = {𝑐, ℎ, 𝑒, 𝑠, 𝑘, 𝑎} and 𝑇 = {𝑠, 𝑎, 𝑚, 𝑢, 𝑒, 𝑙 }, then 𝑆 » 𝑇.
𝑞|5 < 𝑞 < 8,
______________8. If 𝑃 = {𝑝|5 < 𝑝 < 8, 𝑝 𝑖𝑠 𝑎 𝑐𝑜𝑢𝑛𝑡𝑖𝑛𝑔 𝑛𝑢𝑚𝑏𝑒𝑟}, 𝑄 = ^ `, then 𝑃 Í 𝑄.
𝑞 𝑖𝑠 𝑎 𝑤ℎ𝑜𝑙𝑒 𝑛𝑢𝑚𝑏𝑒𝑟
______________9. An empty set is a subset of any set.
______________10. Any set is a proper subset of the set itself.
______________11. If 𝑀 = {𝑠, 𝑒, 𝑐, 𝑜, 𝑛, 𝑑, 𝑎, 𝑟, 𝑦} and 𝐼 = {𝑑, 𝑖, 𝑎, 𝑟, 𝑦}, find 𝑀 ∩ 𝐼.
______________12. If 𝐶 = {𝑐, 𝑜, 𝑢, 𝑟, 𝑎, 𝑔, 𝑒} and 𝐻 = {𝑓, 𝑒, 𝑎, 𝑟}, find 𝐶 − 𝐻.
Set U
Set N
Set O
𝑵−𝑶
𝑵−𝑶
𝑵Ç𝑶 𝑶′
𝑵È𝑶 𝑵′
𝑷(𝑶)