In the example I gave the divisor was 7 so the table is
0 x 7 = 0
1 x 7 = 7
2 x 7 = 14
.
.
.
9 x 7 = 63
That way when you are looking to get as close to the remainder without going over, for wateve...
Ah, yes. That's essentially the existence half of the proof of Euclid's Theorem.
