
P1: OSO/OVY P2: OSO/OVY QC: OSO/OVY T1: OSO
MHDQ256-Ch09 MHDQ256-Smith-v1.cls December 17, 2010 19:47
LT (Late Transcendental)
CONFIRMING PAGES
564 CHAPTER 9
..
Infinite Series 9-34
48. Numerically investigate the p-series
∞
k=1
1
k
0.9
and
∞
k=1
1
k
1.1
and
for other values of p close to 1. Can you distinguish convergent
from divergent series numerically?
APPLICATIONS
49. Suppose that you toss a fair coin until you get heads. How
many times would you expect to toss the coin? To answer this,
notice that the probability of getting heads on the first toss is
1
2
, getting tails then heads is
1
2
2
, getting two tails then heads
is
1
2
3
and so on. The mean number of tosses is
∞
k=1
k
1
2
k
.
Use the Integral Test to prove that this series converges and
estimate the sum numerically.
50. The series
∞
k=1
k
1
2
k
can be visualized as the area shown in
the figure. In columns of width one, we see one rectangle
of height
1
2
, two rectangles of height
1
4
, three rectangles of
height
1
8
and so on. Start the sum by taking one rectangle
from each column. The combined area of the first rectangles
is
1
2
+
1
4
+
1
8
+···. Show that this is a convergent series with
sum 1. Next, take the second rectangle from each column that
has at least two rectangles. The combined area of the second
rectangles is
1
4
+
1
8
+
1
16
+···. Show that this is a convergent
series with sum
1
2
. Next, take the third rectangle from each
column that has at least three rectangles. The combined area
from the third rectangles is
1
8
+
1
16
+
1
32
+···. Show that this
is a convergent series with sum
1
4
. Continue this process and
show that the total area of all rectangles is 1 +
1
2
+
1
4
+···.
Find the sum of this convergent series.
0
0.125
0.25
0.5
1 2 3 4
y
0.375
51. Thecoupon collectors’ problem is facedbycollectors of trad-
ing cards. If there are n differentcards that make a complete set
and you randomly obtain oneat a time,how many cards would
youexpecttoobtainbeforehavingacompleteset?(Byrandom,
we mean that each different card has the same probability of
1
n
ofbeingthenextcardobtained.) Inexercises51–53,wefindthe
answer for n = 10. The first step is simple; to collect one card
youneedtoobtainonecard.Now,giventhat you haveone card,
how many cards do you need to obtain to get a second (differ-
ent)card?If you’relucky,thenextcardisit(thishasprobability
9
10
).Butyour next card might bea duplicate, thenyou get anew
card (this has probability
1
10
·
9
10
). Or you might get two dupli-
cates and then a newcard (this has probability
1
10
·
1
10
·
9
10
); and
so on. The mean is 1 ·
9
10
+ 2 ·
1
10
·
9
10
+ 3 ·
1
10
·
1
10
·
9
10
+···
or
∞
k=1
k
1
10
k−1
9
10
=
∞
k=1
9k
10
k
. Using the same trick as in
exercise 50, show that this is a convergent series with
sum
10
9
.
52. In the situation of exercise 51, if you have two different cards
out of ten, the average number of cards to get a third distinct
card is
∞
k=1
8k2
k−1
10
k
; show that this is a convergent series with
sum
10
8
.
53. (a) Extend the results of exercises51 and 52 to find the average
number of cards you need to obtain to complete the set of
ten different cards.
(b) Compute the ratio of cards obtained to cards in the set. That
is, for a set of 10 cards, on the average you need to obtain
times 10 cards to complete the set.
54. (a) Generalize exercise 53 in the case of n cards in the set
(n > 2).
(b) Use the divergence of the harmonic series to state the un-
fortunate fact about the ratio of cards obtained to cards in
the set as n increases.
EXPLORATORY EXERCISES
1. In this exercise, you explore the convergence of the infinite
product P = 2
1/4
3
1/9
4
1/16
···. This can be written in the form
P =
∞
k=2
k
1/k
2
. For the partial product P
n
=
n
k=2
k
1/k
2
, use the
natural logarithm to write
P
n
= e
ln P
n
= e
ln[2
1/4
3
1/9
4
1/16
···n
1/n
2
]
= e
S
n
, where
S
n
= ln[2
1/4
3
1/9
4
1/16
···n
1/n
2
]
=
1
4
ln2 +
1
9
ln3 +
1
16
ln4 +···+
1
n
2
lnn.
By comparing to an appropriate integral and showing that the
integral converges, show that {S
n
} converges. Show that {P
n
}
converges to a number between 2.33 and 2.39. Use a CAS or
calculator to compute P
n
for large n and see how accurate the
computation is.
2. Define a function f (x) in the following way for 0 ≤ x ≤ 1.
Write out the binary expansion of x. That is,
x =
a
1
2
+
a
2
4
+
a
3
8
+···
where each a
i
is either 0 or 1. Prove that this infinite series
converges. Then f (x) is the corresponding ternary expansion,
given by
f (x) =
a
1
3
+
a
2
9
+
a
3
27
+···
Prove that this series converges. There is a subtle issue here
of whether the function is well defined or not. Show that
1
2
can be written with a
1
= 1 and a
k
= 0 for k ≥ 2 and also with
a
1
= 0 and a
k
= 1 for k ≥ 2. Show that you get different val-
ues of f (x) with different representations. In such cases, we
choose the representation with as few 1’s as possible. Show
that f (2x) = 3 f (x) and f
x +
1
2
=
1
3
+ f (x)for0 ≤ x ≤
1
2
.
Use these facts to compute
!
1
0
f (x) dx. Generalize the result
for any base n conversion
f (x) =
a
1
n
+
a
2
n
2
+
a
3
n
3
+···,
where n is an integer greater than 1.