Advertisement

CALCOLO

, Volume 38, Issue 3, pp 129–140 | Cite as

On the palindromic reversal process

  • V. Prosper
  • S. Veigneau

Abstract:

When adding an integer and its reversal, one obtains another integer, which may also be added to its reversal, and so on. Will this process give a palindromic result, that is to say, a number reading the same backward as forward? 196 is known to be the first number that apparently never produces a palindrome. We present new properties which provide a more accurate interpretation of the palindromic reversal process and give a recursive algorithm whose recursion removal leads to the classical algorithm. We also exhibit a finer classification of numbers giving the same integers after several steps of the process.

Keywords

Reversal Process Recursive Algorithm Fine Classification Classical Algorithm Accurate Interpretation 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Italia 2001

Authors and Affiliations

  • V. Prosper
    • 1
  • S. Veigneau
    • 1
  1. 1.Institut Gaspard Monge, Université de Marne-la-Vallée, 5, Bd Descartes,¶77454 Marne-la-Vallée, Cedex 2, France¶e-mail: Vincent.Prosper@vie.fr; Sebastien.Veigneau@univ-mlv.frFR

Personalised recommendations