All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars
 perplexus dot info

 Two happy ends (Posted on 2011-03-07)
Consider a series of numbers, defined as follows:
Starting with any natural number, each member is a sum of the squares of the previous member`s digits.

Prove : The series always reaches either a stuck-on-one sequence: 1,1,1… or a closed loop of the following 8 numbers: 145,42,20,4,16,37,58,89, ...

Ex1: 12345,55,50,25,29,85,89,145….. etc
Ex2: 66,72,53,34,25,29,85,89,145…
Ex3: 91,10,1,1,1…..

 See The Solution Submitted by Ady TZIDON No Rating

Comments: ( Back to comment list | You must be logged in to post comments.)
 re(3): solution NOT enough | Comment 5 of 11 |
(In reply to re(2): solution NOT enough by Gamer)

Actually it was Charlie that did the checking.  I merely outlined the proof without doing the number crunching.  I did not prove there were two cycle only, only that there must be cycles.  Ady is correct to point out that leaves room for more cycles.

The subject line of my post was meant to imply that it was proof enough for me, even though I did not fully prove the problem.

 Posted by Jer on 2011-03-08 10:08:47

 Search: Search body:
Forums (0)