OCR Further Pure Core AS 2018 June — Question 7

Exam BoardOCR
ModuleFurther Pure Core AS (Further Pure Core AS)
Year2018
SessionJune
TopicProof by induction
7 Prove by induction that \(2 ^ { n + 1 } + 5 \times 9 ^ { n }\) is divisible by 7 for all integers \(n \geqslant 1\).
This paper (8 questions)
View full paper
Q1 Q2 Q3 Q4 Q5 Q6 Q7 Q8