SOLUTIONS TO HOMEWORK SET 2, MA1A SECTION 1

(1) We begin by noting that for n ≥ 1 we have 4n2 + 4n < 4n2 + 4n + 1 (as 0 < 1). Taking the positive
square
p root on both sides (which is an increasing function, so preserves thepinequality) we get
2 n(n + 1) < 2n + 1. Subtracting 2n of both sides and rearranging√gives us 2( n(n + 1) − n) < 1.
√ √
Finally dividing by n > 1 leaves us with the desired inequality 2( n + 1 − n) < √1n .
p
Likewise we can start with 4n2 − 4n 2
p< 4n − 4n + 1, take square roots to get 2 n(n − 1) < 2n − 1,
subtract 2n from both sides to getp2( n(n − 1) − n) < −1, multiply both sides by −1 (which inverts
√ √ √
the inequality sign) to get 2(n − n(n − 1)) > 1 and divide by n to get 2( n − n − 1) > √1n .
Now we can sum the above inequalities for 1 ≤ n ≤ m to get
m m m
X √ √ X 1 X √ √
2( n + 1 − n) < √ < 2( n − n − 1).
n=1 n=1
n n=1

Using the telescoping property (exercise I.4.7.2c) we get evaluate the sums on the left and right hand
sides to get
m
√ √ X 1 √ √
2( m + 1 − 1) < √ < 2( m − 0),
n=1
n
√
√ is almost the desired equation. To fix the left hand side we just note that 2 m − 2 <
which
2( m + 1 − 1). However,√the right
√ hand side needs to be strengthened. To get the desired right
hand side we use √1n < 2( n − n − 1) for 2 ≤ n ≤ m and √1n = 1 for n = 1, to get
m m m
X 1 X 1 X √ √ √ √ √
√ =1+ √ <1+ 2( n − n − 1) = 1 + 2( m − 1) = 2 m − 1.
n=1
n n=2
n n=2

√ works if m ≥ 2 (otherwise we would have an equality).

Note that this last equation only
Now plug in m = 106 (thus m = 1000) to see that
6
10
X 1
1998 = 2 · 1000 − 2 < √ < 2 · 1000 − 1 = 1999.
n=1
n

Note that the proofs I gave here are in the inverted order to the how I found them; this is a
common feature: if you want to prove something you start with what you want to prove and try to
rewrite that as something you already know. In the proof itself however you want to start with what
you know and show how, from something known, you obtain something you want to show. In that
order, every single step it is clear that what you say is true.
(2) (a) This is false, take x = −6, then x < 5, but |x| = 6 ≥ 5.
(b) This is true. Suppose |x − 5| < 2, then 7 − x = 2 + 5 − x > 2 − |5 − x| > 0, and x − 3 =
2 + x − 5 < 2 − |x − 5| < 0. Here we just use the fact that −|5 − x| < 5 − x and −|x − 5| < x − 5,
and that |x − 5| = |5 − x|.
(c) This is true. Suppose |1 + 3x| ≤ 1, then x + 32 = 31 (3x + 1) + 13 ≥ − 31 |3x + 1| + 13 ≥ − 13 + 31 = 0.
(Note that you can also find that x ≤ 0. However, we only wanted to know whether |1 + 3x| ≤ 1
implies x ≥ − 23 , not if both expressions are equivalent (which they are not)).
(d) This is false, take x = 32 , then |x − 1| = 12 = |x − 2|.
(e) This is false, take x = 3, then, as 2x + y > 0 (being the sum of two positive numbers) we have
|2x + y| = 2x + y = 6 + y > 6, thus it can never be equal to 5. (Note this is only true as we
insist on y > 0).
1
 (3) (a) Let us rewrite the desired right hand side in terms of the capital sigma symbol as
