On the combinatorial structure of \(3N+1\) predecessor sets (Q1910555): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3207035 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the "3x + 1" Problem / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3856819 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: How many numbers satisfy the \(3x+1\) conjecture? / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The 3x + 1 Problem and Its Generalizations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A stopping time problem on the positive integers / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Balls in constrained urns and Cantor-like sets / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4867941 / rank | |||
Normal rank |
Latest revision as of 11:14, 24 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | On the combinatorial structure of \(3N+1\) predecessor sets |
scientific article |
Statements
On the combinatorial structure of \(3N+1\) predecessor sets (English)
0 references
24 March 1996
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 note under review, the author studies not as usual the trajectory \((T^{(k)}(a))_{k\in \mathbb{N}_0}\) for \(a\in \mathbb{N}\), but its predecessor set which consists of all integers \(n\) whose iterates \(T^{(k)}(n)\) eventually hit \(a\). He gives a representation of these sets and studies their combinatorial structure. It turns out that the well-known coefficient stopping time conjecture in the original ``\(3N+ 1\)''-problem could be formulated in terms of the predecessor sets. In the last section, the author shows how density considerations are related to the asymptotic behaviour at the origin of a certain smooth function on the unit interval which would also convey new information on the original ``\(3N+ 1\)''-problem.
0 references
Collatz-problem
0 references
predecessor set
0 references
combinatorial structure
0 references
coefficient stopping time conjecture
0 references
\(3N+ 1\)-problem
0 references
density
0 references
asymptotic behaviour
0 references