EN g00092844@aus.

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

Discrete Math Fall 2023, Fall 2023

INSTRUCTOR
HW-7_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 13/13 5/5 5/5 4/4 2/2 4/4 11/11 6/6 10/10 3/3 6/6 5/5 4/4 6/6 4/4

TOTAL SCORE

88/88 100.0%

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
(a) Define F: Z → Z by the rule F(n) = 2 − 3n, for each integer n.

(i) Is F one-to-one?

2 − 3n 1 =
$$2−3n2​

Suppose n 1 and n 2 are any integers, such that F(n 1) = F(n 2). Substituting from the definition of F gives that . Solving this equation for n 1 and
n =
1
$$n2​

simplifying the result gives that . Therefore, F is one-to-one one-to-one .

(ii) Show that F is not onto.

Counterexample:

m=
$$1

Let . For this value of m, the only number n with the property that F(n) = m is not an integer. Thus, F is not onto.

(b) Define G: R → R by the rule G(x) = 2 − 3x for each real number x. Is G onto?

Scratch work: Let y be any real number.

On a separate piece of paper, solve the equation y = 2 − 3x for x. Enter the result—an expression in y—in the box below.
x=
$$(2−y)3​

(1) Is x a real number?

Sums, products, and differences of real numbers are always real numbers always real numbers , and quotients of real numbers with nonzero denominators are
always real numbers always real numbers . Therefore, x is a real number is a real number .

(2) Does G(x) = y?

According to the formula that defines G, when G is applied to x, x is multiplied by 3 and the result is subtracted from 2.

When the expression for x that you found above is multiplied by 3, the result is
$$2−y

. And when the result is subtracted from 2, you obtain

$$y

. Thus, G(x) = y G (x ) = y .

Hence, there exists there exists a number x such that x is a real number and G(x) = y. Therefore, G is onto G is onto .

Show My Work (Optional)

Let J 5 = {0, 1, 2, 3, 4}, and define a function F: J 5 → J 5 as follows.

For each x ∈ J , f(x) = (x 3 + 3x + 3) mod 5.

5

Find the following:

(a) F(0) = 3 3

(b) F(1) = 2 2

(c) F(2) = 2 2

(d) F(3) = 4 4

(e) F(4) = 4 4

Show My Work (Optional)

Indicate if the function is a one-to-one correspondence. If it is, find the inverse function.

Define G : ℝ → ℝ by the rule G(x) = 2 − 5x for each real number x.

5−x
G is a one-to-one correspondence. The inverse function is G −1(x) = .
2

G is a one-to-one correspondence. The inverse function is G −1(x) = 2 − 5x.

2−x
G is a one-to-one correspondence. The inverse function is G −1(x) = .
5

G is a one-to-one correspondence. The inverse function is G −1(x) = 2 + 5x.

G is not a one-to-one correspondence.

Show My Work (Optional)

Let A = {1, 2, 3, 4, 5}, and define a function F: 𝒫 → Z as follows.

For each set of X in 𝒫(A),

0 if X has an even number of elements

F(X) =
1 if X has an odd number of elements.

Find the following:

(a) F({2, 5}) = 0 0

(b) F({1, 3, 5, 2}) = 0 0

(c) F({1, 2, 3}) = 1 1

(d) F ( ∅) = 0 0

Show My Work (Optional)

Each of the following formulas defines a function from ℤ to ℤ. Which functions are one-to-one but not onto? (Select all that apply.)

g(n) = 6n − 7 for each integer n

q(n) = 3 for each integer n

h(n) = 7n 2 for each integer n

f(n) = 3n for each integer n

Show My Work (Optional)

Let X and Y be any sets and let F be any function from X to Y. Prove the following statement:

For all subsets A and B of X, F(A ∩ B) ⊆ F(A) ∩ F(B)

Some of the sentences in the following scrambled list can be used to prove the statement.

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

Thus, by substitution, y ∈ F(A) and y ∈ F(B).

By definition of image of a set, there is an element x ∈ A ∩ B, such that F(x) = y.

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

By definition of the image of an element, F(x) ∈ F(A) and F(x) ∈ F(B).

By definition of intersection, y ∈ F(A) ∩ F(B).

This implies that there is an element y ∈ F(A ∩ B), such that F(x) = y.

