Prove, by mathematical induction, that, for integers n ≥ 2, 4ⁿ > 2n + 3ⁿ.
Mark scheme
Marking points from the official mark scheme (May/June 2012). The mark or mark type is shown in brackets.
- [B1] (States proposition.) (Pₙ: 4ⁿ > 2ⁿ + 3ⁿ)
- [B1] Proves base case. Let n = 2, 16 > 4 + 9 ⇒ P₂ is true.
- [B1] States inductive hypothesis. Assume Pₖ is true ⇒ 4ᵏ > 2ᵏ + 3ᵏ
- [M1] Proves inductive step. 4ᵏ⁺¹ = 4.4ᵏ > 4(2ᵏ + 3ᵏ ) = 4.2ᵏ + 4.3ᵏ
- [A1] > 2.2ᵏ + 3.3ᵏ = 2ᵏ⁺¹ + 3ᵏ⁺¹
- [A1 (CWO)] States conclusion. Hence result true, by PMI, for all integers n ≥ 2.
Write your answer and get it marked
On Oracle Prep you can write or photograph your own answer and have it marked by AI against this mark scheme, with feedback on what you missed.
Sign up free →