Solve using mathematical induction

a. 3n < n! ; for n > 6

b. 2n > n2 ; for n > 4
c. n2 + n is divisible by 2 for n >= 0
d. n3 + 2n is divisible by 3 for n >= 0
e. 4n+1 + 52n-1 is divisible by 21 for n >= 0
f. 122n-1 + 11n+1 is divisible by 133 for n >= 0
g. 1.1! + 2.2! + ….. + n.n! = (n + 1)! -1 ; n is a positive integer
3 (5𝑛+1 −1)
h. 3 + 3.5 + 3.52 + …. + 3.5n = ; n is a non-negative integer
4
1−( −7)𝑛+1
i. 2 - 2.7 + 2.72 - …… + 2(-7)n = ; n is a non-negative integer
4
𝑛(𝑛+1)
j. 12 - 22 + 32 - …… + (-1)n-1 n2 = (-1)n-1 ; n is a positive integer
2

k. Prove 2n < n! for every integer with n >= 4

(𝑛+1) (2𝑛+1) (2𝑛+3)
l. Prove 12 + 32 + 52 +.…….+ (2n + 1 )2 = ; n is a nonnegative integer
3

m. Prove that for every positive integer n,

∑𝑛𝑘=1 𝑘. 2𝑘 = (𝑛 − 1)2𝑛−1 + 2

n. For every positive integer n,

𝑛 (𝑛+1) (𝑛+2) (𝑛+3)
1.2.3 + 2.3.4 + …… + n (n+1) (n+2) = 4

o. Prove that 6 divides n3 -3 whenever n is a non-negative number.

p. Prove that n2-1 is divisible by 8 whenever n is odd positive integer.