MAT 102 - ASSIGNMENT # 4 DUE NOVEMBER 9

Instructions

Please submit solutions to all of the questions listed below on Crowdmark. Your assignment is
due before 11.59pm on November 9. You will need to submit a separate file for each question, so it
is easiest to write up your solution to each question on its own paper. Please see the “Crowdmark
How-To” document on the course page for tips about simplifying the submission process.

Your solutions should be neat and legible (preferably in black or blue ink). The written assign-
ment is worth 10 points, and we will grade three (3) questions.

Technical issues will not be accepted as a reason for failing to submit on time, so please leave yourself
ample time to submit your HW before the deadline.

Assigned Questions

(1) Let an be the sequence defined recursively as follows:

a1 = 1
a2 = 1
an−1 1
an = + for n ≥ 3.
2 an−2

Prove that an ∈ [1, 2] for all n.

n
X n(n + 1)
(2) Recall that i= .
2
i=1
(a) Use the above formula (not induction) to find and prove a formula for 2 + 4 + · · · + 2n.
Express your final answer as a simplified fraction involving n.

(b) Use induction to prove your formula in (a).

(c) Use (a) to find and prove a formula for 1 + 3 + 5 + · · · + (2n − 1). Express your final
answer as a simplified fraction involving n.

(d) Use induction to prove your formula in (c).

n
X
(3) Let n, m ∈ N with m < n. Find and prove a formula for i. Express your final answer as a
i=m
simplified fraction involving n, m. (Hint: You should not need induction!)

(4) For a natural number n, we define n! = 1 · 2 · 3 · . . . · (n − 1) · n.

For example: 2! = 1 · 2, 3! = 1 · 2 · 3 = 6, 5! = 1 · 2 · 3 · 4 · 5 = 120.

(a) Compute 6! and 7!. (In each case, simplify and express your final answer as a single
integer.)
MAT 102 - ASSIGNMENT # 4 DUE NOVEMBER 9

(b) Prove that if n, m ∈ N, and n > m, then n! > m!.

(c) Let x ∈ R. Prove that for all n ∈ N, if x ≥ n, then xn ≥ n!.

(5) Find all natural numbers n so that 6n+2 ≤ 7n−1 . Prove your claim using induction.

(6) Recall the Fibonacci sequence from Week 7 in-class activities.

(a) Prove that Fn > 0 for all natural numbers n.

(b) Prove that for all natural numbers n > 2 we have Fj < Fn for every j ∈ {1, . . . , n − 1}.