EN g00092844@aus.

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

Discrete Math Fall 2023, Fall 2023

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

Current Score

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

POINTS 4/4 6/6 7/7 6/6 6/6 6/6 6/6 5/6 5/7 6/6 2/2 0/6 3/4 6/6

TOTAL SCORE

75/78 96.2%

Due Date Past Due

WED, OCT 18, 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

Find the first four terms of the recursively defined sequence.

t = t
k k−1
+ 2t k − 2, for every integer k ≥ 2
t = −1, t =2
0 1
t
0
= -1 -1

t
1
= 2 2

t
2
= 0 0

t
3
= 4 4

Show My Work (Optional)

Prove the following statement by mathematical induction.

For every integer n ≥ 0, 7 n − 2 n is divisible by 5.

Proof (by mathematical induction): Let P(n) be the sentence

7 n − 2 n is divisible by 5.

We will show that P(n) is true for every integer n ≥ 0.

Show that P(0) is true: Select P(0) from the choices below.

(7 0 − 2 0) | 5

5 is a multiple of 7 0 − 2 0

70 − 20 < 5

5 | (7 0 − 2 0)

The fact that the selected statement is true can be deduced from the definition of divisibility and the fact that 7 0 − 2 0 = 0.

Show that for each integer k ≥ 0, if P(k) is true, then P(k + 1) is true: Let k be any integer with k ≥ 0, and suppose that P(k) is
true. Select P(k) from the choices below.

5 is a multiple of 7 k − 2 k

7 k − 2 k is divisible by 5

5 is divisible by 7 k − 2 k

7k − 2k < 5

[This is P(k), the inductive hypothesis.]

We must show that P(k + 1) is true. Select P(k + 1) from the choices below.

5 is a multiple of 7 k + 1 − 2 k + 1

7k + 1 − 2k + 1 < 5

7 k + 1 − 2 k + 1 is divisible by 5

5 is divisible by 7 k + 1 − 2 k + 1

By the inductive hypothesis and the definition of divisibility, there exists an integer r such that 7 k − 2 k = 5r. Then

7 k + 1 − 2 k + 1 = 7 · 7 k − 2 · 2 k = (5 + 2) · 7 k − 2 · 2 k.

Continue simplifying the right-hand side of the equation, apply the induction hypothesis, and express the result in terms of
k and r:
7k + 1 − 2k + 1 = 5 ·

$$7k+2r

and this quantity is an integer because k and r are integers.

Since 7 k + 1 − 2 k + 1 is is divisible by 5, then P(k + 1) is true true , which completes the

inductive step.

[Thus both the basis and the inductive steps have been proved, and so the proof by mathematical induction is complete.]

Show My Work (Optional)

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

Prove the following statement by mathematical induction.

n+1
i n+2
For every integer n ≥ 0, i·2 =n·2 + 2.
i=1

n+1
i n+2
Proof (by mathematical induction): Let P(n) be the equation i·2 =n·2 + 2. We will show that P(n) is true for
i=1
every integer n ≥ 0.

Show that P(0) is true: Select P(0) from the choices below.

0+1
i 0+2
i·2 =0·2 +2
i=1

2 = 0 · 2n + 2 + 2

n+1
i · 2i = 0 · 20 + 2 + 2
i=1

0+1
1 · 21 = 1 · 21 + 2 + 2
i=0

The selected statement is true because both sides of the equation equal the same quantity.

Show that for each integer k ≥ 0, if P(k) is true, then P(k + 1) is true: Let k be any integer with k ≥ 0, and suppose that P(k) is
true. We identify the expression on the left-hand side of P(k) by selecting from the choices below.

k+1
k
i·2
i=1

k+1
i
i·2
i=1

k+1
i
k·2
i=1

k+1
k+1
i·2
i=1
The right-hand side of P(k) is
$$k·2k+2+2

[The inductive hypothesis states that the two sides of P(k) are equal.]

(k+1)+1 k+1
i i
i·2 = i·2 +
i=1 i=1
$$(k+2)2(k+2)

We must show that P(k + 1) is true. The left-hand side of P(k + 1) is and the right-hand
side of P(k + 1) is
$$(k+1)2(k+1)+2+2

