IISER Kolkata Problem Sheet IV

MA 1101 : Mathematics I
Satvik Saha, 19MS154 September 13, 2019

Solution 1.
(i) Let P (n) be the statement
1
1 + 2 + ··· + n = n(n + 1) for all n ∈ N.
2

Base step We establish P (1). Clearly, 1 = 12 1(1 + 1). Thus, P (1) is true.

Inductive step We assume P (k) is true. We will show that P (k + 1) is true.

1 + 2 + · · · + k + (k + 1) = [1 + 2 + · · · + k] + (k + 1)
1
= k(k + 1) + (k + 1) (From P (k))
2
1
= (k + 2)(k + 1)
2
1
= (k + 1)((k + 1) + 1)
2

Hence, by the principle of mathematical induction, P (n) is true for all n ∈ N.

(ii) Let P (n) be the statement

1
1 2 + 2 2 + · · · + n2 = n(n + 1)(2n + 1) for all n ∈ N.
6

Base step We establish P (1). Clearly, 1 = 16 1(1 + 1)(2 + 1). Thus, P (1) is true.

Inductive step We assume P (k) is true. We will show that P (k + 1) is true.

12 + 22 + · · · + k 2 + (k + 1)2 = [12 + 22 + · · · + k 2 ] + (k + 1)2

1
= k(k + 1)(2k + 1) + (k + 1)2 (From P (k))
6
1
= (k + 1)(2k 2 + k + 6k + 6)
6
1
= (k + 1)(2k 2 + 7k + 6)
6
1
= (k + 1)(k + 2)(2k + 3)
6
1
= (k + 1)((k + 1) + 1)(2(k + 1) + 1)
6

Hence, by the principle of mathematical induction, P (n) is true for all n ∈ N.

(iii) Let P (n) be the statement

1
12 + 32 + · · · + (2n − 1)2 = (4n3 − n) for all n ∈ N.
3

Base step We establish P (1). Clearly, 1 = 13 1(4 − 3). Thus, P (1) is true.

1
 Inductive step We assume P (k) is true. We will show that P (k + 1) is true.
1 + 3 + · · · + (2k − 1)2 + (2k + 1)2 = [12 + 32 + · · · + (2k − 1)2 ] + (2k + 1)2
2 2

1
= (4k 3 − k) + (2k + 1)2 (From P (k))
3
1
= (4k 3 − k + 12k 2 + 12k + 3)
3
1
= (4(k 3 + 3k 2 + 3k + 1) − k − 1))
3
1
= (4(k + 1)3 − (k + 1))
3
Hence, by the principle of mathematical induction, P (n) is true for all n ∈ N.

(iv) Let P (n) be the statement

1 2
13 + 23 + · · · + n3 = n (n + 1)2 for all n ∈ N.
4

Base step We establish P (1). Clearly, 1 = 14 1(1 + 1)2 . Thus, P (1) is true.

Inductive step We assume P (k) is true. We will show that P (k + 1) is true.

13 + 23 + · · · + k 3 + (k + 1)3 = [13 + 23 + · · · + k 3 ] + (k + 1)3
1
= k 2 (k + 1)2 + (k + 1)3 (From P (k))
4
1
= (k + 1)2 (k 2 + 4k + 4)
4
1
= (k + 1)2 (k + 2)2
4
1
= (k + 1)2 ((k + 1) + 1)2
4
Hence, by the principle of mathematical induction, P (n) is true for all n ∈ N.

(v) Let P (n) be the statement

∑
n
1
r(r + 1) . . . (r + 9) = n(n + 1) . . . (n + 10) for all n ∈ N.
r=1
11

Base step We establish P (1). Clearly,

1
1(1 + 1) . . . (1 + 9) = 1(1 + 1) . . . (1 + 9)(1 + 10)
11
Thus, P (1) is true.

Inductive step We assume P (k) is true. We will show that P (k + 1) is true.

[ k ]
∑
k+1 ∑
r(r + 1) . . . (r + 9) = r(r + 1) . . . (r + 9) + (k + 1)(k + 2) . . . (k + 1 + 9)
r=1 r=1
1
= k(k + 1) . . . (k + 10) + (k + 1)(k + 2) . . . (k + 1 + 9) (From P (k))
11
1
= (k + 1) . . . (k + 10)(k + 11)
11
1
= (k + 1) . . . ((k + 1) + 9)((k + 1) + 10)
11
Hence, by the principle of mathematical induction, P (n) is true for all n ∈ N.

2
Solution 2.
(i) Let P (n) be the statement that for all n ∈ N,
3n > n2

Base step We establish P (1) and P (2). Clearly, 31 > 12 . Thus, P (1) is true. Again, 32 = 9 >
8 = 22 . Thus, P (2) is true.

Inductive step We assume P (k) is true. We will show that P (k + 1) is true.

3k+1 = 3 · 3k > 3 · k 2
We must show 3k 2 > (k + 1)2 ⇔ 3k 2 − (k + 1)2 > 0.
3k 2 − (k + 1)2 = 2k 2 − 2k − 1 = k 2 + (k − 1)2 − 2
Clearly, for k ≥ 2, k 2 > 2, so k 2 + (k − 1)2 > 2, and we are done.
Hence, by the principle of mathematical induction, P (n) is true for all n ∈ N.

