Repeated Consecutive Digital Product Sum Convergence – codegolf.stackexchange.com

Given a positive integer n (Example: n=1234444999) Separate into consecutive digit runs: [1, 2, 3, 4444, 999] Take the digital product of each run. [1, 2, 3, 4*4*4*4, 9*9*9] = [1, 2, 3, 256, 729] ...

from Hot Questions - Stack Exchange OnStackOverflow
via Blogspot

Share this

0 Comment to "Repeated Consecutive Digital Product Sum Convergence – codegolf.stackexchange.com"