Given that nnn is an integer, use algebra to prove by contradiction that if n2n^2n2 is a multiple of 3, then nnn is a multiple of 3.
132 exam-style questions on OCR (MEI) A Level Maths 1.1 Proof, covering 1.1.1 Structure of mathematical proof, 1.1.2 Disproof by counter example, 1.1.3 Proof by contradiction (A-level only), and 1.1 Proof. Each one has a worked solution and a mark scheme showing where the marks go.