. After substitution from the inductive hypothesis, the left-hand side of P(k + 1) becomes

$$k2k+2+2

+ (k + 2)2 k + 2 . When the left-hand and right-hand sides of P(k + 1) are simplified, they both can

$$(k+1)2(k+3)

be shown to equal + 2. Hence P(k + 1) is true, which completes the inductive step.

[Thus both the basis and the inductive steps have been proved, and so the proof by mathematical induction is complete.]

Show My Work (Optional)

Use mathematical induction to prove that for each integer n ≥ 0, if F 0, F 1, F 2, ... is the Fibonacci sequence, then

gcd(F n + 1, F n) = 1. (The definition of gcd is given in Section 4.10.)

You may use the following lemma in the proof.

Lemma: If a and b are any integers not both zero, and if q and r are any integers such that a = bq + r, then
gcd(a, b) = gcd(b, r).

Proof (by mathematical induction): Let the property P(n) be the equation gcd(F , F n) = 1.
n+1

Show that P(0) is true: Select P(0) from the choices below.

gcd(F n + 1, F n) = 1

F =F =1
1 0

gcd(F 1, F 0) = 1

gcd(F 2, F 1) = 1

The selected statement is true by definition of the Fibonacci sequence.

Show that for each integer k ≥ 0, if P(k) is true, then P(k + 1) is true: Let k be any integer with k ≥ 0, and suppose that P(k) is
true. Select P(k) from the choices below.

gcd(F k + 2, F k + 1) = 1

gcd(F n + 2, F n + 1) = 1

gcd(F n + 1, F n) = 1

gcd(F k + 1, F k) = 1

[This is P(k), the inductive hypothesis.]

We must show that P(k + 1) is true. Select P(k + 1) from the choices below.

gcd(F k + 2, F k + 1) = 1

gcd(F k + 2, F k) = 1

gcd(F n + 2, F n) = 1

gcd(F n + 2, F n + 1) = 1

Now F k + 2 = F k + 1 + F k by definition of the Fibonacci sequence definition of the Fibonacci sequence , and
the fact that F k + 2 = F k + 1 + F k can be written as F k + 2 = F k + 1 · 1 + F k.

Select the result of applying the lemma from the choices below.
 gcd(F k + 2, F k + 1) = gcd(F k + 1, F k)

gcd(F k + 1, F k) = gcd(F k + 1, F k)

gcd(F k + 2, F k) = gcd(F k + 1, F k)

gcd(F k + 2, F k + 1) =
$$1

So, by applying the inductive hypothesis, we can conclude that [as was to be shown].

Show My Work (Optional)

Prove the following statement using mathematical induction. Do not derive it from Theorem 5.2.1 or Theorem 5.2.2.

n(5n − 3)
For every integer n ≥ 1, 1 + 6 + 11 + 16 + + (5n − 4) = .
2

Proof (by mathematical induction): Let P(n) be the equation

n(5n − 3)
1 + 6 + 11 + 16 + + (5n − 4) = .
2

We will show that P(n) is true for every integer n ≥ 1.

Show that P(1) is true: Select P(1) from the choices below.

1 · (5 · 1 − 3)
P(1) =
2

P(1) = 1

1 · (5 · 1 − 3)
1=
2

1 + (5 · 1 − 4) = 1 · (5 · 1 −
3)

The selected statement is true because both sides of the equation equal the same quantity.

Show that for each integer k ≥ 1, if P(k) is true, then P(k + 1) is true:

Let k be any integer with k ≥ 1, and suppose that P(k) is true. The left-hand side of P(k) is 1 + 6 + 11 + 16 + ⋯ + (5k − 4)
1 + 6 + 11 + 16 + ⋯ + (5k − 4) and the right-hand side of P(k) is
$$k(5k−3)2​

[The inductive hypothesis states that the two sides of P(k) are equal.]

1 + 6 + 11 + 16 + ⋯ + (5(k + 1) − 4) =
$$(k+1)(5(k+1)−3)2​

