Some results on the Collatz problem

4Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

Abstract

The paper refers to the Collatz's conjecture. In the first part, we present some equivalent forms of this conjecture and a slight generalization of a former result from [1]. Then, we present the notion of "chain subtrees" in Collatz's tree followed by a characterization theorem and some subclass of numbers which are labels for some chain subtrees. Next, we define the notion of "fixed points" and using this, we give another conjecture similar to Collatz's conjecture. Some new infinite sets of numbers for which the Collatz's conjecture holds are given. Finally, we present some interesting results related to the number of "even" and "odd" branches in the Collatz's tree.

Cite

CITATION STYLE

APA

Andrei, Ş., Kudlek, M., & Niculescu, R. Ş. (2000). Some results on the Collatz problem. Acta Informatica, 37(2), 145–160. https://doi.org/10.1007/s002360000039

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free