Prove by mathematical induction that 2⁴ⁿ + 31ⁿ – 2 is divisible by 15 for all positive integers n.
- Prove by mathematical induction that 2⁴ⁿ + 31ⁿ – 2 is divisible by 15 for all positive integers n.[6]
Mark scheme
Marking points from the official mark scheme (May/June 2021). The mark or mark type is shown in brackets.
- [B1] Checks base case.
- [B1] States inductive hypothesis.
- [M1 A1] Separates 2⁴ᵏ +31ᵏ – 2 or considers difference.
- [A1] is divisible by 15 because 15×2⁴ᵏ +30×31ᵏ is divisible by 15.
- [A1] Hence, by induction, true for every positive integer n.
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 →