Skip to content

Course home

Proof

Proof

EasyMediumHard
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113
Question 106

Given that (4n+1)2−(4n−1)2(4n + 1)^2 - (4n - 1)^2(4n+1)2−(4n−1)2 simplifies to 16n16n16n, prove that it is always a multiple of 16, for all positive integer values of nnn.

[2]
Markscheme

Proof Questions

  1. GCSE
  2. /Maths
  3. /Proof

207 exam-style questions on Eduqas GCSE Maths Proof. Each one has a worked solution and a mark scheme showing where the marks go.

Question bank