This preview shows page 1. Sign up to view the full content.
Unformatted text preview: . The
enumeration of terms with ellipses becomes
18 Geometric Series
If a and r = 0 are real numbers, then
if r = 1
(n + 1)a if r = 1
j =0 Proof:
The case r = 1 holds, since arj = a for each of the
n + 1 terms of the sum.
The case r = 1 holds, since
(r − 1) j =0 arj =
arj +1 −
= j =0
j =0 arj − j =1
arj j =0 = ar
and dividing by (r − 1) yields the claim.
19 Sum of First n Positive Integers
For all n ≥ 1, we have
k = n(n + 1)/2
k=1 We prove this by induction.
Basis step: For n = 1, we have
k = 1 = 1(1 + 1)/2. k=1 20 Sum of the First n Positive Integers
Induction Hypothesis: We assume that the claim
holds for n − 1.
Induction Step: Assuming the Induction Hypothesis, we will show that the claim holds for n.
n k=1 k =
= n− 1 n + k=1 k
2n/2 + (n − 1)n/2 by Induction Hypothesis
2 Therefore, the claim follows by induction on n.
21 Sum of Fibonacci Nu...
View Full Document
- Fall '11