Standard +0.8 This is a standard proof by induction question requiring students to verify the base case, assume for n=k, and prove for n=k+1. While induction is a Further Maths topic making it inherently more challenging than Core content, this particular question follows a routine template with straightforward algebra (factoring out 4^k and showing divisibility by 6). It's moderately above average difficulty due to the proof requirement and algebraic manipulation needed, but doesn't require novel insight.
Use mathematical induction to prove that $4^n + 2$ is divisible by 6 for all positive integers $n$. [7]
\hfill \mbox{\textit{WJEC Further Unit 1 Q1 [7]}}