A First Course in Discrete Mathematics (Springer Undergraduate Mathematics Series)
Author | : | |
Rating | : | 4.81 (605 Votes) |
Asin | : | 1852332360 |
Format Type | : | paperback |
Number of Pages | : | 200 Pages |
Publish Date | : | 2016-04-26 |
Language | : | English |
DESCRIPTION:
"Not the Best for Discrete Math" according to Hannah Ashley. I have no idea why this would be a good book to start off with when learning Discrete Mathematics. It's hard to understand and I actually had to buy another book to explain this one. My tutors hardly knew how to dissect it and instead helped me by accessing online materials. If you can, stay away from this book. I'm assuming though that like me, you had to buy it because it was required for a class.
He concludes with the constructions of schedules and a brief introduction to block designs. He de scribes the inclusion-exclusion principle followed by partit ions of sets which in turn leads to a study of Stirling and Bell numbers. Starting with an introduction to counting and rel ated problems, he moves on to the basic ideas of graph theor y with particular emphasis on trees and planar graphs. Drawing on many years'experience of teaching discrete mathem atics to students of all levels, Anderson introduces such as pects as enumeration, graph theory and configurations or arr angements. Then follows a treatment of Hamiltonian cycles, Eulerian circuits in graphs, and Latin squares as well as proof of Hall's theorem. Each chapter is backed by a number of examples, with straightforw ard applications of ideas and more challenging pro