Abstract
For all natural numbers a, b and \(d > 0\), we consider the function \(f_{a,b,d}\) which associates n/d with any integer n when it is a multiple of d, and \(an + b\) otherwise; in particular \(f_{3,1,2}\) is the Collatz function. To realize these functions by transducers (automata labelled by pairs of words), the coding in reverse base 2 is generally used. For the Collatz function, it gives a simple 5-states transducer but it is not suitable for the composition and so far, no one has been able to specify, for all integers p, a generic transducer computing its composition p times. Coding in direct base ad with \(b < a\), we realize the functions \(f_{a,b,d}\) by synchronous sequential transducers. This particular form makes explicit the composition of such a transducer p times to compute \(f^p_{a,b,d}\) in terms of p and a, b, d. We even give an explicit construction of an infinite transducer realizing the closure under composition of \(f_{a,b,d}\).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Allouche, J.-P.: T. Tao et la conjecture de Syracuse. Gazette de la SMF 168, pp. 34–39 (2021)
Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations, 588 p. Cambridge University Press (2003)
Eliahou, S., Fromentin, J., Simonetto, R.: Is the syracuse falling time bounded by 12?. In: Nathanson, M.B. (ed.) Combinatorial and Additive Number Theory V. CANT. Springer Proceedings in Mathematics & Statistics, vol. 395, pp. 139–152 (2022). https://doi.org/10.48550/arXiv.2107.11160
Erdös, P.: Some unconventional problems in number theory. Math. Mag. 52(2), 67–70 (1979). https://doi.org/10.2307/2689842
Lagarias, J.: The ultimate challenge: the 3x+1 problem. Am. Math. Soc. (2010). https://doi.org/10.1090/mbk/078
Muscholl, A., Puppis, G.: The many facets of string transducers. In: Nichermeir, R., Paul, C. (eds.) 36th STACS. Lecture Notes in Computer Science, vol. 1563, pp. 32–46 (2019). https://doi.org/10.4230/LIPIcs.STACS.2019.2
Reitwiesner, G.W.: Binary Arithmetic. Advances in Computers, vol. 1, pp. 231–308. Academic Press, New York (1960). https://doi.org/10.1016/S0065-2458(08)60610-5
Schützenberger, M.-P.: Sur une variante des fonctions séquentielles. Theoret. Comput. Sci. 4(1), 47–57 (1977). https://doi.org/10.1016/0304-3975(77)90055-X
Shallit, J., Wilson, D.: The “\(3x+1\)’’ problem and finite automata. Bull. EATCS 46, 182–185 (1992)
Simonnet, P.: Personal communication (2019)
Stérin, T.: Binary expression of ancestors in the Collatz graph. In: Schmitz, S., Potapov, I. (eds.) RP 2020. LNCS, vol. 12448, pp. 115–130. Springer, Cham (2020). https://doi.org/10.1007/978-3-030-61739-4_8
Tao, T.:Almost all orbits of the Collatz map attain almost bounded values. arXiv:1909.03562 (2019).https://doi.org/10.48550/arXiv.1909.03562
Yolcu, E., Aaronson, S., Heule, M.J.H.: An automated approach to the Collatz conjecture. In: Platzer, A., Sutcliffe, G. (eds.) CADE 2021. LNCS (LNAI), vol. 12699, pp. 468–484. Springer, Cham (2021). https://doi.org/10.1007/978-3-030-79876-5_27
Acknowledgments
We would like to thank Pierre Simonnet who was at the origin of this article: he recalled us the transducer of the Collatz function in base 2 and highlighted the fact that its compositions can not be explicited [10].
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2025 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Caucal, D., Rispal, C. (2025). On the Powers of the Collatz Function. In: Formenti, E., Durand-Lose, J. (eds) Machines, Computations, and Universality. MCU 2024. Lecture Notes in Computer Science, vol 15270. Springer, Cham. https://doi.org/10.1007/978-3-031-81202-6_8
Download citation
DOI: https://doi.org/10.1007/978-3-031-81202-6_8
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-81201-9
Online ISBN: 978-3-031-81202-6
eBook Packages: Computer ScienceComputer Science (R0)