By definition of the image of an element, x ∈ A ∩ B.

We construct a proof by selecting appropriate sentences from the list and putting them in the correct order.

1. Suppose A and B are any subsets of X and suppose y is any element in F(A ∩ B).
2. By definition of image of a set, there is an element x ∈ A ∩ B, such that F(x) = y. By definition of image of a set, there is an element x∈ A ∩ B, such that F(x) = y.
3. By definition of intersection, x ∈ A and x ∈ B. By definition of intersection, x ∈ A and x ∈ B.
4. By definition of the image of an element, F(x) ∈ F(A) and F(x) ∈ F(B). By definition of the image of an element, F(x) ∈ ( )∈
F(A) and F x F(B).
5. Thus, by substitution, y ∈ F(A) and y ∈ F(B). Thus, by substitution, y ∈ F(A) and y ∈ F(B).
6. It follows that y ∈ F(A) ∩ F(B) by definition of intersection.
7. Therefore, F(A ∩ B) ⊆ F(A) ∩ F(B) by definition of subset.

Show My Work (Optional)

7. [11/11 Points] DETAILS PREVIOUS ANSWERS EPPDISCMATH5M 7.1.002. 2/2 Submissions Used

MY NOTES ASK YOUR TEACHER

Let X = {2, 4, 6} and Y = {a, b, c, d}. Define g : X → Y by the following arrow diagram.

(a) Write the domain of g and the co-domain of g. (Enter your answer in set-roster notation. Enter EMPTY or ∅ for the empty set.)
domain of g = $${2,4,6}

co-domain of g = $${a,b,c,d}

(b) Find g(2), g(4), and g(6).

g(2) = $$b

g(4) = $$b

g(6) = $$b

(c) What is the range of g? (Enter your answer in set-roster notation. Enter EMPTY or ∅ for the empty set.)
$${b}

(d) Is 4 an inverse image of a?

Yes

No

Is 2 an inverse image of b?

Yes

No

(e) What is the inverse image of b? (Enter your answer in set-roster notation. Enter EMPTY or ∅ for the empty set.)
 $${2,4,6}

What is the inverse image of c? (Enter your answer in set-roster notation. Enter EMPTY or ∅ for the empty set.)
$$∅

(f) Represent g as a set of ordered pairs. (Enter your answer in set-roster notation as a comma-separated list of ordered pairs surrounded by brackets of the form { }.)
g=
$${(2,b),(4,b),(6,b)}

Show My Work (Optional)

Find functions defined on the set of nonnegative integers that can be used to define the sequences whose first six terms are given below.

(a) 1 1 1 1 1 1
,− , ,− , ,−
3 6 9 12 15 18

f (n ) =
$$(−1)n3(n+1)​

for each integer integer n ≥ 0 ≥0 .

(b) 0, −9, 18, −27, 36, −45

f (n ) =
$$(−1)n·9n

for each integer integer n ≥ 0 ≥0 .

Show My Work (Optional)

Consider the three-place Boolean function f defined by the following rule:

For each triple (x 1, x 2, x 3) of 0's and 1's,

f(x , x , x ) = (2x + 8x + 3x ) mod 2.

1 2 3 1 2 3

(a) Find f (1, 1, 1) and f (0, 1, 0).

f (1, 1, 1) = 1 1
f (0, 1, 0) = 0 0

(b) Fill in the blanks in the input/output table for f.

Input Output

x1 x2 x3 f

1 1 1 1 1

1 1 0 0 0

1 0 1 1 1

1 0 0 0 0

0 1 1 1 1

0 1 0 0 0

0 0 1 1 1

0 0 0 0 0

Show My Work (Optional)

All but two of the following statements are correct ways to express the fact that a function f is onto. Select the two that are incorrect.

f is onto ⇔ every element in its co-domain is the image of some element in its domain.

f is onto ⇔ every element in its domain has a corresponding image in its co-domain.

f is onto ⇔ ∀y Y, ∃ x X such that f(x) = y.

f is onto ⇔ ∀x X, ∃y Y such that f(x) = y.

f is onto ⇔ the range of f is the same as the co-domain of f.

Show My Work (Optional)

Define a function S : ℤ + → ℤ + as follows. For each positive integer n,

S(n) = the sum of the positive divisors of n.

Find the following.

(a) S(1)

1 1

