Product Description

Using a traditional deductive approach, this book looks into the fundamental ideas in discrete mathematics, including graph theory, combinatorics, number theory, coding theory, combinatorial optimization and abstract algebra. It can be approached by anyone with basic competence in arithmetic and experience of simple algebraic manipulations and students of computer science whose curriculum may now allow the study of many ancillary mathematics courses. The main changes to this new edition are to present descriptions of numerous algorithms on a form close to that of a real programming language. The aim is to enable students to develop practical programs from the design of algorithms.

Product Details

• Amazon Sales Rank: #443443 in Books
• Published on: 1989-08
• Original language: English
• Number of items: 1
• Binding: Paperback
• 496 pages

Zentralblatt MATH
"... the ideal choice for introductory courses to discrete mathematicians."

Review
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 )

Zentralblatt MATH
"... the ideal choice for introductory courses to discrete mathematicians."