June 2020 Paper 1 Q5
5 Prove that, for integer values of \(n\) such that \(0 \leqslant n \lt 4\)
\[2^{n+2} \gt 3^n\][2 marks]
| Scheme | Marks | AO |
|---|---|---|
| Selects and begins to use a suitable method of proof. Exhaustion: Must check at least two correct values for \(n\) in the range \(0 \leqslant n \lt 4\) and make at least two correct comparisons. Comparisons are implied by ticks/crosses or use of true/false Direct proof: Takes logs to any base of both sides and uses a law of logs correctly once Contradiction: Must be clear they are attempting contradiction with “\(0 \leqslant n \lt 4\) and \(2^{n+2} \leqslant 3^n\)” assumed explicitly. Condone strict inequality | M1 | 3.1a |
| Completes a reasoned mathematical argument, proving \(2^{n+2} \gt 3^n\) when \(n\) is an integer and \(0 \leqslant n \lt 4\). Must include a fully correct concluding statement which refers to ‘integer’ or lists the four integers If using direct proof or contradiction they must use the laws of logs correctly to remove \(n\) from the exponent. Condone use of equality if direct proof used | R1 | 2.1 |
| (2 marks) |
Typical solution
| \(n\) | \(2^{n+2}\) | \(3^n\) | |
|---|---|---|---|
| 0 | 4 | 1 | \(4 \gt 1\) |
| 1 | 8 | 3 | \(8 \gt 3\) |
| 2 | 16 | 9 | \(16 \gt 9\) |
| 3 | 32 | 27 | \(32 \gt 27\) |
Hence \(2^{n+2} \gt 3^n\) for integer values of \(n\) such that \(0 \leqslant n \lt 4\)