Revision as of 23:22, 13 September 2015 (view source) rosettacode>Gerard Schildberger (→‎Dup?: added more comments.) ← Older edit		Revision as of 02:57, 14 September 2015 (view source) Rdm (talk \| contribs) m (→‎Dup?) Newer edit →
Line 105: : Since   '''happy numbers'''   have their own name and are referenced in/on publications and other web-sites, they deserve their own algorithms (without generalizing them).   Similar to primes, K-primes, almost-primes, pseudo-primes, phi (totient), divisors (tau), proper divisors (aliquot), and the like;   they are both generalizations of   ''factoring''.   Similarly with factorials and multi-factorials, and the many variants of Fibonacci series (the Lucas series being one of them).   -- [[User:Gerard Schildberger\|Gerard Schildberger]] ([[User talk:Gerard Schildberger\|talk]]) 23:22, 13 September 2015 (UTC) :: Ok, but I do not understand what factoring has to do with sums of squares of digits... --[[User:Rdm\|Rdm]] ([[User talk:Rdm\|talk]]) 02:57, 14 September 2015 (UTC)

Talk:Iterated digits squaring (view source)