EN g00092844@aus.

edu
(Sign out)
Home My Assignments Grades
Communication Calendar
My eBooks

Discrete Math Fall 2023, Fall 2023

INSTRUCTOR
HW-6_F23 (Homework) Abdul Jarrah
University of Sharjah

Current Score

QUESTION 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15

POINTS 1/1 8/8 10/10 10/10 1/1 17/18 2/2 5/5 9/9 8/8 9/9 5/5 6/6 1/1 7/7

TOTAL SCORE

99/100 99.0%

Due Date Past Due

WED, OCT 25, 2023

9:00 AM GMT+5

Request Extension

Assignment Submission & Scoring

Assignment Submission
For this assignment, you submit answers by questions. You are required to use a new randomization after every
1 question submissions.
Assignment Scoring
Your last submission is used for your score.

The due date for this assignment has passed.

Your work can be viewed below, but no changes can be made.

Important! Before you view the answer key, decide whether or not you plan to request an extension. Your
Instructor may not grant you an extension if you have viewed the answer key. Automatic extensions are not
granted if you have viewed the answer key.

Request Extension

Which of the following sets are equal? (Select all that apply.)

A = {6, 7, 8}

B = {x R| 5 ≤ x < 9}

C = {x R| 5 < x < 9}

D = {x Z| 5 < x < 9}

+
E = {x Z | 5 < x < 9}

Show My Work (Optional)

The following are two proofs that for all sets A and B, A − B ⊆ A. The first is less formal, and the second is more formal. Fill in the blanks.

(a) Proof: Suppose A and B are any sets. To show that A − B ⊆ A, we must show that every element in A − B A − B is in
A A . But any element in A − B is in A A and not in B B (by definition of A − B). In
particular, such an element is in A.

(b) Proof: Suppose A and B are any sets and x ∈ A − B. We must show that x ∈ A x ∈ A . By definition of set

difference, x ∈ A A and x ∉ B B . In particular, x ∈ A A [which is what was to be

shown].

Show My Work (Optional)

(a) Is 3 {1, 2, 3}?

Yes

No

(b) Is 1 ⊆ {1}?
Yes

No

(c) Is {2} {1, 2}?

Yes

No

(d) Is {3} {1, {2}, {3}}?

Yes

No

(e) Is 1 {1}?

Yes

No

(f) Is {2} ⊆ {1, {2}, {3}}?

Yes

No

(g) Is {1} ⊆ {1, 2}?

Yes

No

(h) Is 1 {{1}, 2}?

 Yes

No

(i) Is {1} ⊆ {1, {2}}?

Yes

No

(j) Is {1} ⊆ {1}?

Yes

No

Show My Work (Optional)

Let the universal set be ℝ, the set of all real numbers, and let A = {x ℝ | −3 ≤ x ≤ 0}, B = {x ℝ −1 < x < 2}, and C = {x ℝ | 6 < x ≤ 8}. Find
each of the following:

(a) A ∪ B

x ℝ −3 ≤ x < 2

x ℝ −3 < x ≤ 2

x ℝ x ≤ −3 or x > 2

x ℝ x < −3 or x ≥ 2

(b) A∩B

x ℝ −1 ≤ x < 0

x ℝ −1 < x ≤ 0

x ℝ x < −1 or x ≥ 0

x ℝ x ≤ −1 or x > 0

c
(c) A

x ℝ −3 < x < 0

x ℝ −3 ≤ x ≤ 0

x ℝ x ≤ −3 or x ≥ 0

x ℝ x < −3 or x > 0

(d) A ∪ C
 x ℝ −3 ≤ x ≤ 0 or 6 < x ≤ 8

x ℝ −3 < x < 0 or 6 < x ≤ 8

x ℝ −3 ≤ x ≤ 0 or 6 < x < 8

x ℝ −3 ≤ x ≤ 0 and 6 < x ≤ 8

(e) A∩C

x ℝ −3 ≤ x ≤ 0 or 6 < x ≤ 8

x ℝ −3 < x < 0 or 6 < x ≤ 8

