MOD looks like a curiosity until you see what it does. These four applications cover almost every exam use.
1. Testing whether a number is even or odd
IF number MOD 2 = 0 THEN
OUTPUT 'Even'
ELSE
OUTPUT 'Odd'
ENDIF
Why it works: every even number divides by 2 with no remainder, so MOD 2 gives 0. Every odd number leaves 1. This is the standard test and appears constantly in trace-table questions.
The same idea generalises: number MOD 3 = 0 tests whether a number is a multiple of 3; number MOD 5 = 0 tests for multiples of 5.
2. Cycling / wrapping around a range
# Move to the next player in a 4-player game, wrapping back to 0
currentPlayer ← (currentPlayer + 1) MOD 4
The result is always 0, 1, 2 or 3 — it can never escape the range. When currentPlayer is 3, (3 + 1) MOD 4 = 0 and it wraps neatly back to the start. This is how turn-taking, circular buffers and clock arithmetic work.
3. Extracting digits from a number
number ← 4729
lastDigit ← number MOD 10 # 9 — the units digit
remaining ← number DIV 10 # 472 — everything except the last digit
MOD 10 peels off the last digit; DIV 10 removes it. Repeat the pair in a loop and you can process every digit of a number in turn — the basis of digit-sum algorithms, check-digit validation and manual base conversion.
# Sum the digits of a number
total ← 0
WHILE number > 0
total ← total + (number MOD 10)
number ← number DIV 10
ENDWHILE
Trace with 4729: adds 9, then 2, then 7, then 4 → 22.
4. Converting units
totalSeconds ← 275
minutes ← totalSeconds DIV 60 # 4 — whole minutes
seconds ← totalSeconds MOD 60 # 35 — seconds left over
OUTPUT minutes, ' min ', seconds, ' sec' # 4 min 35 sec
Check: 4 × 60 + 35 = 275 ✓
The identical pattern converts pence to pounds-and-pence (DIV 100 / MOD 100), hours to days-and-hours (DIV 24 / MOD 24), and inches to feet-and-inches (DIV 12 / MOD 12).
AQA tip. The unit-conversion pattern is the most examined MOD application. Learn the shape: DIV gives the big unit, MOD gives the leftover small unit — and they always use the same divisor.