Pp−1
(b − a) k=0 ak bp−1−k . Using the distributivity of multiplication, we see that this equals
p−1
X p−1
X p−1
X
(b − a) ak bp−1−k = b ak bp−1−k − a ak bp−1−k
k=0 k=0 k=0
p−1
X p−1
X p−1
X
= ak bp−k − ak+1 bp−1−k = (ak bp−k − ak+1 bp−1−k = bp − ap ,
k=0 k=0 k=0

where, in the final equation we use that the sum telescopes (i.e. it becomes a0 pp−0 −ap−1+1 bp−1−(p−1) ).
(b) Plugging in b = n + 1 and a = n and replacing p by p + 1 in part (a) we get
p
X p
X
(n + 1)p+1 − np+1 = (n + 1 − n) nk (n + 1)p−k = nk (n + 1)p−k .
k=0 k=0

Now we notice that the right hand consists of p + 1 terms, all satisfying np ≤ nk (n + 1)p−k ≤
(n + 1)p . In particular we see that
p
X
p
(p + 1)n ≤ nk (n + 1)p−k ≤ (p + 1)(n + 1)p .
k=0

In fact, for p ≥ 1 these inequalities are strict, as equality in np ≤ nk (n + 1)p−k ≤ (n + 1)p

only holds for k = 0 (for the first inequality), respectively k = p (for the second inequality).
Combining everything and dividing by p + 1 yields
(p + 1)np (n + 1)p+1 − np+1 (p + 1)(n + 1)p
np = < < = (n + 1)p .
p+1 p+1 p+1
Note that this holds not just for positive integers n but also for n = 0.
1
(c) We will prove these inequalities by induction. For n = 1 the statement is that 0 < p+1 < 1,
which is obviously true. Suppose we have
n−1 n
X np+1 X
kp < < kp .
p+1
k=1 k=1
p+1 p
Adding ((n + 1) − n )/(p + 1) to both all sides of the inequality leads to
n−1 n
(n + 1)p+1 − np X p (n + 1)p+1 − np np+1 (n + 1)p+1 − np X p
+ k < + < + k .
p+1 p+1 p+1 p+1
k=1 k=1

Simplifying the middle term, and using part (b) on the outer two terms we get
n n−1 n−1
X X (n + 1)p+1 − np X p (n + 1)p+1
k p = np + kp < + k <
p+1 p+1
k=1 k=1 k=1
n n n+1
(n + 1)p+1 − np X p X X
< + k < (n + 1)p + kp = kp .
p+1
k=1 k=1 k=1

Thus we have shown the induction step, and we have proven the result for all n.

Another proof by using telescoping sums is as follows: Replacing n by k in part (b) and summing
for 0 ≤ k ≤ N − 1 we get
N −1 N −1 N −1
X X X (k + 1)p+1 − k p+1 (N − 1 + 1)p+1 − 0p+1 N p+1
kp = kp < = = .
p+1 p+1 p+1
k=1 k=0 k=0
2
 Here we used that for k = 0 the term 0p = 0, and use telescoping to evaluate the fourth sum.
Likewise (summing the upper bound of part (b) for 0 ≤ k ≤ N − 1 we find
N N −1 N −1
X X X (k + 1)p+1 − k p+1 N p+1
kp = (k + 1)p > = .
p+1 p+1
k=1 k=0 k=0
In the first equality we shifted the summation variable, which leaves the sums identical (term
by term). √
(4) (a) We find that f (t) = [ t] is a step function on [0, 9], with respect to the partition x0 = 0, x1 = 1,
x2 = 4 and x3 = 9. The value in (0, 1) equals 0, in (1, 4) equals 1, and in (4, 9) equals 2. Thus
Z 9√
[ t]dt = 0 · (1 − 0) + 1 · (4 − 1) + 2 · (9 − 4) = 0 + 3 + 10 = 13.
0
(b) More in general we find that f on [0, n2 ] is a step function with partition xk = k 2 (0 ≤ k ≤ n)
and values sk = k − 1 in the interval (xk−1 , xk ) (for 1 ≤ k ≤ n). Thus for the integral we get
Z n2 √ n
X n
X n
X n
X
[ t]dt = sk (xk − xk−1 ) = (k − 1)(k 2 − (k − 1)2 ) = (k − 1)(2k − 1) = 2k 2 − 3k + 1
0 k=1 k=1 k=1 k=1
n n n
X X n(n + 1)(2n + 1)
X n(n + 1) n(n − 1)(4n + 1)
=2 k2 − 3 k+ 1=2 −3 +n= .
6 2 6
k=1 k=1 k=1
Pn Pn
Here I used I.4.7 problems 5 and 6 to evaluate the series k=1 k 2 and k=1 k.
(5) Suppose s and t are step functions. Let {xk } be a partition such that both step functions are constant
on the intervals (xk−1 , xk ) (which exists, see common refinement); where x0 = a and xn = b. Let
s(x) = sk and t(x) = tk for x ∈ (xk−1 , xk ). Then (s + t)(x) = sk + tk in the interval (xk−1 , xk ).
Plugging in the definitions of integrals we see that
Z b Xn n
X n
X Z b Z b
(s + t)(x)dx = (sk + tk )(xk − xk−1 ) = sk (xk − xk−1 ) + tk (xk − xk−1 ) = s(x)dx + t(x)dx,
a k=1 k=1 k=1 a a

which proves the additivity of the integral for step functions.