| Reviews |
| - 'This is a new edition of a successful textbook ... this revision is particularly welcome ... The text is written in a fluent but rigorous style and should appeal to sixthformers and undergraduates who are alienated by more formal presentations. There are plenty of approachable exercises, ranging from easy riders to establish technique to more challenging problems which introduce new ideas,
and a bonus is that all the answers are available on a companion web-site. I can thoroughly recommend this text.' - The Mathematical Gazette
- '
A well known definition says that a textbook is a book such that everybody thinks he can write a better one. Biggs' Discrete Mathematics
is an exception - not only for its wide range of topics and its clear organization but notably for its excellent style of explanation.
' - EMS
- '... the ideal choice for introductory courses to discrete mathematicians.' - Zentralblatt MATH
|
| Description | | - 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
| 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.
|
| Contents |
The Language of Mathematics
1.
Statements and proofs
2.
Set notation
3.
The logical framework
4.
Natural numbers
5.
Functions
6.
How to count
7.
Integers
8.
Divisibility and prime numbers
9.
Fractions and real numbers
Techniques
10.
Principles of counting
11.
Subsets and designs
12.
Partition, classification and distribution
13.
Modular arithmetic
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
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
|
| Authors, editors,
and contributors |
Norman L. Biggs, Professor of Mathematics, London School of Economics, University of London
|
The specification in this catalogue, including without
limitation price, format, extent, number of illustrations,
and month of publication, was as accurate as
possible at the time the catalogue was compiled.
Occasionally, due to the nature of some contractual restrictions, we
are unable to ship a specific product to a particular territory.
Jacket images are provisional and liable to change before publication.
|
VIEW BASKET
