Norman Biggs is a well-known mathematician and computer scientist, and his book "Discrete Mathematics" is a popular textbook in the field.
Disclaimer: This post is for informational purposes. Always consider supporting authors and publishers by purchasing official copies of educational texts where possible.
Discrete mathematics focuses on countable, distinct, and separated structures. This contrasts with continuous mathematics, which deals with smooth, unbroken calculus and real numbers. As digital computers operate using binary states (zeros and ones), the logic governing them is entirely discrete.
Weak and strong induction methodologies for formal proofs. Part 2: Combinatorics and Counting Norman Biggs is a well-known mathematician and computer
: Discusses algorithm efficiency, graph theory, trees, sorting, networks, and flows.
Norman Biggs, Discrete Mathematics (Revised Edition), Oxford University Press, 2002. ISBN: 978-0198507178.
The second edition of Discrete Mathematics features a reorganized, four-part structure designed to guide students logically from foundational concepts to complex algebraic systems. The book is divided into 24 manageable chapters, making it highly adaptable for a one- or two-semester university course. Part I: Foundations Weak and strong induction methodologies for formal proofs
Norman Biggs, an Emeritus Professor at the London School of Economics, refined the 2002 edition to bridge the gap between abstract theory and practical application. This version is particularly prized for:
For those interested in learning more about discrete mathematics, there are several online resources available, including:
You’ll find everything from sets and functions to modular arithmetic and cryptography. What’s Inside? Foundations: Logic, proof techniques, and set theory. Combinatorics: Counting principles and generating functions. Graphs and Algorithms: Trees, networks, and the basics of complexity. Algebraic Structure: Groups, rings, and their applications in coding theory. its pedagogical value
A graph is a way of representing a set of objects and the connections between them. We will study the basic properties of graphs and how they can be used to model real-world situations.
If you need help solving a specific problem from this textbook, Share public link
This part directly bridges the gap to computer science. It introduces readers to the efficiency of algorithms, graph theory, trees (including sorting and searching), bipartite graphs, network flows, and recursive problem-solving techniques.
But why does the 2002 edition in particular continue to be referenced, sought after, and sometimes—controversially—discussed in the context of formats? This article provides a comprehensive overview of Biggs’ work, its structure, its pedagogical value, and the ongoing conversation surrounding its digital availability.