References
- A. Brocot, Calcul des rouages par approximation, nouvelle methode, Revue Chronometrique 6 (1860) 186–194.
- G. Cairns and N. B. Ho, Min, a combinatorial game having a connection with prime numbers, Integers 10 G03 (2010) 765–770; available at http://dx.doi.org/10.1515/INTEG.2010.103.
- G. Cairns, N. B. Ho, and T. Lengyel, The Sprague-Grundy function of the real game Euclid, Discrete Math. 311 (2011) 457–462; available at http://dx.doi.Org/10.1016/j.disc.2010.12.011.
- N. Calkin and H. S. Wilf, Recounting the rationals, Amer. Math. Monthly 107 (2000) 360–363; available at http://dx.doi.org/10.2307/2589182.
- A. S. Fraenkel, How to beat your Wythoff games' opponent on three fronts, Amer. Math. Monthly 89 (1982) 353–361; available at http://dx.doi.org/10.2307/2321643.
- A. S. Fraenkel, Euclid and Wythoff games, Discrete Math. 304 (2005) 65–68; available at http://dx.doi.org/10.1016/j.disc.2005.06.022.
- M. Gardner, Wythoff 's Nim, Ch. 8, pp.103–118 in: Penrose Tiles to Trapdoor Ciphers, Revised Edition, Math. Assoc. America, 1997.
- J. Gibbons, D. Lester and R. Bird, Functional pearl: Enumerating the rationals, J. Functional Programming 16 (3) (2006) 281–291; available at http://dx.doi.org/10.1017/S0956796806005880.
- S. P. Glasby, Enumerating the rationals from left to right, Amer. Math. Monthly 118 (2011) 830–835; available at http://dx.doi.org/amer.math.monthly.118.09.830.
- S. Hofmann, G. Schuster, and J. Stending, Euclid, Calkin & Wilf—playing with rationals, Elem. Math V. 63 (2008) 109–117; available at http://dx.doi.org/10.4171/EM/95.
- G. Nivasch, The Sprague-Grundy function of the game Euclid, Discrete Math. 306 (2006) 2798–2800; available at http://dx.doi.org/10.1016/j.disc.2006.04.020.
- M. A. Stern, Über eine zahlentheoretische Funktion, Journal für die reine und angewandte Mathematik 55 (1858) 193–220; available at http://dx.doi.org/10.1515/crll.1858.55.193.
- W. A. Wythoff, A modification of the game of Nim, Nieuw Arch. Wisk. 7 (1907) 199–202.