Olympia Nicodemi’s Discrete Mathematics remains a relevant and valuable contribution to mathematics education. It successfully demystifies the transition from computational calculus to abstract algebra and logic. By prioritizing clarity, logical flow, and the art of the proof, the text ensures that students are well-prepared for the rigors of upper-division computer science and mathematics. While it may not be the most exhaustive reference on the market, it is undoubtedly one of the most effective teaching instruments available for introductory discrete mathematics.
From basic permutations to complex combinations, Nicodemi breaks down counting principles. This section is vital for understanding probability and the complexity of algorithms. 4. Graph Theory Discrete Mathematics by Olympia Nicodemi
Nicodemi sits between Hammack (pure proof) and Epp (balanced). It’s more applied than Hammack but less than Epp. While it may not be the most exhaustive
In many departments, this book serves as a bridge—a gentle, rigorous bridge—from high-school algebra to the upper-division proof courses like Real Analysis or Abstract Algebra. It is the place where potential mathematicians learn to spread their logical wings. In many departments
