(i) The LCM, and why it matters
Factorise each divisor:
2=23=34=225=56=2×3
Take the highest power of each prime:
LCM(2,3,4,5,6)=22×3×5=60
N leaves remainder 1 on division by each of 2, 3, 4, 5 and 6. Taking away that 1 leaves a number that each of them divides exactly. So N−1 is a common multiple of all five — and every common multiple is a multiple of the LCM.
Answer: LCM = 60, and N−1 is a multiple of 60.
(ii) The smallest value of N
From part (i), N is one of
61,121,181,241,301,361, …
Now test each for divisibility by 7:
61=7×8+5121=7×17+2181=7×25+6
241=7×34+3301=7×43 ✓
Answer: N=301.
Check: 300=60×5, so 301 leaves remainder 1 on division by 2, 3, 4, 5 and 6 ✓, and 301=7×43 ✓.
(iii) The third smallest value
Suppose N works. Add a number k to it. The new number N+k still works exactly when k is a multiple of 2, 3, 4, 5, 6 and 7 — that is, a multiple of
LCM(60,7)=60×7=420
(60 and 7 share no prime factor.) So the values of N go up in steps of 420:
301,301+420=721,721+420=1141
Answer: the locker code is 1141.
Check: 1140=60×19 ✓ and 1141=7×163 ✓.
(iii) OR — values below 2000
The values are 301,721,1141,1561,1981,2401,… — each 420 more than the last (see the reasoning above).
301,721,1141,1561,1981
are all below 2000, and the next, 2401, is not.
Answer: 5 numbers.