Find a counter example to disprove the statement: When n n\,n is a prime number n2 n^2\,n2 is always odd
Given that k k\,k is a positive constant, find a counter example, in terms of kkk, to disprove the statement: (x+k)2(x + k)^2(x+k)2 is always greater than x2+kx^2 + kx2+k
257 exam-style questions on Edexcel A Level Maths Algebraic Methods, covering 7.1 Algebraic Fractions, 7.2 Dividing Polynomials, 7.3 The Factor Theorem, 7.4 Mathematical Proof, and 7.5 Methods of Proof. Each one has a worked solution and a mark scheme showing where the marks go.