AQA FP2 2015 June — Question 4

Exam BoardAQA
ModuleFP2 (Further Pure Mathematics 2)
Year2015
SessionJune
TopicProof by induction

4 The expression \(\mathrm { f } ( n )\) is given by \(\mathrm { f } ( n ) = 2 ^ { 4 n + 3 } + 3 ^ { 3 n + 1 }\).
  1. Show that \(\mathrm { f } ( k + 1 ) - 16 \mathrm { f } ( k )\) can be expressed in the form \(A \times 3 ^ { 3 k }\), where \(A\) is an integer.
  2. Prove by induction that \(\mathrm { f } ( n )\) is a multiple of 11 for all integers \(n \geqslant 1\).