24 lines
392 B
Plaintext
24 lines
392 B
Plaintext
def digital_root(n)
|
|
ap = 0
|
|
n = +(int(n))
|
|
while n >= 10
|
|
sum = 0
|
|
for digit in str(n)
|
|
sum += int(digit)
|
|
end
|
|
n = sum
|
|
ap += 1
|
|
end
|
|
return {ap, n}
|
|
end
|
|
|
|
println "here"
|
|
|
|
if main
|
|
values = {627615, 39390, 588825, 393900588225, 55}
|
|
for n in values
|
|
aproot = digital_root(n)
|
|
println format("%12d has additive persistence %2d and digital root %d.", n, aproot[0], aproot[1])
|
|
end
|
|
end
|