Abstract

A general algorithm is developed for a specific algebraic operation on integer numbers carried out iteratively. The operation is shown pictorially by a chain-necklace diagram. The properties of such diagrams are mentioned. Two special cases, namely Collatz's and Nollatz's conjectures, are discussed in detail. The former conjecture gives a full-length sequence only for restricted numbers. A new generalized conjecture is stated and some logical thoughts are given.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.