| Edition |
2nd ed. |
| Physical description |
xiv, 425 pages : illustrations ; 26 cm |
| Notes |
Includes index. |
| Contents |
Part I Foundations -- 1. Statements and proofs -- 2. Set notation -- 3. Logical framework -- 4. Natural numbers -- 5. Functions -- 6. How to count -- 7. Integers -- 8. Divisibility and prime numbers -- 9. Fractions and real numbers -- Part II Techniques -- 10. Principles of counting -- 11. Subsets and designs -- 12. Partition, classification, and distribution -- 13. Modular arithmetic -- Part III Algorithms and Graphs -- 14. Algorithms and their efficiency -- 15. Graphs -- 16. Trees, sorting, and searching -- 17. Bipartite graphs and matching problems -- 18. Digraphs, networks, and flows -- 19. Recursive techniques -- Part IV Algebraic Methods -- 20. Groups -- 21. Groups of permutations -- 22. Rings, fields, and polynomials -- 23. Finite fields and some applications -- 24. Error-correcting codes -- 25. Generating functions -- 26. Partitions of a positive integer -- 27. Symmetry and counting. |
| Summary |
The long-awaited second edition of Norman Bigg's best-selling Discrete Mathematics, includes new chapters on statements and proof, logical framework, natural numbers, and the integers, in addition to updated chapters from the previous edition. Carefully structured, coherent and comprehensive, each chapter contains tailored exercises and solutions to selected questions, and miscellaneous exercises are presented throughout. This is an invaluable text for students seeking a clear introduction to discrete mathematics, graph theory, combinatorics, number theory and abstract algebra. |
| Subject |
Computer science -- Mathematics.
|
| ISBN |
0198507178 (hbk : alk. paper) |
|
0198507186 (paperback: alk. paper) |
|
