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.
107 exam-style questions on AQA A Level Maths 1.4.1 Structure and methods of proof. Each one has a worked solution and a mark scheme showing where the marks go.