A-Level Maths
Courses
Papers
Questions
Search
Courses
LFM Pure
Proof by induction
Q5
OCR FP1 2012 June — Question 5
Exam Board
OCR
Module
FP1 (Further Pure Mathematics 1)
Year
2012
Session
June
Topic
Proof by induction
5 Prove by induction that, for \(n \geqslant 1 , \sum _ { r = 1 } ^ { n } 4 \times 3 ^ { r } = 6 \left( 3 ^ { n } - 1 \right)\).
This paper
(10 questions)
View full paper
Q1
Q2
Q3
Q4
Q5
Q6
Q7
Q8
Q9
Q10