Transcript Series
Series
Geometric Series
Binomial Coefficients
Harmonic Series
Sum of a Geometric Series
• What is
1 1
1 2 ?
2 2
• Method 1: Prove by induction that for
every n≥0,
1
1 1
1
1
2 n 2 n
2 2
2
2
• And then make some argument about the
limit as n →∞ to conclude that the sum is
2.
Sum of a Geometric Series
• Another way. Recall that
1
1 x x 2
1 x
and plug in x = ½ !
These “formal power series” have many
uses.
Another example
1
1
1
• What is X 1 2 4 6 L ?
2
2
2
• Since
1
1 x x 2
1 x
1
2
4
1
x
x
,
2
1 x
1
4
So X
.
2
3
1
1
2
Another Example
2 3 4
• What is S 1 2 3 L ?
3 3 3
• Generalize. Note that S=F(1/3) where
F(x) 1 2x 3x 2 4 x 3 L
Manipulating Power Series
Since F(x) 1 2x 3x 2 4x 3 L ,
1
F(x)
1 2x 3x 2 4x 3 L
1 x
(1 x x 2 x 3 L )
x 2x 2 3x 3 L
xF(x). So
1
1
F(x)(1 x)
and therefore F(x)
1 x
(1 x)2
1
9
1
Then F
.
2
3 2
4
3
Another Approach
F(x) 1 2x 3x 2 4 x 3 L
1
1 x x 2
1 x
• But then
d 1
d
(1 x x 2 )
dx 1 x dx
1 2x 3x 2 4 x 3 L
d 1
1
So F(x)
.
2
dx 1 x (1 x)
Identities involving “Choose”
• What is
n
i ?
i0
n
• “Set Theory” derivation
– Let S be a set of size n
– This is the sum of the number of 0 element
subsets, plus the number of 1-element
subsets, plus …, plus the number of nelement subsets
– Total 2n
Binomial Theorem
n i ni
(x y)
x y
i0 i
n
n
because if you multiply out
(x+y)(x+y)(x+y)…(x+y)
the coefficient of xiyn-i is the number of
different ways of choosing x from i factors
and y from n-i factors
Using the Binomial Theorem
n i ni
x y
Since (x y)
i0 i
n
n
substituting x=y=1 yields
n
n
n
n
n
i ni
(11) 2
1 1
i
i
i0
i0
n
Using the Binomial Theorem
What is
n
2 i ?
i0
n
i
Try to make this look like the binomial thm
n
n i ni
n
i
n
n
2
2
1
(2
1)
3
i i
i0
i0
n
Stacking books
Can you stack identical books so the top one
is completely off the table?
7/12/2016
Stacking books
• Can you stack identical books so the top
one is completely off the table?
• One book: balance at middle
1
7/12/2016
1
Stacking books
• Two books: balance top one at the middle,
the second over the table edge at the
center of gravity of the pair
1
1
1
½
7/12/2016
Stacking books
Three books: balance top one at the middle, the
second over the third at ½, and the trio over the
table edge at the center of gravity
1
½
7/12/2016
Stacking books
Three books: balance top one at the middle, the
second over the third at ½, and the trio over the
table edge at the center of gravity = (1+2+2½)/3
= 1⅚ from right end
1⅚
1
½
7/12/2016
Stacking books
Three books: balance top one at the middle, the
second over the third at ½, and the trio over the
table edge at the center of gravity = (1+2+2½)/3 =
1⅚ from right end
1⅚
1
½
⅓
See a pattern?
7/12/2016
The Harmonic Series Diverges
n
• Let
1
H n . Then for any n,
i0 i
n
H 2n 1.
2
• Doubling the number of terms adds at least
½ to the sum
• Corollary. The series diverges, that is,
For every m 0, there is an n such that H n m.
7/12/2016
Proof by WOP that the Harmonic Series
Diverges
n
Let P(n) H 2n 1 and let C {n : P(n) is false}.
2
Suppose C is nonempty. Let m be the minimal element of C.
0
m
0 C since H 20 1 1. So m 1 and H m 1.
2
2
7/12/2016
The Harmonic Series Diverges
2m
But then H 2m1
7/12/2016
1
1
m1
H 2m (a sum of 2 terms, each m )
2
i2 m1 1 i
m1 1
H 2m 2
2m
1
H 2m
2
m
1
1 by hypothsis about H m
2
2
m 1
1 so H m was not minimal.
2
So with a stack of 31 books
you get 2 book lengths off the table!
And there is no limit to how far the stack can
extend!
http://mathforum.org/advanced/robertd/harmonic.html
7/12/2016
FINIS