1
$\begingroup$

If $(m, 10) = 1$, choose $b$ so that $10 b \equiv 1 \pmod m$. Then $n \equiv 0 \pmod m$ if and only if $n' + ba_0 \equiv 0 \pmod m$, where $a_0$ is the unit's digit of $n$, and $n'=(n-a_0)/10$. First generalize this and tell me how to extend this theorem to general divisibility tests of other numbers by a single formula or method or procedure.

  • 0
    What are n' and $a_0$?2011-10-04
  • 0
    I suspect that $a_0$ is the last (one’s) digit of $n$ and that $n'=(n-a_0)/10$, the number that you get when you erase the last digit of $n$; is that correct?2011-10-04
  • 0
    @Brain M. Scott! Your suspected one is very right. The last digit is $a_0$.2011-10-04
  • 1
    Edited to include Brian's interpretations.2011-10-04

2 Answers 2