Sol 4
Sol 4
Sol 4
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.
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
Base step We establish P (1). Clearly, 1 = 16 1(1 + 1)(2 + 1). Thus, P (1) is true.
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.
Base step We establish P (1). Clearly, 1 = 14 1(1 + 1)2 . Thus, P (1) is true.
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.
(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.
(2n )
Base Step We establish P (5). Now, n = 252, while 210−2 = 256. Thus, P (5) is true.
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.
f0 := 0
f1 := 1
fn := fn−1 + fn−2 , for all n ≥ 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.
f1 + f3 + · · · + f2n−1 = f2n
4
Inductive Step We assume that P (k) is true. We will show that P (k + 1) is true.
f2 + f4 + · · · + f2n = f2n+1 − 1
Inductive Step We assume that P (k) is true. We will show that P (k + 1) is true.