Algorithmes pour vérifier la conjecture de Syracuse
Arsac, Jacques
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987), p. 3-9 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1987-01-01
@article{ITA_1987__21_1_3_0,
     author = {Arsac, Jacques},
     title = {Algorithmes pour v\'erifier la conjecture de Syracuse},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {21},
     year = {1987},
     pages = {3-9},
     mrnumber = {882866},
     zbl = {0638.10004},
     language = {fr},
     url = {http://dml.mathdoc.fr/item/ITA_1987__21_1_3_0}
}

Arsac, Jacques. Algorithmes pour vérifier la conjecture de Syracuse. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 21 (1987) pp. 3-9. http://gdmltest.u-ga.fr/item/ITA_1987__21_1_3_0/

1. J. C. Lagarias, The 3x + l Problem and its Generalizations, American Monthly, janvier 1985, p. 3-21. | MR 777565

2. S. Ando, Letter to J. C. Lagarias.

3. R. Terras A Stopping Time Problem on the Positive Integers, Acta arithmetica, vol. 30, 1976, p. 241-252. | MR 568274 | Zbl 0348.10037