Base 10 RATS Cycles and Arbitrarily Long Base 10 RATS Cycles

Curtis Cooper and Robert E. Kennedy

A chapter in Applications of Fibonacci Numbers, 1999, pp 83-93 from Springer

Abstract: Abstract John Conway invented a digital game called RATS [1], an acronym for Reverse, Add, Then Sort. A game of RATS produces a sequence of positive integers. The decimal digits of each positive integer in the sequence are all nonzero and in nondecreasing order. The first number in a RATS sequence is a positive integer whose decimal digits are all nonzero and in nondecreasing order. To produce the (i + 1)st number in a RATS sequence from the i number, for i ≥ 1, reverse the digits of the ith number, add this number to the ith number, delete the zero digits in the sum, and then sort the remaining digits of the sum in nondecreasing order. The resulting sequence of positive integers is the RATS sequence for the first number.

Keywords: 11A63 (search for similar items in EconPapers)
Date: 1999
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-94-011-4271-7_9

Ordering information: This item can be ordered from
http://www.springer.com/9789401142717

DOI: 10.1007/978-94-011-4271-7_9

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().