This section handles the "art of counting." Biggs moves from basic multiplication principles to permutations, combinations, binomial coefficients, and the Pigeonhole Principle. He includes careful derivations of combinatorial identities, which are often glossed over in lighter texts.

The 2nd edition (ISBN: 9780198507178) is available through major retailers: Waterstones Oxford University Press Academic

Standard but essential. Biggs covers Venn diagrams, power sets, Cartesian products, and equivalence relations. His treatment of functions (injective, surjective, bijective) is particularly crisp, laying the groundwork for counting permutations and combinations later.

One of the book's highlights. Biggs explains modular arithmetic, the Euclidean algorithm, and Fermat’s Little Theorem. He then applies these directly to the RSA cryptosystem. For a 2002 text, this was forward-thinking, showing students that discrete math protects their credit cards online.

The final part bridges math to computer science. Biggs introduces the concept of an algorithm, recursion, and Big-O notation. He walks through sorting algorithms (merge sort, quick sort) and graph algorithms (Dijkstra’s shortest path), analyzing their efficiency.

While Biggs authored earlier editions and related texts (such as Discrete Mathematics for Computing ), the edition is particularly significant. Published at the dawn of the modern internet era and the explosion of computer science degrees, this edition was tailored to a generation of students who needed strong combinatorial reasoning for algorithms, cryptography, and network theory.

In the vast landscape of mathematical education, few texts manage to bridge the gap between rigorous theory and practical application as elegantly as Norman L. Biggs’ . Published by the prestigious Oxford University Press in 2002 , this volume has become a cornerstone for undergraduates encountering the subject for the first time. For anyone searching for the keyword "norman biggs discrete mathematics oxford university press -2002- pdf" , this article will explore why this book remains relevant, what it contains, and how to approach it academically.

Norman Biggs’ Discrete Mathematics is a classic textbook designed for undergraduate students in mathematics and computer science. It emphasizes , logical reasoning , and applications to computing.

Unlike older texts that treated discrete math as a collection of unrelated tricks, the 2002 OUP edition frames it as a cohesive language. The publication date places it after the "Dot-com boom," when universities recognized that computer science was not just applied calculus but a discipline deeply rooted in logic, sets, and graphs.

: Includes over 1,000 tailored exercises with solutions for selected questions. Google Books Purchase Options