Scribd
Upload
148 views4 pages

CENG 196 - CE Competency Appraisal I Problem Set 1 Sets

This document contains a student's problem set involving set theory concepts. It includes 7 problems assessing the student's ability to: 1) determine if statements about set membership are true or false, 2) identify sets as finite or infinite and if elements are contained within them, 3) write sets using set-builder notation, 4) perform set operations like unions, intersections, and complements, and 5) find the Cartesian products of various sets. The problem set covers core topics in set theory and will help evaluate the student's competency in this subject area.

Uploaded by

Kurt Francis Acosta
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
148 views4 pages

CENG 196 - CE Competency Appraisal I Problem Set 1 Sets

This document contains a student's problem set involving set theory concepts. It includes 7 problems assessing the student's ability to: 1) determine if statements about set membership are true or false, 2) identify sets as finite or infinite and if elements are contained within them, 3) write sets using set-builder notation, 4) perform set operations like unions, intersections, and complements, and 5) find the Cartesian products of various sets. The problem set covers core topics in set theory and will help evaluate the student's competency in this subject area.

Uploaded by

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

Student Number: 201810657

BS Civil Engineering
Engr. Dheylvin Roy Buenaventura
CENG 196 – CE Competency Appraisal I
Problem Set 1
Sets
1. Determine if the following statements are true or false. Be sure to support your answer.
(a) 2 ∈ {0,2,4,6,8}
(b) 4 ∉ {0,2,4,6,8}
(c) 2 ∈ {0,1, {2}}
(d) {2} ∈ {0,1, {2}}
(e) {3} ∈ {{3}}
(f) ∅ ∈ {−1,0,1}
(g) ∅ ∈ {−1, ∅, 1}
(h) ∅ ∈ {−1, {∅}, 1}
2. Identify each set as finite or infinite. Then determine whether 10 is an element of the set.
(a) {4,5,6, … ,15}
(b) {1,2,3,4,5, … ,75}
1 1 1
(c) {1, 2 , 4 , 8 , … }
(d) {4,5,6, … }
(e) {𝑥|𝑥 𝑖𝑠 𝑎 𝑛𝑎𝑡𝑢𝑟𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑔𝑟𝑒𝑎𝑡𝑒𝑟 𝑡ℎ𝑎𝑛 11}
(f) {𝑥|𝑥 𝑖𝑠 𝑎 𝑛𝑎𝑡𝑢𝑟𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟 𝑔𝑟𝑒𝑎𝑡𝑒𝑟 𝑡ℎ𝑎𝑛 𝑜𝑟 𝑒𝑞𝑢𝑎𝑙 𝑡𝑜 10}
(g) {𝑥|𝑥 𝑖𝑠 𝑎 𝑓𝑟𝑎𝑐𝑡𝑖𝑜𝑛 𝑏𝑒𝑡𝑤𝑒𝑒𝑛 8 𝑎𝑛𝑑 9}
(h) {𝑥|𝑥 𝑖𝑠 𝑎𝑛 𝑒𝑣𝑒𝑛 𝑛𝑎𝑡𝑢𝑟𝑎𝑙 𝑛𝑢𝑚𝑏𝑒𝑟}
3. List the elements in each of the following sets.
6
(a) {𝑛 ∈ ℤ ∶ ∈ ℤ}
𝑛
(b) {𝑥 ∈ ℝ: 𝑥 2 + 𝑥 − 6 = 0}
1
(c) {𝑟 ∈ ℚ: 𝑟 = 𝑟}
(d) {𝑛 ∈ ℕ: 𝑛 𝑖𝑠 𝑝𝑟𝑖𝑚𝑒}
1
(e) {𝑥 ∈ ℝ: 𝑥2 = 0}
(f) {𝑟 ∈ ℚ: 𝑟 = 2𝑛𝑓𝑜𝑟 𝑛 ∈ ℤ}
4. Write each of the following sets using set-builder notation.
(a) {1,2,3,4,5}
(b) {… , −5, −3, −1,1,3,5, … }
(c) {… , −24, −18, −12, −6,0,6,12,18,24, … }
1 1 1
(d) {… , 27 , 9 , 3 , 1,3,9,27, … }
(e) {2,3,5,7,11,13,17,19,23, … }
(f) {1,2,5,10,17, … }
(g) {… , −18, −13, −8, −3,2,7,12,17,22, … }
(h) {… , −√5, −2, −√3, −√2, −1,1, √2, √3, 2, √5, … }
5. Let 𝐴 = {2,4,6,8,10,12}, 𝐵 = {2,4,8,10}, 𝐶 = {4,10,12}, 𝐷 = {2,10}, and 𝑈 = {2,4,6,8,10,12,14}.
Determine whether each statement is true or false.
(a) 𝐴 ⊆ 𝑈
(b) 𝐶 ⊆ 𝑈
(c) 𝐷 ⊆ 𝐵
(d) 𝐷 ⊆ 𝐴
(e) 𝐴 ⊆ 𝐵
(f) 𝐵 ⊆ 𝐶
(g) ∅ ⊆ 𝐴
(h) ∅ ⊆ ∅
(i) {4,8,10} ⊆ 𝐵
(j) {0,2} ⊆ 𝐷
(k) 𝐵 ⊆ 𝐷
(l) 𝐴 ⊆ 𝐶
6. Let 𝐴 = {3,5,7,11,13,17,19}, 𝐵 = {2,11,23,31}, 𝐶 = {3,17,29}, and 𝐷 = {17,19,23,29,31}with 𝑈 =
{2,3,5,7,11,13,17,19,23,29,31}. Determine the following sets.
(a) 𝐴⋂𝐵
(b) (𝐴⋃𝐵) − 𝐶
(c) 𝐷 − (𝐵⋂𝐶)
(d) (𝐵⋂𝐶) − 𝐷
(e) 𝐵̅
(f) 𝐴⋂𝐶⋂𝐷
(g) ̅̅̅̅̅̅
𝐴⋃𝐵
(h) ̅̅̅̅̅̅
𝐴̅⋃𝐶
(i) (𝐴 − 𝐵)⋃(𝐵 − 𝐴)
̅̅̅̅̅̅̅
(j) 𝐴 − 𝐶⋃𝐷
7. For sets 𝐴 = {0,1), 𝐵 = {2,4,6,8}, and 𝐶 = {𝑖, −1}, list the elements of the following sets.
(a) 𝐴 × 𝐵
(b) 𝐵 × 𝐴
(c) {𝑛 ∈ ℤ: |𝑛| < 3} × 𝐶
(d) 𝐴 × 𝐵 × 𝐶
(e) 𝐴 × (𝐶 × 𝐴)
(f) 𝐴 × ∅
(g) 𝐶 × 𝐶

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