(b) S(15)

24 24

(c) S(17)

18 18

(d) S(7)

8 8

(e) S(18)

39 39

(f) S(21)

32 32

Show My Work (Optional)

Let O be the set of all odd integers, and let 2ℤ be the set of all even integers. Prove that O has the same cardinality as 2ℤ.

Proof: In order to show that O has the same cardinality as 2ℤ we must show that there is a well-defined function f: O → 2ℤ that is both one-to-one and onto.

We will show that the following is a function from O to 2ℤ that satisfies these requirements. (Choose one definition for f and use it for the rest of the proof.)

f(n) = n − 1, for each odd integer n in O

f(n) = |n|, for each odd integer n in O

f(n) = n + 2, for each odd integer n in O

n
f(n) = , for each odd integer n in O
2

f(n) = 3n, for each odd integer n in O

Well-Defined ▲

One-to-One ▲

Onto ▲

Conclusion: Since f is a well-defined function from O to 2ℤ that is one-to-one and onto, we conclude that O and 2ℤ have the same cardinality.

Show My Work (Optional)

Let X = {a, b, c} and Y = {d, e, f, g}. Define functions H and K by the arrow diagrams below.

(a) Is H one-to-one? Why or why not?

H is one-to-one, because H(b) = f = H(c).

H is one-to-one, because H(b) = f = H(c) and b ≠ c.

H is not one-to-one, because e Y but e ≠ H(x) for any x in X.

H is not one-to-one, because g Y but g ≠ H(x) for any x in X.

H is not one-to-one, because H(b) = f = H(c) and b ≠ c.

Is H onto? Why or why not?

H is onto, because H(b) = f = H(c).

H is onto, because H(b) = f = H(c) and b ≠ c.

H is not onto, because e Y but e ≠ H(x) for any x in X.

H is not onto, because H(b) = f = H(c) and b ≠ c.

H is not onto, because H(b) = f = H(c).

(b) Is K one-to-one? Why or why not?

K is one-to-one, because there is exactly one element of X sent by K to the same element of Y.

K is one-to-one, because no two elements of X are sent by K to the same element of Y.

K is one-to-one, because g Y but g ≠ K(x) for any x in X.

K is not one-to-one, because g Y but g ≠ K(x) for any x in X.

K is not one-to-one, because no two elements of X are sent by K to the same element of Y.

Is K onto? Why or why not?

K is onto, because there is exactly one element of X sent by K to the same element of Y.

K is onto, because no two elements of X are sent by K to the same element of Y.

K is onto, because g Y but g ≠ K(x) for any x in X.

K is not onto, because g Y but g ≠ K(x) for any x in X.

K is not onto, because no two elements of X are sent by K to the same element of Y.
Show My Work (Optional)
Let X = {1, 2, 3, 4} and Y = {a, b, c, d, e}. Define g : X → Y as follows.

g(1) = a, g(2) = a, g(3) = a, and g(4) = d

(a) Draw an arrow diagram for g.

ℹ
 ℹ

(b) Let A = {2, 3}, C = {a}, and D = {b, c}. Find each of the following. (Enter your answer in set-roster notation. Enter EMPTY or ∅ for the empty set.)
g(A) = $${a}

g(X) = $${a,d}

−1
g (C) = $${1,2,3}

−1
g (D) = $$∅

−1
g (Y) = $${1,2,3,4}

Show My Work (Optional)

Let S be the set of all strings in a's and b's, and define C: S → S by

C(s) = as, for each s S.

(C is called concatenation by a on the left.)

(a) Prove that C is one-to-one.

Proof: Suppose s and s are strings in S such that C(s ) = C(s ). Use the definition of C to write this equation in terms of a, s , and s as follows:
1 2 1 2 1 2
as =
1
$$as2​

Now strings are finite sequences of characters, and since the strings on both sides of the above equation are equal, for each integer n ≥ 0, the nth character from the left in the
left-hand string is equal to is equal to the nth character from the left in the right-hand string. It follows that for each integer n ≥ 0, the nth character from the left
in s 1 equals the nth character from the left in s 2. Hence s 1 = s 2, and so C is one-to-one.

(b) Give a counterexample to show that C is not onto.

Counterexample: The string

$$b

is in S but is not equal to C(s) for any string s because every string in the range of C starts with
$$a

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