Discrete Mathematics
Price: 630.00 INR
We sell our titles through other companies
Disclaimer :You will be redirected to a third party website.The sole responsibility of supplies, condition of the product, availability of stock, date of delivery, mode of payment will be as promised by the said third party only. Prices and specifications may vary from the OUP India site.
ISBN:
9780198713692
Publication date:
03/12/2013
Paperback
440 pages
241.0x184.0mm
Price: 630.00 INR
We sell our titles through other companies
Disclaimer :You will be redirected to a third party website.The sole responsibility of supplies, condition of the product, availability of stock, date of delivery, mode of payment will be as promised by the said third party only. Prices and specifications may vary from the OUP India site.
ISBN:
9780198713692
Publication date:
03/12/2013
Paperback
440 pages
241.0x184.0mm
Biggs' Discrete Mathematics has been a best-selling textbook since the first and revised editions were published in 1986 and 1990, respectively.
Suitable for: This second edition has been developed in response to undergraduate course changes and changes in students' needs.
Rights: OUP UK (Indian Territory)
Description
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 to this 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-discretemath containing 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.
Table of contents
Part 1: The Language of Mathematics
Chapter 1. Statements and proofs
Chapter 2. Set notation
Chapter 3. The logical framework
Chapter 4. Natural numbers
Chapter 5. Functions
Chapter 6. How to count
Chapter 7. Integers
Chapter 8. Divisibility and prime numbers
Chapter 9. Fractions and real numbers
Part 2: Techniques
Chapter 10. Principles of counting
Chapter 11. Subsets and designs
Chapter 12. Partition, classification and distribution
Chapter 13. Modular arithmetic
Part 3: Algorithms and Graphs
Chapter 14. Algorithms and their efficiency
Chapter 15. Graphs
Chapter 16. Trees, sorting and searching
Chapter 17. Bipartite graphs and matching problems
Chapter 18. Digraphs, networks and flows
Chapter 19. Recursive techniques
Part 4: Algebraic Methods
Chapter 20. Groups
Chapter 21. Groups of permutations
Chapter 22. Rings, fields and polynomials
Chapter 23. Finite fields and some applications
Chapter 24. Error-correcting codes
Chapter 25. Generating functions
Chapter 26. Partitions of a positive integer
Chapter 27. Symmetry and counting
Features
- New edition of a best-selling undergraduate textbook
- Contains nine new introductory chapters, in addition to updated chapters from the previous edition
- Contains over 1000 individual exercises and selected solutions
- Companion website www.oup.com-mathematics-discretemath contains hints and solutions to all exercises
Description
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 to this 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-discretemath containing 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.
Read MoreTable of contents
Part 1: The Language of Mathematics
Chapter 1. Statements and proofs
Chapter 2. Set notation
Chapter 3. The logical framework
Chapter 4. Natural numbers
Chapter 5. Functions
Chapter 6. How to count
Chapter 7. Integers
Chapter 8. Divisibility and prime numbers
Chapter 9. Fractions and real numbers
Part 2: Techniques
Chapter 10. Principles of counting
Chapter 11. Subsets and designs
Chapter 12. Partition, classification and distribution
Chapter 13. Modular arithmetic
Part 3: Algorithms and Graphs
Chapter 14. Algorithms and their efficiency
Chapter 15. Graphs
Chapter 16. Trees, sorting and searching
Chapter 17. Bipartite graphs and matching problems
Chapter 18. Digraphs, networks and flows
Chapter 19. Recursive techniques
Part 4: Algebraic Methods
Chapter 20. Groups
Chapter 21. Groups of permutations
Chapter 22. Rings, fields and polynomials
Chapter 23. Finite fields and some applications
Chapter 24. Error-correcting codes
Chapter 25. Generating functions
Chapter 26. Partitions of a positive integer
Chapter 27. Symmetry and counting
