Comments 2

I've also heard this one split into proving divisible by 2 and then by 3 if the candidate is struggling with the 6. Can be done by induction or by factorising into (n+1)(n)(n-1) and observing the product of 3 consecutive numbers. Strikes me that the factorising route would look more insightful to an interviewer. (submitted by Oxford applicant)