The \(3x +1\) problem: Two stochastic models
From MaRDI portal
Publication:1186306
DOI10.1214/aoap/1177005779zbMath0742.60027MaRDI QIDQ1186306
Alan Weiss, Jeffrey C. Lagarias
Publication date: 28 June 1992
Published in: The Annals of Applied Probability (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aoap/1177005779
60J85: Applications of branching processes
60F10: Large deviations
26A18: Iteration of real functions in one variable
11A99: Elementary number theory
Related Items
Greedy Search on the Binary Tree with Random Edge-Weights, Lower bounds for the total stopping time of 3𝑥+1 iterates, The Distribution of 3x+1 Trees, A randomized version of the Collatz \(3x + 1\) problem, The \(3x+1\) problem: a lower bound hypothesis, Statistical properties of an iterated arithmetic mapping, Multiplication algorithm based on Collatz function, A probabilistic model for the 5\(x\)+1 problem and related maps, Maximum excursion and stopping time record-holders for the problem: Computational results, Embedding the 3x + 1 Conjecture in a 3x + d Context