Prove by mathematical induction that 7²ⁿ – 1 is divisible by 12 for every positive integer n.
- (a)Prove by mathematical induction that 7²ⁿ – 1 is divisible by 12 for every positive integer n.[5]
Mark scheme
Marking points from the official mark scheme (Oct/Nov 2020). The mark or mark type is shown in brackets.
- [B1] 72-1=48 is divisible by 12. Checks base case.
- [B1] Assume that 72k −1 is divisible by 12 for some positive integer k. States inductive hypothesis.
- [M1] Then 72k+2-1=49.72k −1 = 48.72k +72 -1 Or (72k+2 −1)–(72k − 1) = 48.72k Separates 72k -1.
- [A1] 72k+2 −1 is divisible by 12.
- [A1] So if is true for n = k (could be written earlier) it is also true for n = k+1. Hence, by induction, true for every positive integer n. Depends on previous M1 and A1.
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 →