Affiliation:
1. University of Texas - Rio Grande Valley
Abstract
Abstract
Throughout history, recreational mathematics has always played a prominent role in advancing research. Following in this tradition, in this paper we extend some recent work with crazy sequential representations of numbers− equations made of sequences of one through nine (or nine through one) that evaluate to a number. All previous work on this type of puzzle has focused only on base ten numbers and whether a solution existed. We generalize this concept and examine how this extends to arbitrary bases, the ranges of possible numbers, the combinatorial challenge of finding the numbers, efficient algorithms, and some interesting patterns across any base. For the analysis, we focus on bases three through ten. Further, we outline several interesting mathematical and algorithmic complexity problems related to this area that have yet to be considered.
Subject
General Chemical Engineering
Reference22 articles.
1. [1] Ben Tilly. How to print all possible balanced parentheses for an expression? - stack overflow. https://stackoverflow.com/questions/6447289/how-to-print-all-possible-balanced-parentheses-for-an-expression#6447533
2. [2] H. E. Dudeney. Amusements in Mathematics, Thomas Nelson and Sons, Ltd., New York, NY, USA, 1917.
3. [3] R. L. Graham, B. L. Rothschild, J. H. Spencer. Ramsey Theory, A Wiley-Interscience publication, John Wiley ---amp--- Sons, 1990.
4. [4] R. K. Guy, J. L. Selfridge. “The nesting and roosting habits of the laddered parenthesis”, The American Mathematical Monthly, 80(8):868–876, 1973.10.1080/00029890.1973.11993395
5. [5] T. Hales. “Historical overview of the Kepler conjecture”. Discrete ---amp--- Computational Geometry, 36:5–20, July 2006.10.1007/s00454-005-1210-2