Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/18/84; site utcsri.UUCP
Path: utzoo!utcsri!mendel
From: mendel@utcsri.UUCP (Alberto Mendelzon)
Newsgroups: net.math
Subject: A question on palindromic numbers
Message-ID: <1389@utcsri.UUCP>
Date: Fri, 13-Sep-85 12:10:39 EDT
Article-I.D.: utcsri.1389
Posted: Fri Sep 13 12:10:39 1985
Date-Received: Fri, 13-Sep-85 12:25:05 EDT
Distribution: net
Organization: CSRI, University of Toronto
Lines: 17

Suppose you start with an arbitrary positive
integer, reverse it, add the original integer
to its reversal, add the result to its reversal,
and keep doing this until you end up with a
number that is palindromic. For example, start
with 19: 19+91=110, 110+11=121 and you're done,
since 121 is palindromic, i.e., it is equal to
its reversal.
All arithmetic is in base 10.
The question is: assuming unlimited integer size,
is this process guaranteed to converge to a palindrome
no matter what integer you start with?
-- 
-----------------
Alberto Mendelzon
utcsri!mendel
mendel@toronto