IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-94-011-4271-7_9.html

Base 10 RATS Cycles and Arbitrarily Long Base 10 RATS Cycles

In: Applications of Fibonacci Numbers

Author

Listed:
  • Curtis Cooper
  • Robert E. Kennedy

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.

Suggested Citation

  • Curtis Cooper & Robert E. Kennedy, 1999. "Base 10 RATS Cycles and Arbitrarily Long Base 10 RATS Cycles," Springer Books, in: Fredric T. Howard (ed.), Applications of Fibonacci Numbers, pages 83-93, Springer.
    • Handle: RePEc:spr:sprchp:978-94-011-4271-7_9
    DOI: 10.1007/978-94-011-4271-7_9
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;

    JEL classification:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-94-011-4271-7_9. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.