We must show that P(k + 1) is true. P(k + 1) is the equation . After substitution from
the inductive hypothesis, the left-hand side of P(k + 1) becomes k(5k − 3)/2 k(5k − 3)/2 + (5(k + 1) − 4).
When the left-hand and right-hand sides of P(k + 1) are simplified, they both can be shown to equal
$$(k+1)(5k+2)2​

. Hence P(k + 1) is true, which completes the inductive step.

[Thus both the basis and the inductive steps have been proved, and so the proof by mathematical induction is complete.]

Show My Work (Optional)

Which of the following are second-order linear homogeneous recurrence relations with constant coefficients? (Select all
that apply.)

a = (k − 1)a + 2ka k −
k k−1
2

b = −b + 7b k − 2
k k−1

c = 3c +1
k k−1

2
d = 3d + dk − 2
k k−1

r =r − 6r
k k−1 k−3

s =s + 10s k − 2
k k−1

Show My Work (Optional)

Let b 0, b 1, b 2, be the sequence defined by the explicit formula

n n
b = C · 4 + D(−3) for each integer n ≥ 0,
n

where C and D are real numbers.

(a) Find C and D so that b 0 = 0 and b 1 = 7.

C = 1 1
D = -1 -1

What is b 2 in this case?

b2 = 7 7

(b) Find C and D so that b 0 = 4 and b 1 = 9.

C = 3 3
D = 1 1

What is b 2 in this case?

b 2 = 57 57

Show My Work (Optional)

Fill in the blanks in the following proof, which shows that the sequence defined by the recurrence relation

f = f
k k−1
+ 2 k for each integer k ≥ 2
f = 1
1

satisfies the formula

n+1
f =2 − 3 for every integer k ≥ 1.
n

Proof (by mathematical induction):

Suppose f 1, f 2, f 3, ... is a sequence that satisfies the recurrence relation

k
f k = f k − 1 + 2 for each integer k ≥ 2, with initial condition f 1 = 1.

Let the property P(n) be the equation f n = 2 n + 1 − 3. We will show that P(n) is true for every integer n ≥ 1.

Show that P(1) is true:

The left-hand side of P(1) is

$$ƒ1

, which equals 1 1 . The right-hand side of P(1) is 1 1 . So P(1) is true.

Show that for each integer k ≥ 1, if P(k) is true, then P(k + 1) is true:

Let k be any integer with k ≥ 1, and suppose that P(k) is true. In other words, suppose that
f =
k
$$2k+1−3

[This is the inductive hypothesis.]

We must show that P(k + 1) is true. Now the left-hand side of P(k + 1) is

f
k+1 = f + 2k + 1
k
$$2k+1−3

= by substitution from the inductive hypothesis,

+ 2k + 1
$$2k+2−3

= by basic algebra,

and this is the right-hand side of P(k + 1), which completes the inductive step.

[Thus both the basis and the inductive steps have been proved, and so the proof by mathematical induction is complete.]

Show My Work (Optional)

Suppose that f 0, f 1, f 2, is a sequence defined as follows:

f
0 =
5, f 1 = 16,
f = 7f − 10f k − 2 for every integer k ≥ 2.
k k−1

Prove that f n = 3 · 2 n + 2 · 5 n for each integer n ≥ 0.

n n
Proof by strong mathematical induction: Let the property P(n) be the equation f n = 3 · 2 + 2 · 5 .

We will show that P(n) is true for every integer n ≥ 0.

Show that P(0) and P(1) are true:

Select P(0) from the choices below.

P(0) = f
0
0 0
P(0) = 3 · 2 + 2 · 5

0 0
f =3·2 +2·5
0

f =5
0

Select P(1) from the choices below.

f = 16
1
1 1
f1 = 3 · 2 + 2 · 5

1 1
P(1) = 3 · 2 + 2 · 5

P(1) = f
1

P(0) and P(1) are true because f = 5 and f = 16.

0 1

Show that for every integer k ≥ 1, if P(i) is true for each integer i from 0 through k, then P(k + 1) is true: Let k be any integer
f =
i
$$3·2i+2·5i

