scientific article; zbMATH DE number 3957204

MaRDI QIDQ3726191zbMATH OpenFDO

Authors Jacques Arsac

Publication date 1986

zbMATH Keywords

algorithmCollatz functioncomplexityiterationstopping timeSyracuse-Kakutani-Collatz problem

Mathematics Subject Classification ID

Software, source code, etc. for problems pertaining to number theory (11-04) Radix representation; digital problems (11A63) Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Algorithmes pour vérifier la conjecture de Syracuse
• scientific article; zbMATH DE number 5885063
• About the Collatz conjecture
• T. Tao and the Syracuse conjecture
• scientific article; zbMATH DE number 7498862

Cited in

(6)

• Algorithmic aspects of Suslin's proof of Serre's conjecture
• Is the Syracuse falling time bounded by 12?
• Teaching the computer how to discover(!) and then prove(!!) (all by itself(!!!)) analogues of Collatz's notorious 3x + 1 conjecture
• Algorithmes pour vérifier la conjecture de Syracuse
• Density Bounds for the 3x + 1 Problem. I. Tree-Search Method
• The logical solution of the Syracuse conjecture

This page was built for publication:

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