TMUA 2016 Paper 2 Q5 — Worked Solution

P2·Number Theory & Divisibility·5.5Official · 2016 · Q5

primesmodular-arithmeticcounterexample-count

Consider the statement:

(∗)

A whole number

n

is prime if it is 1 less or 5 less than a multiple of 6.

How many counterexamples to (∗) are there in the range

0 < n < 50

Discussion

No discussions yet. Stuck, or want to share an approach? Start the first one.