Abstract
We consider the comic task of obtaining the number 100 from a six-digit bus ticket number by placing parentheses and symbols for arithmetic operations between some digits. The solution algorithm for a fixed number is reduced to enumerating all binary trees having exactly six terminal nodes with the signs of operations in internal nodes. For six-digit numbers that do not contain duplicate digits and the digit 0, the problem has a solution for all numbers except the only number 746189. It is impossible to obtain a hundred from this strange number 746189.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
M. Črepinšek and L. Mernik, “An efficient representation for solving Catalan number related problems,” Int. J. Pure Appl. Math., 56, No. 4, 589–604 (2009).
T. Davis, Catalan Numbers, http://www.geometer.org/mathcircles (2006).
S. K. Lando, Lectures on Generating Functions, Stud. Math. Lib., Vol. 23, Amer. Math. Soc. (2003).
A. Shen, Algorithms and Programming. Problems and Solutions, Springer, New York (2010).
Author information
Authors and Affiliations
Corresponding author
Additional information
Translated from Fundamentalnaya i Prikladnaya Matematika, Vol. 23, No. 3, pp. 37–47, 2020.
Rights and permissions
Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.
About this article
Cite this article
Borisenko, V.V., Rakhmatov, R. A Hundred from a Bus Ticket. J Math Sci 269, 290–297 (2023). https://doi.org/10.1007/s10958-023-06281-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10958-023-06281-9