Discrete Mathematics By Olympia Nicodemi ~upd~
The focus on proof and reasoning improves a student's ability to approach complex problems systematically. Conclusion
Undergraduate students, particularly those majoring in computer science, mathematics, or computer engineering.
is a foundational textbook that has shaped how undergraduate students approach discrete structures, logic, and proof writing. First published in 1987, this book stands out for its exceptional clarity and readable style. It bridges the gap between high school algebra and advanced abstract mathematics. Core Philosophy and Approach
A perfect first proof book. Gentle without being soft. Rigorous without being cruel. Highly recommended for the anxious beginner and the jaded instructor alike. Discrete Mathematics by Olympia Nicodemi
: The text spans approximately 491 pages and is noted for its illustrated format. Key Topics Covered
In the vast landscape of undergraduate math textbooks, many volumes on discrete mathematics read like encyclopedias: dense, dry, and dizzying with sidebars. Then there is the quiet exception—Olympia Nicodemi’s Discrete Mathematics: A Bridge to Proofs and Beyond (commonly referred to simply as Discrete Mathematics by Nicodemi ).
It serves as an excellent "transition" book for math majors or CS students who need to sharpen their logical rigor. Final Verdict The focus on proof and reasoning improves a
Logic gates, minimization techniques, and Karnaugh maps.
The exercises and examples often relate to computing scenarios, helping students see the "why" behind the theory.
A significant portion of the book is dedicated to techniques for counting discrete structures. This includes permutations, combinations, the pigeonhole principle, and the inclusion-exclusion principle. This section directly applies to analyzing the complexity of algorithms and probability. D. Graph Theory and Trees First published in 1987, this book stands out
by Olympia Nicodemi is a foundational textbook published by West Publishing Company. First released in 1987, this text remains highly regarded for its structured pedagogical approach to finite mathematical structures. It bridges the gap between high school calculus and undergraduate computer science or advanced mathematics courses.
Nicodemi organizes the text around the core pillars of discrete mathematics, ensuring each concept builds logically upon the previous one. 1. Mathematical Logic and Proof Techniques
: Developing the student's ability to think logically and analyze arguments.
If you are currently studying or teaching this material, let me know how you plan to use it so we can tailor the next steps. Are you looking to based on this text, or do you need help solving a specific type of problem (like induction or combinatorics)? Share public link
The exercises are another highlight. They are not endless, repetitive drills. Many are short proofs, some are counterexample hunts, and a few are genuine mini-research puzzles. The difficulty ramps slowly, but steadily. By the end, a student who began unsure how to prove “If n is even, then n² is even” can handle basic graph theory proofs and combinatorial identities.
