|
|||||
|
|
Some results on the Collatz problem |
|
| Authors: | Ştefan Andrei Manfred Kudlek Radu Ştefan Niculescu |
| Affiliation: | Faculty of Informatics, “Al.I.Cuza” University, Str. Berthelot, Nr. 16, 6600, Ia?i, Romania (e-mail: stefan@infoiasi.ro), RO Fachbereich Informatik, Universit?t Hamburg, Vogt-K?lln-Stra?e 30, 22527 Hamburg, Germany (e-mail: kudlek@informatik.uni-hamburg.de), DE Faculty of Mathematics, Department of Computer Science, Bucharest University, Str. Academiei, Nr. 14, Sector 1, 70109, Bucuresti, Romania (e-mail: nick@colegiu.cs.unibuc.ro), RO |
| 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. Received: 15 September 1999 / 2 June 2000 |
| Keywords: | |
| 本文献已被 SpringerLink 等数据库收录！ | |