BIBLIOGRAPHY 1983
[28] C. K. Caldwell and H. Dubner, Unique-period primes,Journal of
Recreational Math., 29 (1998) 43–48.
[29] L. Carroll,Pillow Problems and A Tangled Tale, 1895 and 1885,
Dover reprint, 1958.[30] D. Cass and G. Wildenberg, A novel proof of the infinitude of
primes, revisited,Math. Mag., 76 (2003) 203.
[31] P. L. Chessin and W. B. Carver, Problem E 1111,American Math.
Monthly, 61 (1954) 258; solution 712.[32] A. J. Cole and A. J. T. Davie, A game based on the euclidean
algorithm and a winning strategy for it,Math. Gazette, 53 (1969)
354–357.
[33] D. B. Coleman, Sketch, a geoboard game,Math. Mag., 51 (1978)
49–54.
[34] J. H. Conway and R. K. Guy,The Book of Numbers, Springer,
1996.
[35] R. J. Covill and T. O’Keeffe, Problem 679,Journal of Recre-
ational Math., 10 (1977–1978) 285; solution, 11 (1978–1979)
312.
[36] H. S. M. Coxeter, The golden section, phyllotaxis, and Wythoff’s
game,Scripta Mathematica, 19 (1953) 135–143.[37] K. David, Rencontres reencountered,College Math. Journal,19
(1988) 139–148.
[38] M. N. Desphande, An unexpected encounter with the Fibonacci
numbers,Fibonacci Quarterly, 32 (1994) 108 – 109.[39] D. W. DeTemple, The triangle of smallest perimeter which cir-
cumscribes a semicircle,Fibonacci Quarterly, 30 (1992) 274.
[40] C. Dodge, T. Schoch, P. Y. Woo, and P. Yiu, Those ubiquitous
circles,Math. Mag., 72 (1999) 202–213.[41] H. G. Dworschak and L. Sauv ́e, Problem 19,Crux Math., 1 (1975)
8; solution, 1 (1975) 32–33.
[42] H. Dubner, Recursive prime generating sequences, Journal of
Recreational Math., 29 (1998) 170–175.