Digit sum + digital root calculator

# Self-authored for the EML case corpus (no external origin). For each
# sample number, extracts digits via `%` (floor-mod) and `int(n / 10)`
# (EML has no `//` floor-division token, so truncating a true-division
# result via `int()` stands in for it on these non-negative inputs) inside
# a `while` loop to build the digit sum, then repeats that same reduction
# (a second, nested `while`) until a single digit remains — the "digital
# root". `^+` seeds each accumulator once per outer iteration (reset) and
# augments it on every inner-loop pass (add), the same declare-vs-augment
# idiom as word-frequency-counter's `counts[word]`.

numbers^+[4527, 918273, 60, 999999]

for number in numbers:
    number => n
    digit_sum^+0
    while n > 0:
        n % 10 => digit
        digit_sum^+digit
        int(n / 10) => n

    digit_sum => root
    while root > 9:
        root => m
        new_root^+0
        while m > 0:
            m % 10 => d
            new_root^+d
            int(m / 10) => m
        new_root => root

    "Number " + str(number) + ": digit sum = " + str(digit_sum) + ", digital root = " + str(root) => line
    line^0

numbers = [4527, 918273, 60, 999999]
for number in numbers:
    n = number
    digit_sum = 0
    while n > 0:
        digit = n % 10
        digit_sum += digit
        n = int(n / 10)
    root = digit_sum
    while root > 9:
        m = root
        new_root = 0
        while m > 0:
            d = m % 10
            new_root += d
            m = int(m / 10)
        root = new_root
    line = "Number " + str(number) + ": digit sum = " + str(digit_sum) + ", digital root = " + str(root)
    print(line)

Number 4527: digit sum = 18, digital root = 9
Number 918273: digit sum = 30, digital root = 3
Number 60: digit sum = 6, digital root = 6
Number 999999: digit sum = 54, digital root = 9

Trace event types