EN g00092844@aus.

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

Discrete Math Fall 2023, Fall 2023

INSTRUCTOR
HW-8-F23 (Homework) Abdul Jarrah
University of Sharjah

Current Score

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

POINTS 0/1 4/4 1/1 1/1 4/4 4/4 2/2 1/1 3/3 6/6 1/1 2/2 6/6

TOTAL SCORE

35/36 97.2%

Due Date Past Due

WED, NOV 1, 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 View Key

Let A = {−2, −1, 0, 1, 2, 3, 4, 5, 6} and define a relation R on A as follows:

For all m, n ∈ A, m R n ⇔ 2 2
5|(m − n ).

It is a fact that R is an equivalence relation on A. Use set-roster notation to list the distinct equivalence classes of R.
(Enter your answer as a comma-separated list of sets.)
$${−5,0},{1,−1,4,6},{2,−2,3}

Show My Work (Optional)

Define relations R and S on R as follows:

R = {(x, y) ∈ 2 2
R ✕ R|x + y = 25} and
S = {(x, y )∈ R ✕ R|x = y}.

Which diagram shows the graph of R in the Cartesian plane?

ℹ
 ℹ

Which diagram shows the graph of S in the Cartesian plane?

ℹ

ℹ
 ℹ

Which diagram shows the graph of R ∪ S in the Cartesian plane?

ℹ

ℹ
 ℹ

Which diagram shows the graph of R ∩ S in the Cartesian plane?

ℹ

ℹ
 ℹ

Show My Work (Optional)

Determine whether the given relation is reflexive, symmetric, transitive, or none of these. (Select all that apply.)

Let A be the set of all strings of 0's, 1's, and 2's that have length 4 and for which the sum of the characters in the string
is less than or equal to 2. Define a relation R on A as follows:

For every s, t A, s R t ⇔ the sum of the characters of s equals the sum of the characters of t.

Reflexive

Symmetric

Transitive

none of the above

Show My Work (Optional)

The following definitions are used: a relation on a set A is defined to be

irreflexive if, and only if, for every x A, x R x;

asymmetric if, and only if, for every x, y A if x R y then y R x;
intransitive if, and only if, for every x, y, z A, if x R y and y R z then x R z.

The following relation is defined on the set A = {0, 1, 2, 3}. Determine whether the relation is irreflexive, asymmetric,
intransitive, or none of these. (Select all that apply.)

R = {(0, 0), (0, 1), (1, 1), (1, 2), (2, 2), (2, 3)}
2

Irreflexive

Asymmetric

Intransitive

none of the above

Show My Work (Optional)

Determine which of the following congruence relations are true and which are false.

(a) 22 ≡ 2 (mod 5)

True

False

(b) 2 ≡ −3 (mod 7)

True

False

(c) −2 ≡ −5 (mod 3)

True

False

(d) −6 ≡ 24 (mod 2)

True

False

Show My Work (Optional)

Define a relation P on ℤ as follows: For every ordered pair (m, n) ℤ ✕ ℤ,

m P n ⇔ m and n have a common prime factor.

(a) Is 10 P 15?

Yes

No

(b) Is 21 P 25?

Yes

No

(c) Is 0 P 7?

Yes

No

(d) Is 8 P 8?

Yes

No

Show My Work (Optional)

Prove the following statement.

If R is any symmetric relation on a set A, then R −1 is symmetric.

Some of the sentences in the following scrambled list can be used in a proof.

By definition of R −1 and since y R x, then x R −1 y.

By definition of R −1 and since x R −1 y, then y R x.

By definition of R −1 and since y R −1 x, then x R y.

By definition of R −1 and since x R y, then y R −1 x.

Proof: We construct a proof by selecting appropriate sentences from the list and inserting them in the spaces.

Construct the proof by using the appropriate statements from the list and putting them in the correct order.

1. Let R be any symmetric relation on a set A, and suppose that x and y are any elements of A such that x R −1 y.
2. By definition of R ⁻¹ and since x R ⁻¹ y, then y R x.
3. Since R is symmetric and y R x, then x R y.
4. By definition of R ⁻¹ and since x R y, then y R ⁻¹ x.
5. Therefore, by definition of a symmetric relation, R −1 is symmetric.

Show My Work (Optional)

Define a relation S on B = {a, b, c, d} by S = (a, b), (a, c), (b, c), (d, d) .

Which of the following is the directed graph of S?

ℹ
 ℹ

Show My Work (Optional)

9. [3/3 Points] DETAILS PREVIOUS ANSWERS EPPDISCMATH5M 8.1.006.
2/2 Submissions Used
MY NOTES ASK YOUR TEACHER

Let X = {a, b, c}. Define a relation J on 𝒫(X) as follows:

For all sets A and B in 𝒫(X),

AJB ⇔ A ∩ B ≠ ∅.

(a) Is {a} J {c}?

Yes

No

(b) Is {a, b} J {b, c}?

Yes

No

(c) Is {a, b} J {a, b, c}?

Yes

No

Show My Work (Optional)

Let A = {a, b, c, d} and define a relation R on A as follows:

R = {(a, a), (b, b), (b, d), (c, c), (d, b), (d, d)}.

It is a fact that R is an equivalence relation on A. Use set-roster notation to write the equivalence classes of R.
[a] = $${a}

[b] = $${b,d}

[c] = $${c}

[d] = $${b,d}

How many distinct equivalence classes does R have?

3 classes

List the distinct equivalence classes of R. (Enter your answer as a comma-separated list of sets.)

$${a},{b,d},{c}

Show My Work (Optional)

Determine whether the given relation is reflexive, symmetric, transitive, or none of these. (Select all that apply.)

Recall that a prime number is an integer that is greater than 1 and has no positive integer divisors other than 1 and
itself. (In particular, 1 is not prime.) A relation P is defined on ℤ as follows:

For every m, n ℤ, m P n ⇔ ∃ a prime number p such that p | m and p | n.

Reflexive

Symmetric

Transitive

none of the above

Show My Work (Optional)

Define a relation R 2 on the set A = {0, 1, 2, 3} as follows.

R = (0, 0), (0, 1), (1, 1), (1, 2), (2, 2), (2, 3)
2

(a) Which of the following is the directed graph of R 2?

ℹ
 ℹ

(b) Is R 2 reflexive, symmetric, transitive, or none of these? (Select all that apply.)

R is reflexive.
2

R is symmetric.
2

R is transitive.
2

R is neither reflexive, symmetric, nor transitive.

2

Show My Work (Optional)

Let A = {−6, −5, −4, −3, −2, −1, 0, 1, 2, 3} and define a relation R on A as follows:

For all x, y A, x R y ⇔ 3|(x − y).

It is a fact that R is an equivalence relation on A. Use set-roster notation to write the equivalence classes of R.

[0] = $${−6,−3,0,3}

[1] = $${−5,−2,1}

[2] = $${−4,−1,2}

[3] = $${−6,−3,0,3}

How many distinct equivalence classes does R have?

3 classes

List the distinct equivalence classes of R. (Enter your answer as a comma-separated list of sets.)

$${−6,−3,0,3},{−5,−2,1},{−4,−1,2}

Show My Work (Optional)

Question 1 of 13 View Next Question

 Home My Assignments Request Extension

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