Discrete Mathematics

by Norman L. Biggs

The widespread use of computers and the rapid growth in computer science have led to a new emphasis on discrete mathematics, a discipline which deals with calculations involving a finite number of steps. This book provides a well-structured introduction to discrete mathematics, taking a
self-contained approach that requires no ancillary knowledge of mathematics, avoids unnecessary abstraction, and incorporates a wide rage of topics, including graph theory, combinatorics, number theory, coding theory, combinatorial optimization, and abstract algebra. Amply illustrated with examples
and exercises.

Genres: Mathematics, Textbooks, Nonfiction

480 pages, Hardcover

First published January 1, 1986

Reviews

[Arnaldo Santoro · Rating 5 out of 5]

University Math book, with surprising sense of humor.
It teaches logic, proofs, and numbers.
Didactic style is literally fool-proof.
After reading and successfully performing all exercises, expect to score 20 to 30 points higher in IQ tests.
Warmly suggested to everyone who thought "I'm not good at math".

[Leia / Felix · Rating 3 out of 5]

I'm sure this is a good book! I just havent had the time to read theough the exact sentence of every page. Ive read the majority tho so 🤷‍♂️ I'll read it the week before my exam (oh god thats next week)

[Subhodip Panda · Rating 3 out of 5]

Really good book for maths lovers. The preliminary theories of sets are well explained here.

[Luciano Sanzaro · Rating 5 out of 5]

There are lots of fun (and good) books on discrete math. I’m not sure this book is fun, but it’s certainly good, especially if you are new to the subject.
This book covers many topics a computer scientist should be one familiar with, from elementary number theory and combinatorics, to finite fields. There’s an entire section for graph and algorithms with several hints for further investigation; this section is a great companion to computer programming books. The section on algebraic topics is useful if you want to learn the essential properties of finite groups and fields without attending lessons in abstract algebra.
The author maintains an informal style and avoids the use of historical notions, which would be useless for a book of this kind; the depth of detail is not overwhelming and hints for more advanced topics are suggested in the problems at the end of each chapter.

[Carl · Rating 4 out of 5]

Packed with material. From classic discrete math intro subjects like proofs and combinatorics to basic abstract algebra and some algorithms. Would have liked even more focus on combinatorics and graphs but just my opinion. Very short and to the point as is expected from an European text book.