Prove by induction that

n i=0

1 1 x(n+1) = . xi 1 x 1

Proof. We proceed by induction on n 0, where n Z. Let P (n) be the statement

n

P (n) :
i=0

1 x(n+1) 1 = . xi 1 x 1

Base Step: Let n = 0. The LHS of P (0) is

1 x0

= 1 and the RHS of P (0) is

1x(0+1) 1x1

1x1 1x1

= 1, hence P (0) is true.

Inductive Step: Let n = k. Suppose that for some k 0,

k

P (k ) :
i=0

1 1 x(k+1) = . xi 1 x 1

Under this assumption we shall prove that

k+1

P (k + 1) :
i=0

1 x(k+2) 1 = . xi 1 x1

We note that the LHS of P (k + 1) is

k+1

i=0

1 = xi

i=0

1 1 + k+1 . i x x

(1)

Since we are assuming that P (k ) is true, we can substitute

k

i=0

1 x(k+1) 1 with into (1) to obtain, xi 1 x 1 1 1 x(k+1) 1 = + k+1 i 1 x 1x x 1 x(k+1) + x(k+1) 1 1x 1 x(k+1) x(k+1) x(k+2) = + 1 x1 1 x1 (k+2) 1x = , 1 x1 =

(2)

k+1

i=0

which is the RHS of P (k + 1). Since the LHS of P (k + 1) is equal to the RHS of P (k + 1), we have proved that P (k ) implies P (k + 1). Thus, by the Principle of Mathematical Induction, P (n) is true for all n 0, where n Z. 1

Prove by induction that 2n > n3 for every integer n 10. Proof. We proceed by induction on n. Let P (n) be the statement P (n) : 2n > n3 , wheren Z. Base Step: Let n = 10. The LHS of P (10) is 210 = 1024 and the RHS of P (10) is 103 = 1000, hence P (10) is true. Inductive Step: Let n = k. Suppose that for some k 10, P (k ) : 2k > k 3 . Under this assumption we shall prove that P (k + 1) : 2k+1 > (k + 1)3 . Now, 2k+1 = 2 2k > 2k 3 , multiplying by 2 preserves the inequality 2k 3 = k 3 + k 3 = k3 + k k2 k 3 + 10k 2 , since k 10 > k 3 + 7k 2 = k 3 + 3k 2 + 3k 2 + k 2 k 3 + 3k 2 + 3k + 1, since 3k 2 + k 2 > 3k + 1 = (k + 1)3 . Therefore we have proved that P (k ) implies P (k +1). Thus, by the Principle of Mathematical Induction, P (n) is true for all n 10, where n Z.