Hostname: page-component-78c5997874-lj6df Total loading time: 0 Render date: 2024-11-06T02:30:08.007Z Has data issue: false hasContentIssue false

On Sums of Digits

Published online by Cambridge University Press:  03 November 2016

Extract

If we form the sum S(n) of the digits of a number n, and then the sum of the digits of S(n), and so on, in a finite number of steps we reach a number of one digit, R(n), which we call the reduce of n.

Starting with a number prime to 9, say 2, consider the reduces of powers of 2; we obtain the sequence 2, 4, 8, 7, 5, 1, 2, 4, 8, ..., which recurs after the sixth term. Consider next a five-digit number, say 16427; from this we derive 15794 formed by replacing each digit of 16427 by the reduce of the sum of the remaining digits. Repeating the transformation, we obtain in turn 73184, 72461, 49751, 48137, 16427, the number being restored to its original value after only six transformations. It will be found that a three-digit number repeats after eighteen transformations and yet for a twenty-digit number only six transformations are needed.

Type
Research Article
Copyright
Copyright © Mathematical Association 1941 

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)