Divisibility

Chambers's Encyclopaedia, Volume 4: Dionysius to Friction, p. 24

Divisibility, in the Theory of Numbers, is that property of any number whereby it may be divided by another without remainder. To find the condition of divisibility of one number, N, by another, D. Let N = b_0 + b_1 r + b_2 r^2 + \dots + b_{m-1} r^{m-1} + b_m r^m, where b_0, b_1, \&c. are coefficients, and r is the radix of the notational scale (see NOTATION). Introducing D and -D along with r, this may be written: N = b_0 + b_1 (D + r - D) + b_2 (D + r - D)^2 + \dots + b_m (D + r - D)^m. Expanding the terms on the right-hand side of this equation, it will appear that \frac{N}{D} will be an integer if b_0 + b_1 (r - D) + \dots + b_m (r - D)^m be divisible by D. For example, if r = 10 (i.e. if the number be given in the denary or ordinary scale), and D = 9, and therefore r - D = 1, any number will be divisible by 9 if the sum of its coefficients b_0, b_1, \&c. be so—i.e. if the sum of its digits be divisible by 9. Further rules found in this manner are fully given in Mackay's Arithmetical Exercises.

Source scan(s): p. 0033