Imagine a list of the first 10^k positive integers, k>12.
Step A: Replace each of the numbers by its s.o.d.
Step B: Unless the list contains only single-digit numbers -
return to Step B.

In the final list - are there more ones than twos or else?

Please comment on your result.

The digital root of a positive integer n is simply n mod 9 (except if the result is 0, change it to 9).  In other words this is just a repeating sequence from 1-9 over and over again, and since the list starts and ends with a 1, there would be one more 1 than 2 in the final list. 

Posted by tomarken on 2021-05-10 10:19:33