Skip to main content
Log in

Some results on the Collatz problem

  • Published:
Acta Informatica Aims and scope Submit manuscript

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Author information

Authors and Affiliations

Authors

Additional information

Received: 15 September 1999 / 2 June 2000

Rights and permissions

Reprints and permissions

About this article

Cite this article

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

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/s002360000039

Keywords

Navigation