Discrete Mathematics by Norman L. BiggsDiscrete Mathematics by Norman L. Biggs

Discrete Mathematics

byNorman L. Biggs

Paperback | December 15, 2002

Pricing and Purchase Info

$86.27 online 
$106.95 list price save 19%
Earn 431 plum® points
Quantity:

Ships within 1-3 weeks

Ships free on orders over $25

Not available in stores

about

Biggs' Discrete Mathematics has been a best-selling textbook since the first and revised editions were published in 1986 and 1990, respectively. This second edition has been developed in response to undergraduate course changes and changes in students' needs. New to this edition are chapters on statements and proof, logical framework, and natural numbers and the integers, in addition to updated chapters from the previous edition. The new chapters are presented at a level suitable for mathematics and computer science students seeking a first approach tothis broad and highly relevant topic. Each chapter contains newly developed tailored exercises, and miscellaneous exercises are presented throughout, providing the student with over 1000 individual tailored exercises. This edition is accompanied by a website www.oup.com/mathematics/discretemathcontaining hints and solutions to all exercises presented in the text, providing an invaluable resource for students and lecturers alike. The book is carefully structured, coherent and comprehensive, and is the ideal text for students seeking a clear introduction to discrete mathematics, graph theory, combinatorics, number theory, coding theory and abstract algebra.
Norman Biggs is a Professor of Mathematics, London School of Economics, University of London.
Loading
Title:Discrete MathematicsFormat:PaperbackDimensions:440 pages, 9.65 × 7.17 × 0.98 inPublished:December 15, 2002Publisher:Oxford University PressLanguage:English

The following ISBNs are associated with this title:

ISBN - 10:0198507178

ISBN - 13:9780198507178

Look for similar items by category:

Reviews

Table of Contents

The Language of Mathematics1. Statements and proofs2. Set notation3. The logical framework4. Natural numbers5. Functions6. How to count7. Integers8. Divisibility and prime numbers9. Fractions and real numbersTechniques10. Principles of counting11. Subsets and designs12. Partition, classification and distribution13. Modular arithmeticAlgorithms and Graphs14. Algorithms and their efficiency15. Graphs16. Trees, sorting and searching17. Bipartite graphs and matching problems18. Digraphs, networks and flows19. Recursive techniquesAlgebraic Methods20. Groups21. Groups of permutations22. Rings, fields and polynomials23. Finite fields and some applications24. Error-correcting codes25. Generating functions26. Partitions of a positive integer27. Symmetry and counting

Editorial Reviews

`"the comprehensive course of discrete mathematics" 'L'Enseignement Mathematique, t.36, fasc.1-2, 1990