(ii) Let P (n) be the statement that for all n ∈ N and x > −1,
(1 + x)n ≥ 1 + nx. (Bernoulli’s Inequality)

Base Step We establish P (1). Clearly, (1 + x)1 ≥ (1 + 1 · x), thus P (1) is true.

Inductive Step We assume P (k) is true. We will show that P (k + 1) is true.

(1 + x)k+1 = (1 + x)k · (1 + x)
≥ (1 + kx) · (1 + x) (x + 1 > 0)
2
= (1 + x + kx + kx )
≥ (1 + (k + 1)x) (k > 0 and x2 ≥ 0)

Hence, by the principle of mathematical induction, P (n) is true for all n ∈ N.

(iii) Let P (n) be the statement that for all n ≥ 5, n ∈ N,

( )
2n
< 22n−2 .
n

(2n )
Base Step We establish P (5). Now, n = 252, while 210−2 = 256. Thus, P (5) is true.

Inductive Step We assume P (k) is true. We will show that P (k + 1) is true.

( )
2(k + 1) (2k + 2)!
=
k+1 (k + 1)!2
( )
(2k + 2)(2k + 1) 2n
=
(k + 1)2 n
2k + 1 2k−2
< 2· ·2
k+1
2k + 2 2k−2
< 2· ·2
k+1
= 22(k+1)−2

Hence, by the principle of mathematical induction, P (n) is true for all n ≥ 5, n ∈ N.

3
Solution 3.
(i) Let P (n) be the statement that every n ≥ 2, n ∈ N has a prime divisor. We prove this using the
principle of strong mathematical induction.

Base Step We establish P (2). Clearly, 2 is a prime divisor of itself, so P (2) is true.

Inductive Step We assume that the statements P (2), P (3), . . . , P (k − 1) are all true. We will
show that P (k) is true.
If k ≥ 2 is prime, then we are done, as k is a prime divisor of itself. Otherwise, if k is not prime,
then k = ab for some 1 < a, b < k and a, b ∈ N. We see that a ≥ 2, so by the induction hypothesis,
a has a prime divisor p ∈ N, i.e., a = pc for some c ∈ N. Thus, k = (pc)b = p(cb), and cb ∈ N, so p
is a prime factor of k. This proves P (k).
Hence, by the principle of strong induction, P (n) is true for all n ≥ 2, n ∈ N.

(ii) We define the Fibonacci sequence (fn )n≥0 as follows.

f0 := 0
f1 := 1
fn := fn−1 + fn−2 , for all n ≥ 2

(a) We wish to show that for all n ∈ N,

[( √ )n ( √ )n ]
1 1+ 5 1− 5
fn = √ − (Binet’s formula)
5 2 2

We prove this using the principle of strong

√ mathematical induction.
√ Let P (n) be the afore-
mentioned statement, and let φ = (1 + 5)/2 and ψ = (1 − 5)/2. Note that φ and ψ both
satisfy x2 = x + 1.
( √ )2 √ √
1± 5 6±2 5 1± 5
= = +1
2 4 2

√
Base Step We establish P (1). Clearly, f1 = 1 = (φ − ψ)/ 5. Thus, P (1) is true.

Inductive Step We assume that the statements P (2), P (3), . . . , P (k) are all true. We will
show that P (k + 1) is true.

fk+1 = fk + fk−1
1 1
= √ (φk − ψ k ) + √ (φk−1 + ψ k−1 )
5 5
1
= √ (φk−1 (φ + 1) − ψ k−1 (ψ + 1))
5
1
= √ (φk−1 (φ2 ) − ψ k−1 (ψ 2 ))
5
1
= √ (φk+1 − ψ k+1 )
5
Hence, by the principle of strong induction, P (n) is true for all n ∈ N.

(b) Let P (n) be the statement that for all n ∈ N,

f1 + f3 + · · · + f2n−1 = f2n

Base Step We establish P (1). Clearly, f1 = 1 = f2 . Thus, P (1) is true.

4
 Inductive Step We assume that P (k) is true. We will show that P (k + 1) is true.

f1 + f3 + · · · + f2k−1 + f2k+1 = [f1 + f3 + · · · + f2k−1 ] + f2k+1

= f2k + f2k+1
= f2k+2
= f2(k+1)

Hence, by the principle of mathematical induction, P (n) is true for all n ∈ N.

(c) Let P (n) be the statement that for all n ∈ N,

f2 + f4 + · · · + f2n = f2n+1 − 1

Base Step We establish P (1). Clearly, f2 = 1 = 2 − 1 = f3 − 1. Thus, P (1) is true.

Inductive Step We assume that P (k) is true. We will show that P (k + 1) is true.

f2 + f4 + · · · + f2k + f2k+2 = [f2 + f4 + · · · + f2k ] + f2k+2

= f2k+1 − 1 + f2k+2
= f2k+3 − 1
= f2(k+1)+1 − 1

Hence, by the principle of mathematical induction, P (n) is true for all n ∈ N.