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.
Discrete mathematics has become a cornerstone of modern computer science education, providing the logical foundation necessary for algorithm design, data structures, and software verification. Discrete Mathematics by Olympia Nicodemi (often co-authored with Margaret A. Winters in various editions) positions itself as a student-friendly introduction to these concepts.
Unlike many competing textbooks that can overwhelm students with dense encyclopedic coverage, Nicodemi’s text focuses on the core concepts necessary for a one or two-semester course. This report analyzes the text’s structure, pedagogical effectiveness, content coverage, and suitability for the modern curriculum. Discrete Mathematics by Olympia Nicodemi
What makes Nicodemi’s text a feature rather than a mere reference is its ability to generate genuine astonishment.
Take the humble pigeonhole principle: If you have more pigeons than holes, at least one hole has two pigeons. Trivial, right? Nicodemi transforms this triviality into a scalpel. In her hands, the principle proves that at a party of six people, there are either three mutual friends or three mutual strangers. The mundane becomes the magical. The discrete becomes the sublime. Discrete mathematics has become a cornerstone of modern
Students who work through this book don’t just learn math; they learn how to think in structures. They learn to see the graph beneath the social network, the recurrence beneath the population model, the Boolean algebra beneath the circuit board. The world becomes a lattice of logical relations.
Here’s a detailed review of "Discrete Mathematics" by Olympia Nicodemi based on its content, style, and typical reception among students and instructors. Counting is often harder than it looks
Counting is often harder than it looks. Nicodemi navigates the student through permutations, combinations, and the Pigeonhole Principle. The inclusion of basic probability ties these counting methods to real-world applications.
Strengths:
Weaknesses:
Unlike most textbooks that sanitize history, Nicodemi integrates the people and problems that gave birth to discrete mathematics. She discusses Euler’s solution to the Königsberg bridge problem not as a historical footnote, but as a case study in mathematical modeling. She talks about Boolean algebra through the lens of George Boole’s original logic, not just as a truth table shortcut for computer science majors. This narrative approach grounds abstract concepts in human curiosity.