Community mocks

tmua.fyi Paper 2 Challenge 1 · Q4

Paper 2Logic & proofNumber & counting

A proof that there is no largest prime begins: “Suppose, for contradiction, that pp is the largest prime.” It then considers the number N=(2×3×5×⋯×p)+1N=(2\times3\times5\times\cdots\times p)+1, the product of all primes up to pp, plus one. The property of NN that drives the contradiction is that:

ANN is itself prime
BNN is even
CNN leaves remainder 11 on division by every prime up to pp
DNN is a perfect square
ENN is divisible by pp

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