Have a personal or library account? Click to login
Crazy Sequential Representations of Numbers for Small Bases Cover

Crazy Sequential Representations of Numbers for Small Bases

By: Tim Wylie  
Open Access
|Feb 2020

References

  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
  6. [6] T. Hales. The flyspeck project, https://code.google.com/p/flyspeck/, 2014 (accessed: 2014-10-10).
  7. [7] T. Hales, S. McLaughlin. “The dodecahedral conjecture”, CoRR, abs/math/9811079:1–49, 2008.
  8. [8] M. Heule, O. Kullmann, V. Marek. “Solving and verifying the boolean pythagorean triples problem via cube-and-conquer”, In Nadia Creignou and Daniel Le Berre (editors), Theory and Applications of Satisfiability Testing – SAT 2016, 228–245, Springer International Publishing, 2016.10.1007/978-3-319-40970-2_15
  9. [9] L. Kari, S. Kopecki, P. Meunier, M. Patitz, S. Seki. “Binary pattern tile set synthesis is NP-hard”, Algorithmica, 78(1):1–46, 2017.10.1007/s00453-016-0154-7
  10. [10] J. Madachy. Mathematics on vacation, Thomas Nelson and Sons, Ltd., New York, NY, USA, 1966.
  11. [11] W. Morris, V. Soltan. “The Erdős-Szekeres problem on points in convex position-a survey” Bulletin of the American Mathematical Society (N.S, 37(4):437–458, 2000.10.1090/S0273-0979-00-00877-6
  12. [12] Numberphile. The 10,958 problem - numberphile, April 2017. Youtube: https://www.youtube.com/watch?v=-ruC5A9EzzE
  13. [13] Numberphile. A 10,958 solution - numberphile, April 2017. Youtube: https://www.youtube.com/watch?v=pasyRUj7UwM
  14. [14] S. Radziszowski. “Small Ramsey numbers”, The Electronic Journal of Combinatorics, DS1:1–94, 2014.
  15. [15] S. Radziszowski, B. McKay. “R(4,5) = 25”, Journal of Graph Theory, (19):309–322, 1995.10.1002/jgt.3190190304
  16. [16] C. Rivera. Puzzle 864: 10958, the only hole. . . , January 2017. http://primepuzzles.net/puzzles/puzz_864.htm
  17. [17] G. Szekeres, L. Peters. “Computer solution to the 17-point Erd˝os-Szekeres problem”. The Australian ---amp--- New Zealand Industrial and Applied Mathematics Journal, 48:151–164, 10, 2006.10.1017/S144618110000300X
  18. [18] I. J. Taneja. “Crazy Sequential Representation: Numbers from 0 to 11111 in terms of Increasing and Decreasing Orders of 1 to 9”, ArXiv e-prints, Jun 2013. http://arxiv.org/abs/1302.1479v3
  19. [19] I. J. Taneja. “Crazy Sequential Representation: Numbers from 44 to 1000 in terms of Increasing and Decreasing Orders of 1 to 9”, ArXiv e-prints, feb 2013. http://arxiv.org/abs/1302.1479v1
  20. [20] I. J. Taneja. “Crazy Sequential Representation: Numbers from 44 to 4444 in terms of Increasing and Decreasing Orders of 1 to 9”, ArXiv e-prints, Mar 2013. http://arxiv.org/abs/1302.1479v2
  21. [21] I. J. Taneja. “More on Crazy Sequential Representation of Natural Numbers with Subtraction”, ArXiv e-prints, Aug 2013. http://arxiv.org/abs/1302.1479v4
  22. [22] I. J. Taneja. “Crazy Sequential Representation: Numbers from 0 to 11111 in terms of Increasing and Decreasing Orders of 1 to 9”, ArXiv e-prints, Jan 2014. http://arxiv.org/abs/1302.1479v5
Language: English
Page range: 33 - 48
Published on: Feb 7, 2020
Published by: Ludus Association
In partnership with: Paradigm Publishing Services
Publication frequency: 2 issues per year

© 2020 Tim Wylie, published by Ludus Association
This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 License.