Published by Oxford University Press, Discrete Mathematics (revised in 2002) was Biggs’ answer. The book intentionally breaks from the dry, theorem-proof-corollary format. Instead, it is structured around the specific needs of a programmer or algorithm designer.
The beauty of Biggs' Discrete Mathematics lies in its structured approach. The book is divided into distinct parts that build your mathematical maturity step-by-step. 1. The Language of Mathematics norman l. biggs discrete mathematics pdf
Before the 1980s, the mathematical training of a computer scientist was predominantly rooted in calculus and linear algebra. Norman L. Biggs, a distinguished professor at the London School of Economics (LSE), recognized a fundamental mismatch. Computer science, he argued, was not the continuous mathematics of Newton, but the discrete mathematics of Leibniz: logic, graphs, trees, and finite sets. The beauty of Biggs' Discrete Mathematics lies in