IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v9y2021i16p1898-d611326.html
   My bibliography  Save this article

An Algorithm for Linearizing the Collatz Convergence

Author

Listed:
  • Alexander Rahn

    (Nuremberg Institute of Technology, Keßlerplatz 12, 90489 Nuremberg, Germany)

  • Eldar Sultanow

    (Faculty of Economic and Social Sciences, Potsdam University, Karl-Marx Straße 67, 14482 Potsdam, Germany
    Capgemini, Bahnhofstraße 30, 90402 Nuremberg, Germany)

  • Max Henkel

    (Faculty of Computer Science, Schmalkalden University of Applied Sciences, Blechhammer 9, 98574 Schmalkalden, Germany)

  • Sourangshu Ghosh

    (Department of Civil Engineering, Indian Institute of Technology Kharagpur, Kharagpur 721302, India)

  • Idriss J. Aberkane

    (Unesco-Unitwin Complex Systems Digital Campus, ECCE e-Lab, CEDEX, 67081 Strasbourg, France)

Abstract

The Collatz dynamic is known to generate a complex quiver of sequences over natural numbers for which the inflation propensity remains so unpredictable it could be used to generate reliable proof-of-work algorithms for the cryptocurrency industry; it has so far resisted every attempt at linearizing its behavior. Here, we establish an ad hoc equivalent of modular arithmetics for Collatz sequences based on five arithmetic rules that we prove apply to the entire Collatz dynamical system and for which the iterations exactly define the full basin of attractions leading to any odd number. We further simulate these rules to gain insight into their quiver geometry and computational properties and observe that they linearize the proof of convergence of the full rows of the binary tree over odd numbers in their natural order, a result which, along with the full description of the basin of any odd number, has never been achieved before. We then provide two theoretical programs to explain why the five rules linearize Collatz convergence, one specifically dependent upon the Axiom of Choice and one on Peano arithmetic.

Suggested Citation

  • Alexander Rahn & Eldar Sultanow & Max Henkel & Sourangshu Ghosh & Idriss J. Aberkane, 2021. "An Algorithm for Linearizing the Collatz Convergence," Mathematics, MDPI, vol. 9(16), pages 1-32, August.
    • Handle: RePEc:gam:jmathe:v:9:y:2021:i:16:p:1898-:d:611326
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/9/16/1898/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/9/16/1898/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Fabian Bocart, 2018. "Inflation Propensity of Collatz Orbits: A New Proof-of-Work for Blockchain Applications," JRFM, MDPI, vol. 11(4), pages 1-18, November.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Idriss J. Aberkane, 2022. "Collatz Attractors Are Space-Filling," Mathematics, MDPI, vol. 10(11), pages 1-9, May.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Christian M. Hafner, 2020. "Alternative Assets and Cryptocurrencies," JRFM, MDPI, vol. 13(1), pages 1-3, January.
    2. Idriss J. Aberkane, 2022. "Collatz Attractors Are Space-Filling," Mathematics, MDPI, vol. 10(11), pages 1-9, May.

    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:gam:jmathe:v:9:y:2021:i:16:p:1898-:d:611326. 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.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with 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: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.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.