Discrete Mathematics By Olympia Nicodemi [new] Jun 2026

: While older, the text remains available for study through academic resources like the Internet Archive and is sold by retailers such as Amazon and Biblio .

Union, intersection, complements, and Venn diagrams.

Eulerian and Hamiltonian paths, planar graphs, and graph coloring.

Nicodemi balances theoretical mathematical rigor with functional computer science applications. The material targets first- and second-year undergraduate students. It systematically establishes proof methodologies before moving into complex abstract systems. The textbook is built around key logical modules: Discrete Mathematics by Olympia Nicodemi

. An essay could explore how these skills allow computer scientists to verify that their code and systems are inherently sound. Discrete vs. Continuous

Comprehensive Review: Discrete Mathematics by Olympia Nicodemi

The text provides a rigorous treatment of relations and functions, essential for database theory and programming language semantics. It covers equivalence relations, partial orders, and bijections with a balance of graphical representation (digraphs) and algebraic definition. : While older, the text remains available for

The foundational shift from continuous mathematics (like calculus) to discrete systems is a defining moment for computer science and advanced mathematics undergraduates. by Olympia Nicodemi (published by West Publishing Company) serves exactly as that essential gateway.

Have you used Olympia Nicodemi’s Discrete Mathematics in your studies or teaching? Share your experience (or your favorite exercise from the text) in the discussion below.

Discrete Mathematics by Olympia Nicodemi (published in 1987) is often regarded as a classic introductory text, specifically noted for its clarity and accessibility for students transitioning into higher-level computer science or mathematics. While it is older, it remains a cited reference in various academic syllabi for computer applications (BCA) . Key Features & Content The textbook is built around key logical modules:

Where other books might present the Pigeonhole Principle as a simple formula followed by ten computational exercises, Nicodemi pauses. She asks: Why does this work? Can you construct a counterexample? The book is notoriously light on "plug-and-chug" exercises and heavy on proofs, generalizations, and open-ended problems.

Many students struggle with mathematical proofs. Nicodemi breaks this down, offering a gentle introduction to and logical reasoning before moving on to more complex topics, making it ideal for sophomores or juniors. 4. Strong Pedagogical Structure

Rather than presenting an intimidating 1,000-page tome, Nicodemi focuses strictly on the foundational topics students must master to succeed in subsequent algorithms or abstract algebra courses.

However, there is a consistent drawback that readers have noted. While the exercises are plentiful, the provided answer keys in the back of the book are incomplete, with some problems' answers omitted or referenced unclearly. This can be a significant barrier for independent learners who rely on answer keys for self-assessment.

Injective (one-to-one), surjective (onto), and bijective mappings.