000RM.dvi

(Ann) #1

BIBLIOGRAPHY 1987


[89] R. Honsberger, In Polya’s Footsteps ́ , Math. Assoc. America,
1997.

[90] A. F. Horadam, Fibonacci sequences and a geometric paradox,
Math. Mag.35 (1962) 1–11.

[91] L. S. Johnson, Denumerability of the rational number system,
amm 55 (1948) 65–70.

[92] J. H. Jordan, R. Walsh, and R. J. Wisner, Triangles with integer
sides,American Math. Monthly, 86 (1979) 686–688.

[93] S. Kahan,s-transposable integers,Math. Mag., 49 (1976) 27–28.

[94] D. Kalman and R. Mena, The Fibonacci numbers – exposed,
Math. Mag., 76 (2003) 167–181.

[95] C. Kicey and S. Goel, A series forlnk,American Math. Monthly,
105 (1998).

[96] M. S. Klamkin and P. Watson, Triangulations and Pick’s theorem,
Math. Mag., 49 (1976) 35–37.

[97] D. A. Klarner,Mathematical Recreations, A Collection in Honor
of Martin Gardner, Dover, 1998, originally published asMathe-
matical Gardner, Wadsworth International, CA, 1981.

[98] M. Kleber, The best card trick,Math. Intelligencer, 24 (2002) 1:9–
11.

[99] D. E. Knuth, Fundamental Algorithms, 2nd edition, Addison-
Wesley, 1973.

[100] T. Koshy, The digital root of a Fermat number,Journal of Recre-
ational Math., 31 (2002–2003) 112–113.


[101] M. Kraitchik, Mathematical Recreations, 2nd edition, 1942;
Dover reprint, 1953.


[102] S. Kumar, On Fibonacci sequences and a geometric paradox,
Math. Mag., 37 (1964) 221–223.


[103] V. S. Kumar, On the digital root series,Journal of Recreational
Math., 12 (1979–80) 267–270.

Free download pdf