Talk:Iterated digits squaring: Difference between revisions

 

I downloaded a D compiler and produced my first program in D here [[Combinations with repetitions/Square Digit Chain]]. It uses the combRep procedure defined here [[Combinations with repetitions]]. I suggest this shows that the cobanatronics in this task is a duplication of work already produced in [[Combinations with repetitions]]. I would like to change the task description to require a function which when given a number returns true or false indicating that that number translates to 1 or not according to the rules for square digit number chaining, and to demonstrate the function by counting the number which translate to 1 upto the Project Euler #92 limit of 10**7. No special coding being required for speed, de-emphasizing the timing and emphasizing that a large n in the chain rapidly becomes a small n, but a small n may become a slightly larger n for a time.--[[User:Nigel Galloway|Nigel Galloway]] ([[User talk:Nigel Galloway|talk]]) 11:26, 18 September 2014 (UTC)