Struggling with the 3x + 1 problem
From MaRDI portal
Publication:3775609
A brief discussion of the possible behaviour of iterates of the function \(h(x)=x+a\) if \(x\) is an odd integer and \(x/2\) if \(x\) is an even integer. Here \(x\) is excluded from the set of multiples of \(a\), an odd prime. For example, if \(a=3\), and given \(n\), the number of integers such that \(h^n(x)=1\) (for the first time) is a Fibonacci number. The article, intended as an enrichment piece for budding mathematicians, suggests several conjectures to prove.
Recommendations
Cited in
(6)- Schreier graphs for a self-similar action of the Heisenberg group
- Generating prime numbers. (Letter to the editor)
- Numerical palindromes and the 196 problem
- This almost certainly demonstrates the Syracuse conjecture: 3x+1=x+(2x+1)
- Processing process: the Gilbreath conjecture
- Dynamical properties of the Takagi map and its partial sums
This page was built for publication: Struggling with the 3x + 1 problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3775609)