The 196 algorithm goes like this.  Start with an integer.  Reverse the digits.  Add the reversed number to the integer.  For most numbers, this eventually leads to a palendrome.  That is to say the number is equal to the reversed number.  I wrote a little Maple procedure to explore 196, the smallest number that will probrably never become a palendrome when put into the algorithm.

 

Let me know if you like my code.

Regards,
Matt

proc4.pdf

proc4.mw

http://mathworld.wolfram.com/196-Algorithm.html

 


Please Wait...