Use proof by contradiction to show that, when nnn is an integer, n2+2n^2 + 2n2+2 is never divisible by 4.
107 exam-style questions on OCR A Level Maths 1.1.4 Proof by contradiction (A-level only). Each one has a worked solution and a mark scheme showing where the marks go.