Chose a positive integer N.
Repeatedly replace this number by the sum of the cubes of its digits.
Stop once the replacement left the number unchanged.

Show that the "fixed point result" is only one of five possible choices.

List them.

(In reply to Stop me before I replace again! by Steve Herman)

The original version of my program only got to 4 when it fell into that same loop.

Posted by Charlie on 2016-05-29 11:27:58