x ℝ −3 ≤ x ≤ 0 or 6 < x < 8

x ℝ −3 ≤ x ≤ 0 and 6 < x ≤ 8

c
(f) B

x ℝ x < −1 or x > 2

x ℝ −1 < x < 2

x ℝ −1 ≤ x ≤ 2

x ℝ x ≤ −2 or x ≥ 1

x ℝ x ≤ −1 or x ≥ 2

c
(g) A ∩ Bc

x ℝ −3 ≤ x ≤ 2

x ℝ −3 < x < 2

x ℝ x < −3 or x ≥ 2

x ℝ x ≤ −3 or x > 2

x ℝ x < −2 or x ≥ 3
(h) Ac ∪ Bc

x ℝ x < −1 or x ≥ 0

x ℝ −1 ≤ x ≤ 0

x ℝ x ≤ −1 or x > 0

x ℝ −1 < x < 0

x ℝ x ≤ 0 or x > 1

(i) (A ∩ B ) c

x ℝ x < −1 or x ≥ 0

x ℝ x ≤ 0 or x > 1

x ℝ −1 < x < 0

x ℝ −1 ≤ x ≤ 0

x ℝ x ≤ −1 or x > 0

(j) (A ∪ B)
c

x ℝ −3 < x < 2

x ℝ x < −2 or x ≥ 3

x ℝ x < −3 or x ≥ 2

x ℝ x ≤ −3 or x > 2

x ℝ −3 ≤ x ≤ 2

Show My Work (Optional)

Find a counterexample to show that the following statement is false.

For all sets A and B, (A ∪ c

B) = A
c
∪ c
B .

Assume that all sets are subsets of a universal set U = {1, 2, 3, 4, 5}. (Enter your answer as a comma-separated list in the form A, B where
both A and B are written in set-roster notation. Enter EMPTY or ∅ for the empty set.)
A, B =
$${1,2},{2,3}

Show My Work (Optional)

In each of (a)–(f), answer the following questions: Is A ⊆ B? Is B ⊆ A? Is either A or B a proper subset of the other?

(a) A = {7, {7}, ( 7 ) 2}, B = {7, {7}, {{7}}}

Is A ⊆ B?

Yes

No

Is B ⊆ A?

Yes

No

Is either A or B a proper subset of the other?

Yes, A is a proper subset of B.

Yes, B is a proper subset of A.

No, neither is a proper subset of the other.

(b) A= 3, 5 2 − 4 2 , 24 mod 7 , B = {8 mod 5}

Is A ⊆ B?

Yes

No

Is B ⊆ A?

Yes

No

Is either A or B a proper subset of the other?

Yes, A is a proper subset of B.

Yes, B is a proper subset of A.

No, neither is a proper subset of the other.

(c) A = {{1, 2}, {2, 3}}, B = {1, 2, 3}

Is A ⊆ B?
 Yes

No

Is B ⊆ A?

Yes

No

Is either A or B a proper subset of the other?

Yes, A is a proper subset of B.

Yes, B is a proper subset of A.

No, neither is a proper subset of the other.

(d) A = {a, b, c}, B = {{a}, {b}, {c}}

Is A ⊆ B?

Yes

No

Is B ⊆ A?

Yes

No

Is either A or B a proper subset of the other?

Yes, A is a proper subset of B.

Yes, B is a proper subset of A.

No, neither is a proper subset of the other.

(e) A={ 9 , {3}}, B = {3}

Is A ⊆ B?

Yes

No

Is B ⊆ A?
 Yes

No

Is either A or B a proper subset of the other?

Yes, A is a proper subset of B.

Yes, B is a proper subset of A.

No, neither is a proper subset of the other.

(f) A = {x ℝ | cos(x) ℤ}, B = {x ℝ | sin(x) ℤ}

Is A ⊆ B?

Yes

No

Is B ⊆ A?

Yes

No

Is either A or B a proper subset of the other?

Yes, A is a proper subset of B.

Yes, B is a proper subset of A.

No, neither is a proper subset of the other.

Show My Work (Optional)

