Mathematical gems. II

From MaRDI portal





This book is a most fitting, and welcome, companion to the author's earlier volume with (almost) the same title (Washington 1973) see Zbl 0281.00004. The fourteen chapters are independent of one another and deal with a charming variety of topics from geometry, number theory, combinatorics and graph theory. While the mathematics involved rarely, if ever, goes beyond the high school level it is safe to say that almost every mathematician will find something new and interesting in almost every essay. Among the questions discussed are: How many guards are needed in a art gallery if every picture is to be constantly protected?; If \(n\) points are positioned in the plane how many different distances can occur?; How many times can the minimum (maximum) distance occur?; How many steps will an application of the Euclidean algorithm require?; Is there a simple formula which will generate only primes and each odd prime exactly once?; How can those graphs which permit disjoint \(n\) couplings of their vertices be characterized? Each of these questions, and many others, is answered carefully, completely and lucidly by the author. The title suggests the possibility that more collections of gems are being considered by Prof. Honsberger. We would like to encourage him in his efforts and look forward with anticipation to volume three.




Cited in
(34)








This page was built for publication: Mathematical gems. II

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4099997)