Scribd
Upload
111 views4 pages

DMQuiz 8 WAnswers

This document contains a discrete mathematics quiz with multiple choice and numerical answer questions about sequences, recurrence relations, induction proofs, and sums. Some key questions involve identifying the common ratio of a geometric sequence, determining the recurrence relation that describes a population growth sequence, identifying which step of an induction proof uses the inductive hypothesis, and establishing the inductive step of proving a theorem about a recursively defined sequence.

Uploaded by

name
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
111 views4 pages

DMQuiz 8 WAnswers

This document contains a discrete mathematics quiz with multiple choice and numerical answer questions about sequences, recurrence relations, induction proofs, and sums. Some key questions involve identifying the common ratio of a geometric sequence, determining the recurrence relation that describes a population growth sequence, identifying which step of an induction proof uses the inductive hypothesis, and establishing the inductive step of proving a theorem about a recursively defined sequence.

Uploaded by

name
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

Discrete Mathematics Quiz 8

Name: _____________________________

NYU Net ID: ________________________

1.1) Select the description that fits the sequence below: 8, 5, 2, 2, 1, -1


a. Non-decreasing but not increasing
b. Non-increasing and decreasing
*c. Non-increasing but not decreasing
d. Non-decreasing and increasing

1.2) What is the common ratio of the following geometric sequence? 27, 9, 3, 1, ...
a. 27
b. 9
c. 3
*d. 1/3

1.3) The sequence {f n } starts with an index of 1 and is defined so that f n is the largest integer
k such that k 2 ≤n . Which sequence fits the definition of {f n } ?
a. 1, 4, 9, 16, 25, ...
*b. 1, 1, 1, 2, 2, ...
c. 2, 4, 8, 16, 32, ...
d. 1, 2, 3, 4, 5, ...

2.1) A sequence {an } is defined as follows: a0 = 2 , a1 = 1 , and for n≥2 ,


an = 3⋅an−1 − n⋅an−2 + 1. What is a3 ?
*a. -2
b. -1
c. 1
d. 2

2.2) A sequence is defined by the recurrence relation f n = n⋅f n−1 − f n−3 . How many initial values
are required so that the sequence is well defined for all n≥0 ?
a. 0
b. 1
c. 2
*d. 3

2.3) A population of mice increases by 10% every year. Define g n to be the number of mice
after n years. Select the recurrence relation that describes the sequence {g n } .
a. g n = (1.01)⋅g n−1
*b. g n = (1.1)⋅g n−1
c. g n = (.01)⋅g n−1 + g n−2
d. g n = (.1)⋅g n−1 + g n−2

k
3.1) The inductive step of an inductive proof shows that for k ≥0 , if ∑ 2j = 2k+1 − 1 , then
j=0
k+1
∑ 2j = 2k+2 − 1. In which step of the proof is the inductive hypothesis used?
j=0
k+1 k
∑ 2j = ∑ 2j + 2k+1 (Step 1)
j=0 j=0
k+1
= (2 − 1) + 2k+1   (Step 2)
= 2⋅2k+1 − 1 (Step 3)
k+2
=2 −1 (Step 4)
a. Step 1
*b. Step 2
c. Step 3
d. Step 4

3.2) The inductive step of an inductive proof shows that for k ≥4 , if 2k ≥3k , then 2k+1 ≥3(k + 1) . In
which step of the proof is the inductive hypothesis used?
2k+1 ≥2⋅2k  (Step 1)
≥2⋅3k   (Step 2)
≥3k + 3k   (Step 3)
≥3k + 3   (Step 4)
≥3(k + 1)   (Step 5)
a. Step 1
*b. Step 2
c. Step 3
d. Step 4
3.3) The inductive step of an inductive proof shows that for k ≥4 , if 2k ≥3k , then 2k+1 ≥3(k + 1) .
Which step of the proof uses the fact that k ≥4≥1 ?
2k+1 ≥2⋅2k   (Step 1)
≥2⋅3k  (Step 2)
≥3k + 3k  (Step 3)
≥3k + 3  (Step 4)
≥3(k + 1)  (Step 5)
a. Step 2
b. Step 3
*c. Step 4
d. Step 5

4.1) Q(n) is a statement parameterized by a positive integer n. The following theorem is proven
by induction:
Theorem: For any positive integer n, Q(n) is true.
What must be proven in the inductive step?
a. For any integer k ≥1 , Q(k-1) implies Q(k).
b. For any integer k ≥1 , Q(k) implies Q(n).
c. For any integer k ≥1 , Q(k).
*d. For any integer k ≥1 , Q(k) implies Q(k+1).

4.2) The sequence {g n } is defined recursively as follows: g 0 = 1 , and g n = 3⋅g n−1 + 2n , for n≥1 .
If the theorem below is proven by induction, what must be established in the inductive step?
Theorem: For any non-negative integer n, g n = 25 ⋅3n − n − 23 .
a. For k ≥0 , if g k = 3⋅g k−1 + 2k ,
then g k+1 = 25 ⋅3k+1 − (k + 1) − 23 .
*b. For k ≥0 , if g k = 25 ⋅3k − k − 23 ,
then g k+1 = 25 ⋅3k+1 − (k + 1) − 23 .
c. For k ≥0 , if g k = 3⋅g k−1 + 2k ,
then g k+1 = 3⋅g k + 2(k + 1) .
d. For k ≥0 , if g k = 25 ⋅3k − k − 23 ,
then g k+1 = 3⋅g k + 2(k + 1) .

4.3) Select the mathematical statements to correctly fill in the beginning of the proof of an
inductive step below:
We will assume for k ≥1 that 7 evenly divides 62k − 1 and will prove that 7 evenly divides
62(k+1) − 1 . Since, by the inductive hypothesis, 7 evenly divides 62k − 1 , then 62k can be
expressed as (A?), where m is an integer.
62(k+1) − 1 = 62 ⋅62k − 1
= (B?)   by the ind. hyp.
=⋯
a. (A): 7m
(B): 36(7m) − 1
*b. (A): 7m + 1
(B): 36(7m + 1) − 1
c. (A): 7m
(B): 36(62k ) − 1
d. (A): 7m + 1
(B): 36(62k ) − 1

3
5.1) Compute the value of the sum ∑ k 2 .
k=−2
Answer: 19

3
5.2) Compute the value of the sum ∑ (k + 1)2 .
k=−2
Answer: 31

2
5.3) Compute the value of the sum ∑ (k − 1)2 .
k=−2
Answer: 15

You might also like