Step 8 of 18 · Worked example
0 of 3 done
Work through the example to CHECK to open the problems.
Reach CHECK to open the problems.Higher Level · Number · Step 8Set out the base case, the induction hypothesis and the induction step separately.
Prove by induction, for all natural numbers n: (a) 1·2 + 2·3 + … + n(n + 1) = n(n + 1)(n + 2)/3; (b) 5²ⁿ − 1 is divisible by 24; (c) 3ⁿ > 2n.
Prove by induction that, for all natural numbers n:
(a) 1·2 + 2·3 + … + n(n + 1) = n(n + 1)(n + 2)/3
(b) 5²ⁿ − 1 is divisible by 24
(c) 3ⁿ > 2n
Higher Level Maths · Number · Step 8 of 18
Base case, induction hypothesis and induction step, applied to identities, inequalities and divisibility patterns.
Induction is the standard Higher Level tool for proving that a statement holds for every natural number, and it is marked on the structure as much as the algebra.
Prove by induction that, for all natural numbers n: (a) 1·2 + 2·3 + … + n(n + 1) = n(n + 1)(n + 2)/3 (b) 5²ⁿ − 1 is divisible by 24 (c) 3ⁿ > 2n
proof by induction · base case · induction hypothesis · induction step · natural number · divisible · inequality