| A First Course in Discrete Mathematics 2002 Edition Contributor(s): Anderson, Ian (Author) |
|
 |
ISBN: 1852332360 ISBN-13: 9781852332365 Publisher: Springer OUR PRICE: $36.09 Product Type: Paperback Published: October 2000 Annotation: Discrete mathematics has now established its place in most undergraduate mathematics courses. This textbook provides a concise, readable and accessible introduction to a number of topics in this area, such as enumeration, graph theory, Latin squares and designs. It is aimed at second-year undergraduate mathematics students, and provides them with many of the basic techniques, ideas and results. It contains many worked examples, and each chapter ends with a large number of exercises, with hints or solutions provided for most of them. As well as including standard topics such as binomial coefficients, recurrence, the inclusion-exclusion principle, trees, Hamiltonian and Eulerian graphs, Latin squares and finite projective planes, the text also includes material on the mnage problem, magic squares, Catalan and Stirling numbers, and tournament schedules. |
| Additional Information |
| BISAC Categories: - Mathematics | Discrete Mathematics - Mathematics | Combinatorics - Computers | Data Processing |
| Dewey: 510 |
| LCCN: 00063762 |
| Series: Springer Undergraduate Mathematics |
| Physical Information: 0.45" H x 6.14" W x 9.21" (0.67 lbs) 200 pages |
| Descriptions, Reviews, Etc. |
| Publisher Description: Discrete mathematics has now established its place in most undergraduate mathematics courses. This textbook provides a concise, readable and accessible introduction to a number of topics in this area, such as enumeration, graph theory, Latin squares and designs. It is aimed at second-year undergraduate mathematics students, and provides them with many of the basic techniques, ideas and results. It contains many worked examples, and each chapter ends with a large number of exercises, with hints or solutions provided for most of them. As well as including standard topics such as binomial coefficients, recurrence, the inclusion-exclusion principle, trees, Hamiltonian and Eulerian graphs, Latin squares and finite projective planes, the text also includes material on the ménage problem, magic squares, Catalan and Stirling numbers, and tournament schedules. |