How can I prove this divisibility rules? $b \in \mathbb{Z}^+$
$2\mid b \Longleftrightarrow 2\mid r_0$
$3\mid b \Longleftrightarrow 3\mid(r_0+r_1+\cdots+r_n)$
$5\mid b \Longleftrightarrow 5\mid r_0$
$9\mid b \Longleftrightarrow 9\mid(r_0+r_1+\cdots+r_n)$
$11\mid b \Longleftrightarrow 11\mid(r_0-r_1+r_2-\cdots+(-1)^n r_n)$
Let
$$b=r_0+(r_1\times 10)+(r_2\times 10^2)+\cdots +(r_n\times 10^n)$$ so since
$$10^k\equiv 0\mod2,\quad\forall k\ge1$$ then $$b\equiv r_0\mod2$$ which prove the first rule and since
$$10^k\equiv 1\mod 3,\quad\forall k\ge0$$ then $$b\equiv r_0+\cdots+r_n\mod3$$ and this proves the second rule.
Can you take it from here to prove the other rules?