The 3x + 1 Problem and Its Generalizations
DOI10.2307/2322189zbMATH Open0566.10007OpenAlexW4246319563MaRDI QIDQ3680903FDOQ3680903
Publication date: 1985
Published in: The American Mathematical Monthly (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2307/2322189
Recommendations
surveystopping timeergodic theoryiterationbibliographyhistorydivergent trajectoriesCollatz problem\(3x+1\) problemUlam problemSyracuse problemcoefficient stopping timeConway's resultfractional parts of \((3/2)^ k\)Hasse algorithmKakutani problemno nontrivial cycles
Special sequences and polynomials (11B83) Recurrences (11B37) Research exposition (monographs, survey articles) pertaining to number theory (11-02) Special sequences (11K31)
Cited In (only showing first 100 items - show all)
- Approximate Squaring
- THE 3x+1 PROBLEM VIEWED FROM ANOTHER SIDE
- On a generalization of the \(3x+1\) problem
- Title not available (Why is that?)
- A topological approach to the Ulam-Kakutani-Collatz conjecture
- Nonclassical birational models for \(\operatorname{Spec}\mathbb{Q}\)
- Injectivity and surjectivity of Collatz functions
- Generalized inverses and the total stopping times of collatz sequences
- On the \(3x+1\) problem
- A new statistic for the \(3x+1\) problem
- Teaching the computer how to discover(!) and then prove(!!) (all by itself(!!!)) analogues of Collatz's notorious 3x + 1 conjecture
- Almost all orbits of the Collatz map attain almost bounded values
- Multiplication algorithm based on Collatz function
- On the combinatorial structure of \(3N+1\) predecessor sets
- The Distribution of 3x+1 Trees
- Combining dynamic and static slicing for analysing assembler
- Collatz on the Dyadic Rationals in [0.5, 1) with Fractals: How Bit Strings Change Their Length Under 3x + 1
- Conway's work on iteration
- Sorted fibs in base 3/2
- The Collatz conjecture in a group theoretic context
- On the probabilistic proof of the convergence of the Collatz conjecture
- Visualizing generalized \(3x+1\) function dynamics based on fractal
- Lower bounds for Z-numbers
- A prelude to the 3x+1 problem
- An automated approach to the Collatz conjecture
- An automated approach to the Collatz conjecture
- Functional equations associated with congruential functions
- The word problem for one-relation monoids: a survey
- Collatz conjecture revisited: an elementary generalization
- Novel theorems and algorithms relating to the Collatz conjecture
- Algorithmes pour vérifier la conjecture de Syracuse
- A Note on the 3x + 1 Problem
- On a class of 2-adic functions related to the ``\(3x+1\)-problem
- Imitation of an Iteration
- A generalization of Everett's result on the Collatz \(3x+1\) problem
- Arithmetic sequences and blocks of powers of two in the Collatz array
- The Collatz conjecture and the quantum mechanical harmonic oscillator
- On consecutive numbers of the same height in the Collatz problem
- Analogues of the 3x+ 1 Problem in Polynomial Rings of Characteristic 2
- Inductive complexity measures for mathematical problems
- Iterated strings and cellular automata.
- Structure theorem for \((d,g,h)\)-maps.
- [[Publication:6136713|The Collatz problem in \(\mathbb{F}_p [x]\) and \(\mathbb{F}_p x\)]]
- Maurice Margenstern’s Contributions to the Field of Small Universal Turing Machines
- A Dual-Radix Approach to Steiner’s 1-Cycle Theorem
- \(3x + 1\) search programs
- Embedding the 3x + 1 Conjecture in a 3x + d Context
- A note on Mignosi's generalization of the \((3X+1)\)-problem
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- ON CONJUGATES OF COLLATZ-TYPE MAPPINGS
- Title not available (Why is that?)
- Information: The Algorithmic Paradigm
- Circular slider graphs: de Bruijn, Kautz, Rauzy, lamplighters and spiders
- Some extensions of Collatz (periodic) conjecture
- The Collatz conjecture \& non-Archimedean spectral theory. I: Arithmetic dynamical systems and non-Archimedean value distribution theory
- Title not available (Why is that?)
- An Undecidable Permutation of the Natural Numbers
- Exploring the \(3x+1\) problem. I.
- A note on some piecewise-linear difference equations with Mersenne-type periodic solutions
- On the stopping time of the Collatz map in \(\mathbb{F}_2 [x]\)
- Bounds for zeros of Collatz polynomials, with necessary and sufficient strictness conditions
- Real 3𝑥+1
- Topological properties of certain iterated entire maps
- 3x+1 inverse orbit generating functions almost always have natural boundaries
- Title not available (Why is that?)
- A Family of Iterated Maps on Natural Numbers
- Title not available (Why is that?)
- A matricial view of the Collatz conjecture
- Parity sequences of the 3x+1 map on the 2-adic integers and Euclidean embedding
- Two undecidable variants of Collatz's problems
- On the nonexistence of nontrivial small cycles of the \(\mu\) function in \(3x+1\) conjecture
- The 3n+l-Problem and Holomorphic Dynamics
- The \(3x+1\) problem: New lower bounds on nontrivial cycle lengths
- The Collatz conjecture and de Bruijn graphs
- Die another day
- On a generalization of the \(3x+1\) problem
- Functional equations connected with the Collatz problem
- A simple (inductive) proof for the non-existence of 2-cycles of the \(3x+1\) problem
- Complexity of Fractran and Productivity
- The Collatz problem
- Endomorphisms of the shift dynamical system, discrete derivatives, and applications
- Wildness of iteration of certain residue-class-wise affine mappings
- Universal pattern generation by cellular automata
- Some results on the Collatz problem
- A theorem about uniform distribution
- Representing the integers with powers of 2 and 3.
- A new look at the automatic synthesis of linear ranking functions
- Frontier between decidability and undecidability: A survey
- The real 3x+1 problem
- Random sequence generation by cellular automata
- The \(3x+1\) problem: a lower bound hypothesis
- Maximum excursion and stopping time record-holders for the problem: Computational results
- A generalization of the Syracuse algorithm in \({\mathbb{F}}_ q[x]\)
- Resolving Toric Varieties with Nash Blowups
- Lower bounds for the total stopping time of 3𝑥+1 iterates
- On the joint subword complexity of automatic sequences
- The sufficiency of arithmetic progressions for the 3𝑥+1 Conjecture
This page was built for publication: The 3x + 1 Problem and Its Generalizations
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3680903)