What is (1) different, and (2) the same, about carrying out the process with this starting point? Now choose your own starting point, and keep on repeating the process until you again notice something special; then try again several times, each with different starting points. I suggest that you keep a careful record of your results and then try and write down what you have discovered. Ask your teacher, or a friend (who likes arithmetic!) to check your results for you.
***
You should have discovered by now that whatever number you start with, you will either end up at the number zero (and stay there thereafter), or find yourself circulating repeatedly around a cycle of four numbers. For example, one such cycle is:
$$13 \to (3 \times 10) - 1 = 29 \to (9 \times 10) - 2 = 88 \to (8 \times 10) - 8 = 72 \to (2 \times10) - 7 = 13$$
We shall now begin to try to analyse what is happening here.
First we notice that given any whole number $K$ there are exactly $10$ whole numbers which go to $K$ when we apply the rule; for example, the numbers $-530$, $-429$, $-328$, $-227$, $-126$, $-25$, $76$, $177$, $278$, $379$ are all the numbers that map to $53$.
To see this, we start with any whole number $N$, which we may write as $N = 10M+R$, and note that this ends up at $K$ if $10R - M = K$ or, equivalently, if $M= 10R- K$.
This means to say that if $N$ goes to $K$, then $$N = 10 \times M + R = 10(10R - K) = 101 R - 10 K$$ As $R$ can take any value between $0$ and $9$ inclusive (and only these values), the numbers which go to $K$ when we apply the rule once are precisely the numbers: \begin{eqnarray} -10 K, 101 - 10 K, 202 - 10 K, 303 - 10 K, \ldots, 909 - 10K \end{eqnarray} Let us now look at a special case of this general result.
Obviously $0$ goes to $0$ when we apply the rule (for if $N =0$ then $M =0$ and $R =0$).
What else goes to $0$ in one step?
According to the list (1) above, there are exactly ten numbers which go to $0$ in one step, and putting $K =0$ in the list, we see that these are: $$0, 101, 202, 303, \ldots,909$$ Notice that these are all multiples of $101$. Pick one of these, say $303$ and now ask what goes to $303$ in one step. Of course, if $N$ goes to $303$ in one step, then it goes to $0$ in two steps. Again using the list above, the set of numbers that go to $303$ in one step is $$-10 \times 303, 101-(10 \times 303), 202-(10 \times 303), \ldots,808-(10 \times 303), 909-(10 \times 303)$$ and these too are all multiples of $101$.
This argument shows much more than this. It is clear from (1) that if $K$ is a multiple of $101$, then all ten numbers that go to $K$ in one step are also multiples of $101$. As $0$ is a multiple of $101 (0 - 0 \times 101)$, we see that every number that goes to $0$ in any number of applications of the rule must also be a multiple of $101$.
Here is a question: does the number $123456$ end up at $0$ or in a cycle of four numbers? Of course you can carry out the process many times, but is obviously much less work to see whether or not $123456$ is a multiple of $101$. Try it. What about the number $987654321$?
We have seen that every number that goes (after a number of steps) to $0$ is a multiple of $101$. This is not the same thing as saying that every multiple of $101$ does go to $0$ (after a certain number of steps) but this is true and in the next article we shall show this is so.
Published December 1997.