7. [2/2 Points] DETAILS PREVIOUS ANSWERS EPPDISCMATH5M 6.1.004.
2/2 Submissions Used
MY NOTES ASK YOUR TEACHER

Let A = {n ℤ | n = 5r for some integer r} and B = {m ℤ | m = 20s for some integer s}. Determine which of the following statements are
true and which are false. (Enter TRUE if the statement is true, and enter a number that could be used as the basis for a counterexample if
the statement is false).

(a) A ⊆ B

$$5

(b) B ⊆ A

$$true

Show My Work (Optional)

(a) Is 6 {6}?

Yes

No

(b) How many elements are in the set {6, 6, 6, 6, 6}?

1 1

(c) How many elements are in the set {0, {0}}?

2 2

(d) Is {0} {{0}, {1}}?

Yes

No

(e) Is 0 {{0}, {1}}?

Yes

No

Show My Work (Optional)

Consider the statement.

For all sets A, B, and C, A ∩ (B ∪ C) = (A ∩ B) ∪( A ∩ C).

Fill in the blanks in the following proof for the statement. (In the proof, let ∩ and ∪ stand for the words "intersection" and "union,"
respectively.)

Proof: Suppose A, B, and C are any sets. [To show that A ∩ (B ∪ )=( ∩ )∪(
C A B A ∩ C), we must show that
A ∩ (B ∪ )⊆(C A ∩ B) ∪( ∩ A C) and that (A ∩ B) ∪( A∩C ) ⊆ ∩ ( ∪ ).]
A B C

(1) Proof that A ∩ (B ∪ ⊆ C) (A ∩ B) ∪ (A ∩ C):

Let x ∈ A ∩ (B ∪ ∈ ( ∩ )∪( ∩ )
C). We must show that x ( ∩ )∪( ∩ ) . A B A C A B A C

By definition of ∩, ∈ x and ∈ ∪ .
A A x B C

Thus ∈ and, by definition of ∪, ∈ or ∈

x A . x B x C C

Case 1 (x ∈ ∈ In this case, ∈ ∩ by definition of ∩.

A and x B): x A B

Case 2 (x ∈ ∈ In this case, ∈ ∩ by definition of ∩.

A and x C): x A C

By cases 1 and 2, ∈ ∩ or ∈ ∩ , and so, by definition of ∪, ∈ ( ∩ ) ∪ ( ∩ )

x A B x A C x A B A C (A ∩ B) ∪( A ∩ C) .

[
So A ∩( ∪ )⊆( ∩ )∪( ∩ )
B C A B .] A C by definition of subset

(2) Proof that (A ∩ ∪ ∩ ⊆ ∩ ∪ B) (A C) A (B C):

Let ∈ ( ∩ ) ∪ ( ∩ ). [
x A B A ∈ ∩ ( ∪ ).]
C We must show that x A B C

By definition of ∪, ∈ ∩ or x orA ∈ ∩ C.
B x A

Case 1 (x ∈ ∩ In this case, by definition of ∩, ∈ and ∈ .

A B): x A x B

Since ∈ , then ∈ ∪ by definition of ∪.

x B x B C

Case 2 (x ∈ ∩ In this case, by definition of ∩, ∈ and

A C): and ∈. x A x C

Since ∈ , then ∈ ∪ by definition of ∪.

x C x B C

In both cases ∈ and ∈ ∪ , and so, by definition of ∩, ∈ ∩ ( ∪ )

x A x B C ∩( ∪ x A B C A B C) .

[So ( ∩ ) ∪ ( ∩ ) ⊆ ∩ ( ∪ ) by definition of subset

A B A C A B subset .]
C

(3) Conclusion: Since both subset relations have been proved, it follows, by definition of set equality, that A ∩ (B ∪ C) = (A ∩ B) ∪( A∩

C) A ∩ (B ∪ C) = (A ∩ B) ∪( A ∩ C) .

Show My Work (Optional)

Simplify the given expression. Cite a property from Theorem 6.2.2 for each step.

(A − (A ∩ B)) ∩ (B − (A ∩ B))

