Maximum excursion and stopping time record-holders for the problem: Computational results

DOI10.1090/S0025-5718-99-01031-5zbMATH Open0919.11020MaRDI QIDQ4221986FDOQ4221986

Authors: Tomás Oliveira E. Silva 

Publication date: 3 December 1998

Published in: Mathematics of Computation (Search for Journal in Brave)

Recommendations

• The Collatz problem
• The 3x + 1 Problem and Its Generalizations
• Lower bounds for the total stopping time of 3𝑥+1 iterates
• The ultimate challenge. The \(3x+1\) problem
• Publication:4943130

zbMATH Keywords

algorithmcomputational resultsCollatz problem\(3x+1\) problemmaximum excursion of the trajectory

Mathematics Subject Classification ID

Special sequences and polynomials (11B83) Recurrences (11B37) Software, source code, etc. for problems pertaining to number theory (11-04)

Cites Work

• The 3x + 1 Problem and Its Generalizations
• The \(3x+1\) problem: New lower bounds on nontrivial cycle lengths
• The \(3x +1\) problem: Two stochastic models
• \(3x + 1\) search programs

Cited In (12)

• A reduced Collatz dynamics maps to a residue class, and its count of \((x/2)\) over the count of \(3\ast x+1\) is larger than \(\ln 3/\ln 2\)
• Generalized inverses and the total stopping times of collatz sequences
• Quantifying the degree of average contraction of Collatz orbits
• Lower bounds for the total stopping time of 3𝑥+1 iterates
• \(3x + 1\) search programs
• The \(3x+1\) problem as a string rewriting system
• Density Bounds for the 3x + 1 Problem. I. Tree-Search Method
• On the almost sure convergence of Syracuse sequences
• A new approach on proving Collatz conjecture
• Title not available (Why is that?)
• \(3x + 1\) search programs
• The \(3x+1\) semigroup

This page was built for publication: Maximum excursion and stopping time record-holders for the problem: Computational results

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4221986)