Discrete Mathematics By Olympia Nicodemi __exclusive__

Discrete Mathematics: A Bridge to Computer Science and Advanced Mathematics

Logic and Set Theory: Nicodemi begins with the building blocks of mathematical language. By mastering truth tables, quantifiers, and set operations, students learn to construct unambiguous arguments. Discrete Mathematics by Olympia Nicodemi

Olympia Nicodemi is a retired professor from SUNY Geneseo, and her book carries the hallmarks of a master teacher who has watched hundreds of students struggle—and succeed. There is no ego in the prose. There are no flashy graphics or gimmicks. Just clear, patient, beautiful mathematical exposition. Discrete Mathematics: A Bridge to Computer Science and

Nicodemi’s text spans approximately 491 pages and includes fundamental topics that are essential for algorithm design and software engineering: There is no ego in the prose

Consider the topic of mathematical induction. Rosen presents the principle, gives 3 easy examples (sum of integers, divisibility, inequality), and then moves on to strong induction. Nicodemi spends an entire chapter on why induction is logically equivalent to the well-ordering principle. She then asks students to find exactly where a false inductive proof breaks down. By the end, students don’t just "do" induction—they own it.

Olympia Nicodemi's textbook, Discrete Mathematics: A Bridge to Computer Science and Advanced Mathematics