Table of Contents
International Journal of Combinatorics
Volume 2012 (2012), Article ID 406250, 11 pages
http://dx.doi.org/10.1155/2012/406250
Research Article

Variations of the Game 3-Euclid

Department of Mathematics, La Trobe University, Melbourne, VIC 3086, Australia

Received 30 November 2011; Revised 27 December 2011; Accepted 5 January 2012

Academic Editor: Toufik Mansour

Copyright © 2012 Nhan Bao Ho. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. A. J. Cole and A. J. T. Davie, “A game based on the Euclidean algorithm and a winning strategy for it,” The Mathematical Gazette, vol. 53, pp. 354–357, 1969. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  2. J. W. Grossman, “A nim-type game, problem #1537,” Mathematics Magazine, vol. 70, p. 382, 1997. View at Google Scholar
  3. G. Cairns, N. B. Ho, and T. Lengyel, “The Sprague-Gundy function of the real game Euclid,” Discrete Mathematics, vol. 311, no. 6, pp. 457–462, 2011. View at Publisher · View at Google Scholar
  4. A. S. Fraenkel, “Euclid and Wythoff games,” Discrete Mathematics, vol. 304, no. 1–3, pp. 65–68, 2005. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  5. S. Hofmann, G. Schuster, and J. Steuding, “Euclid, Calkin & Wilf—playing with rationals,” Elemente der Mathematik, vol. 63, no. 3, pp. 109–117, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  6. T. Lengyel, “On calculating the Sprague-Grundy function for the game Euclid,” in Proceedings of the 11th International Conference on Fibonacci Numbers and Their Applications, vol. 194, pp. 167–172, Congressus Numerantium, 2009.
  7. G. Nivasch, “The Sprague-Grundy function of the game Euclid,” Discrete Mathematics, vol. 306, no. 21, pp. 2798–2800, 2006. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  8. E. L. Spitznagel Jr., “Properties of a game based on Euclid's algorithm,” Mathematics Magazine, vol. 46, pp. 87–92, 1973. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  9. P. D. Straffin, “A nim-type game, solution to problem #1537,” Mathematics Magazine, vol. 71, pp. 394–395, 1998. View at Google Scholar
  10. D. Collins, “Variations on a theme of Euclid,” Integers, vol. 5, no. 1, p. 12, 2005. View at Google Scholar · View at Zentralblatt MATH
  11. D. Collins and T. Lengyel, “The game of 3-Euclid,” Discrete Mathematics, vol. 308, no. 7, pp. 1130–1136, 2008. View at Publisher · View at Google Scholar · View at Zentralblatt MATH
  12. T. Lengyel, “A nim-type game and continued fractions,” The Fibonacci Quarterly, vol. 41, no. 4, pp. 310–320, 2003. View at Google Scholar · View at Zentralblatt MATH
  13. V. A. Gurvich, “On the misere version of game Euclid and miserable games,” Discrete Mathematics, vol. 307, no. 9-10, pp. 1199–1204, 2007. View at Publisher · View at Google Scholar · View at Zentralblatt MATH · View at MathSciNet
  14. V. A. Gurvich, “Miserable and strongly miserable impartial games,” RUTCOR Research Report RRR-18, 2011. View at Google Scholar
  15. G. Cairns and N. B. Ho, “A restriction of the game Euclid,” submitted.
  16. G. Cairns and N. B. Ho, “Min, a combinatorial game having a connection with prime numbers,” Integers, vol. 10, pp. 765–770, 2010. View at Publisher · View at Google Scholar · View at Zentralblatt MATH