Let A and B be any sets. Then

(A − (A ∩ B)) ∩ (B − (A ∩ B)) =
= ( A ∩ ( A ∩ B ) c) ∩ ( B ∩ ( A ∩ B ) c) by the set difference law by the set difference law

= A ∩ ((A ∩ B) c ∩ (B ∩ (A ∩ B) c)) by the associative law by the associative law

c c
= A ∩ (((A ∩ B) ∩ B) ∩ (A ∩ B) ) by the associative law by the associative law

= A ∩ ((B ∩ (A ∩ B) c) ∩ (A ∩ B) c) by the commutative law by the commutative law

c c
= A ∩ (B ∩ ((A ∩ B) ∩ (A ∩ B) )) by the associative law by the associative law

= A ∩ ( B ∩ ( A ∩ B ) c) by the idempotent law by the idempotent law

= ( A ∩ B ) ∩ (A ∩ B ) c by the associative law by the associative law

=∅ by the complement law by the complement law

Show My Work (Optional)

Use an element argument to prove the statement. (Assume that all sets are subsets of a universal set U.)

Statement: For all sets A, B, and C,

(A − B) ∩ (C − B) = (A ∩ C) − B.

Proof:

Suppose A, B, and C are any sets. [To show that (A − B) ∩ (C − B) = (A ∩ C) − B, we must show that (A − B) ∩ (C − B) ⊆( A ∩ C) − B and
that (A ∩ C) − B ⊆( A − B) ∩ (C − B).]

Part 1: Proof that (A − B) ∩ (C − B) ⊆ (A ∩ C) − B

Consider the sentences in the following scrambled list.

By definition of intersection, x ∈ A − B and x ∈ C − B.

Therefore x ∈( A ∩ C) − B by the definition of set difference.

∈ and ∉ and ∈ and ∉ .

By definition of set difference, x A x B x C x B

By definition of intersection, ∈ and ∉ and ∈ and ∉ . x A x B x C x B

Thus ∈ ∩ by definition of intersection and the fact that ∉ .

x A C x B

By definition of set difference, ∈ − and ∈ − . x A B x C B

We prove part 1 by selecting appropriate statements from the list and putting them in the correct order.

1. Suppose x ∈( A − B) ∩ (C − B).
2. By definition of intersection, x∈ − and ∈ − . By definition of intersection, ∈
A B x C B x A − B and x ∈ C − B.
∈ and ∉ and ∈ and ∉ .
3. By definition of set difference, x A x B x C x B
By definition of set difference, ∈ and ∉ and ∈ and ∉ . x A x B x C x B
4. Thus ∈ ∩ by definition of intersection and the fact that ∉ .
x A C x B
Thus ∈ ∩ by definition of intersection and the fact that ∉ .
x A C x B
5. Therefore ∈ ( ∩ ) − by the definition of set difference.
x A C B
Therefore ∈ ( ∩ ) − by the definition of set difference.
x A C B
6. Hence, ( − ) ∩ ( − ) ⊆ ( ∩ ) − by definition of subset.
A B C B A C B

Part 2: Proof that (A ∩ ⊆ ∩

C) − B (A − B) (C − B)

Consider the sentences in the following scrambled list.

∈(
By definition of intersection, x A − B) ∩ (C − B).

By definition of set difference ∈ x A ∩ C and x ∉ B.

So by definition of set difference, x ∈ A − B and x ∈ C − B.

By definition of set difference, x ∈. ∈ A and x C

Hence both ∈ and ∉ and also ∈ , and ∉

x A x B x C x B.

By definition of intersection ∈ ∩ and ∉ . x A C x B

By definition of intersection, ∈ and ∈ . x A x C

We prove part 2 by selecting appropriate sentences from the list and putting them in the correct order.

