Community mocks

tmua.fyi Paper 2 Challenge 2 · Q7

Paper 2Logic & proofNumber & counting

Which statement best justifies the claim that n3−nn^3-n is divisible by 66 for every integer nn?

An3n^3 and nn always have the same parity.
B66 divides n3n^3 for every integer nn.
Cn3−n=n(n2−1)n^3-n=n(n^2-1), and n2−1n^2-1 is always even.
DThe result holds for n=1,2,3n=1,2,3 and therefore for all nn.
En3≡n(mod6)n^3\equiv n\pmod6 because 66 has no repeated prime factor.
Fn3−n=(n−1)n(n+1)n^3-n=(n-1)n(n+1), and a product of three integers is always divisible by 66.
Gn3−nn^3-n is even, and every even number is divisible by 66.
Hn3−n=(n−1)n(n+1)n^3-n=(n-1)n(n+1) is a product of three consecutive integers, so one of them is a multiple of 33 and at least one is even.

Read the questions freely. Sign in to check your answer, see the worked solution and save your progress.