all numbers ABCDEF = Ax10^5 + Bx10^4 + Cx10^3 ...

m*n=p

5*3 = 15 ---> 10+5 (div by 5 but not 3), 9+6 (3 but not 5), 8+7 (neither), 11+4
(neither), 12+3(3), 13+2 (neither), 14+1 (neither)

2*3 = 6 --> 5+1 (neither), 4+2(2), 3+3(3)

5*7 = 35 --> 17+18 (neither), 30+5 (5), 15+20 (5), 14+21 (7), 28 + 7 (7),

There are exactly (n-1) multiples of m less than p

There are exactly (m-1) multiples of n less than p

If [p = a + b] and a is a multiple of m, then b must also be a multiple of m. Why?

*because m*n = a + b = m*k + b ---> n = k + b/m where n must be an integer...
therefore b/m must be an integer meaning b must be a multiple... also, the multiple
**of b [b=m*k2] must add with k to give n ... n=k+k2