MthT 430 Chapter 2 Projects to Turn in September 20, 2006
MthT 430 Chapter 2 Projects to Turn in September 20, 2006
This assignment should be typed or written very neatly.
In writing a proof using mathematical induction (PMI), write a careful statement of P(k).
1.
Prove by PMI or otherwise:
1
3
+ 2
3
+
¼
+ n
3
= (1 + 2 +
¼
+ n)
2
.
This also proves a formula stated in Spivak Problem 2.7.
See also
http://www.math.com/tables/expansion/power.htm
2.
(Spivak Problem 2.19) Prove the inequality (Bernoulli): If h >
-
1, then
(1 + h)
n
³
1 + n h.
File translated from T
E
X by
T
T
H
, version 3.77.
On 04 Sep 2007, 11:25.