Algorithmes pour vérifier la conjecture de Syracuse

DOI10.1051/ITA/1987210100031zbMATH Open0638.10004OpenAlexW1933960050WikidataQ123292135 ScholiaQ123292135MaRDI QIDQ3778802FDOQ3778802

Authors: Jacques Arsac 

Publication date: 1987

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92277

Recommendations

• scientific article; zbMATH DE number 3957204
• scientific article; zbMATH DE number 5885063
• About the Collatz conjecture
• scientific article; zbMATH DE number 3910471
• scientific article; zbMATH DE number 7498862

zbMATH Keywords

Collatz function3x\(+1\) conjectureSyracuse-Kakutani-Collatz conjecture

Mathematics Subject Classification ID

Recurrences (11B37) Fibonacci and Lucas numbers and polynomials and generalizations (11B39)

Cites Work

• The 3x + 1 Problem and Its Generalizations
• A stopping time problem on the positive integers

Cited In (4)

• Algorithmic aspects of Suslin's proof of Serre's conjecture
• The logical solution of the Syracuse conjecture
• Is the Syracuse falling time bounded by 12?
• Title not available (Why is that?)

This page was built for publication: Algorithmes pour vérifier la conjecture de Syracuse

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