1. Suppose x ∈( A ∩ C ) − B.
∈ ∩ and ∉ .
2. By definition of set difference x A C x B ∈ ∩ and ∉ .
By definition of set difference x A C x B
3. By definition of intersection, ∈ and ∈ . x A x C By definition of intersection, ∈ and ∈ .x A x C
4. Hence both ∈ and ∉ and also ∈ , and ∉
x A x B x C x B. Hence both ∈ and ∉ and also ∈ , and ∉
x A x B x C x B.
 5. So by definition of set difference, x ∈ A − B and x ∈ C − B.
So by definition of set difference, x ∈ A − B and x ∈ C − B.
6. By definition of intersection, x ∈( A − B) ∩ (C − B). By definition of intersection, x ∈( A − B) ∩ (C − B).
7. Hence, (A ∩ C) − B ⊆( A − B) ∩ ( C − B) ⊆ by definition of subset.
Conclusion:

Since both subset relations have been proved, it follows by definition of set equality that (A − B) ∩ (C − B) = (A ∩ C) − B.

Show My Work (Optional)

(a) Is {{a, d, e}, {b, c}, {d, f}} a partition of {a, b, c, d, e, f }?

Yes

No

(b) Is {{w, x, v}, {u, y, q}, {p, z}} a partition of {p, q, u, v, w, x, y, z}?

Yes

No

(c) Is {{5, 4}, {7, 2}, {1, 3, 4}, {6, 8}} a partition of {1, 2, 3, 4, 5, 6, 7, 8}?

Yes

No

(d) Is {{3, 7, 8}, {2, 9}, {1, 4, 5}} a partition of {1, 2, 3, 4, 5, 6, 7, 8, 9}?

Yes

No

(e) Is {{1, 5}, {4, 7}, {2, 8, 6, 3}} a partition of {1, 2, 3, 4, 5, 6, 7, 8}?

Yes

No

Show My Work (Optional)

 Definition: Given sets A and B, the symmetric difference of A and B, denoted A Δ B,
is

A Δ B = (A − B) ∪( B − A)

Let A = {1, 2, 3, 4}, B = {3, 4, 5, 6}, and C = {5, 6, 7, 8}. Find each of the following sets. (Enter your answers in set-roster notation.)

(a) A−B

$${1,2}

B−A

$${5,6}

AΔB

$${1,2,5,6}

(b) BΔC

$${3,4,7,8}

(c) AΔC

$${1,2,3,4,5,6,7,8}

(d) (A Δ B ) Δ C
$${1,2,7,8}

Show My Work (Optional)

Find a counterexample to show that the statement is false. Assume all sets are subsets of a universal set U = {1, 2, 3, 4, 5}. (Enter your
answers for A, B, and C in roster notation as a comma-separated list of sets. Enter EMPTY or ∅ for the empty set.)

For all sets A, B, and C,

A ∪( B − C) = (A ∪ B ) − (A ∪ C).

A , B, C =
$${1,2},{2,3},{2,4}

Show My Work (Optional)

Let R i = x ∈ R 1≤x≤1+
1
i
= 1, 1 +
1
i
for each positive integer i. (Enter your answers using interval notation.)

(a)
∪i=1
9

$$[1,2]
R =
i

(b) 9

∩R =
i=1
i

$$[1,1+19​]

(c) Are R 1, R 2, R 3, , R 9 mutually disjoint? Why or why not?

Yes, because the intersection of the sets R 1, R 2, R 3, ..., R 9 is empty.

Yes, because no two of the sets R 1, R 2, R 3, ..., R 9 have any elements in common.

Yes, because the union of the sets R 1, R 2, R 3, ..., R 9 is empty.

No, because no two of the sets R 1, R 2, R 3, ..., R 9 are disjoint.

No, because the sets R 1, R 2, R 3, ..., R 9 are disjoint.

(d)
∪i=1
n

$$[1,2]
R =
i

(e) n

∩R =
i=1
i

$$[1,1+1n​]

(f)
∪i=1
∞

$$[1,2]
R =
i
(g) ∞

∩R =
i=1
i

$$[1,1]

Show My Work (Optional)

Question 1 of 15 View Next Question

Home My Assignments Request Extension

Copyright © 1998 - 2023 Cengage Learning, Inc. All Rights Reserved TERMS OF USE PRIVACY