On the \(3n+1\) problem (Q5953269): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/s000170050080 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W1486935931 / rank | |||
Normal rank |
Revision as of 19:49, 19 March 2024
scientific article; zbMATH DE number 1693718
Language | Label | Description | Also known as |
---|---|---|---|
English | On the \(3n+1\) problem |
scientific article; zbMATH DE number 1693718 |
Statements
On the \(3n+1\) problem (English)
0 references
1 December 2002
0 references
The ``Collatz'' problem (or ``3n+1''- or ``Hasse''- or ``Syracuse''- or ``Kakutani''-problem) is to prove that for every \(n \in \mathbb N\) there exists a \(k\) with \(T^{(k)}(n)=1\) where the function \(T(n)\) takes odd numbers \(n\) to \((3n+1)/2\) and even numbers \(n\) to \(n/2\). In the paper under review the author gives a very readable introduction into this field, starting with Collatz-graphs and the connection to equivalent statements in other than number-theoretic or discrete problems, for example in complex analysis. Finally, various open questions and conjectures about the chaotic structure of predecessor sets are discussed.
0 references
3n+1 problem
0 references
Collatz problem
0 references
introduction
0 references
complex analysis
0 references
open questions
0 references
conjectures
0 references