with k ≥ 1, and suppose that for every integer i with 0 ≤ i ≤ k, . This is the induction
f
k+1
=
$$3.2k+1+2·5k+1

hypothesis hypothesis . We must show that .

Now, by definition of f 0, f 1, f 2, ,
f
k+1
=
$$7ƒk​−10ƒk−1​
Apply the inductive hypothesis to f k and f k − 1 and complete the proof as a free responses. (Submit a file with a maximum
size of 1 MB.)

Key: Answers may vary.

Score: 0 out of 1

Comment:

Show My Work (Optional)

The given sequence is defined recursively. Use iteration to guess an explicit formula for the sequence. Simplify your
answer if possible.

f = f
k k−1
+ 2 k, for each integer k ≥ 2
f = 1
1
f =
n
$$2n+1−3

for all integers n ≥ 1

Show My Work (Optional)

Use the formula for the sum of the first n integers to evaluate the sum given below, then write it in closed form.

(a) 8 + 9 + 10 + 11 + + 500
$$125222

(b) 8 + 9 + 10 + 11 + +k
$$12​k(k+1)−28

Show My Work (Optional)

In order for a proof by mathematical induction to be valid, the basis statement must be true for the initial value of n and the
argument of the inductive step must be correct for every integer greater than or equal to the initial value.

Consider the following statement.

For every integer n ≥ 1, 3 n − 2 is even.

The following is a proposed proof by mathematical induction for the statement.

Since the property is true for n = 1, the basis step is true. Suppose the property is
true for an integer k, where k ≥ 1. That is, suppose that 3 k − 2 is even. We must
show that 3 k + 1 − 2 is even. Observe that

3 k + 1 − 2 = 3 k · 3 − 2 = 3 k(1 + 2) − 2
= (3 k − 2) + 3 k · 2.

Now 3 k − 2 is even by inductive hypothesis and 3 k · 2 is even by inspection. Hence

the sum of the two quantities is even (by Theorem 4.1.1). It follows that 3 k + 1 − 2
is even, which is what we needed to show.

Identify the error(s) in the proof. (Select all that apply.)

(3 k − 2) + 3 k · 2 ≠ 3 k(1 + 2) − 2

k
3 − 2 is odd by the inductive hypothesis.

The inductive hypothesis is assumed to be true.

The basis step is false. It says that 3 1 − 2 is even.

3 k + 1 − 2 ≠ (3 k − 2) + 3 k · 2

Show My Work (Optional)

Find the first four terms of the following recursively defined sequence.

d = k(d
k k−1
) 2, for each integer k ≥ 1
0 = 5
d

d
0
= 5 5

d
1
= 25 25

d
2
= 1250 1,250

d
3
= 46875000 4,687,500

Show My Work (Optional)

Suppose that c 0, c 1, c 2, is a sequence defined as follows:

c
0 =
2, c 1 = 2, c 2 = 6,
c = 3c for every integer k ≥ 3.
k k−3

Prove that c n is even for each integer n ≥ 0.

Proof (by strong mathematical induction): Let the property P(n) be the sentence:

"c n is even."

We will show that P(n) is true for every integer n ≥ 0.

Show that P(0), P(1), and P(2) are true: For each i = 0, 1, and 2, P(i) is the same statement. Select P(i) from the choice
below.

c is even
i

c = 2 or 6
i

c = 3c for every integer i ≥

i i−3
0

P(0), P(1), P(2) are true because 2 and 6 are even.

Show that for every integer k ≥ 2, if P(i) is true for each integer i from 0 through k, then P(k + 1) is true: Let k be any integer
with k ≥ 2, and suppose c is even even for every integer i with 0 ≤ i ≤ k. This is the induction
i
hypothesis hypothesis .

We must show that c k + 1 is even. By definition of c 0, c 1, c 2, ,

c
k+1
=
$$3ck−2​

Since k ≥ 2, we have that 0 ≤ k − 2 ≤ k. So we can apply the inductive hypothesis to conclude that c k + 1 is 3 times an
even integer even integer , thus c k + 1 is even even .

Show My Work (Optional)

Question 1 of 14 View Next Question

Home My Assignments Request Extension

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