1) Division algorithm (the rule behind remainders)
For any whole number n and any positive divisor 7, there exist integers k (the quotient) and r (the remainder) such that
n = 7k + r, with 0 ≤ r ≤ 6.
So the possible remainders on division by 7 are only 0, 1, 2, 3, 4, 5, 6.
2) Apply it to “remainder = 2”
If a number leaves remainder 2 when divided by 7, then r = 2 in the formula:
n = 7k + 2.
This is exactly option (b) 7k + 2.
3) Quick checks with examples
Take k = 0 → n = 7·0 + 2 = 2 → 2 ÷ 7 = 0 remainder 2
k = 1 → n = 9 → 9 ÷ 7 = 1 remainder 2
k = 2 → n = 16 → 16 ÷ 7 = 2 remainder 2
k = 5 → n = 37 → 37 ÷ 7 = 5 remainder 2
So all numbers of the form 7k + 2 give remainder 2.
4) Why the other options are wrong
(a) 7k + 1 → remainder is 1 (example: 8 ÷ 7 leaves 1).
(c) 7k + 3 → remainder is 3 (example: 10 ÷ 7 leaves 3).
(d) 7k – 2 → this looks tempting, but note:
7k – 2 = 7(k – 1) + 5, so the standard (non-negative) remainder is 5, not 2.
Example: k = 2 → 7k – 2 = 12, and 12 ÷ 7 leaves remainder 5.
5) One-line “test”
To see which form matches remainder r, just reduce it mod 7:
Therefore, numbers that leave remainder 2 when divided by 7 are exactly those of the form 7k + 2 (option b).