You are viewing a single comment's thread. Return to all comments →
Totally agree with you. Here's what I did in Python:
def superDigit(n, k): if len(n)==1: return n return superDigit(str(sum(map(int, n))*k),1)
Seems like cookies are disabled on this browser, please enable them to open this website
Recursive Digit Sum
You are viewing a single comment's thread. Return to all comments →
Totally agree with you. Here's what I did in Python: