Discrete Mathematics: A Bridge to Computer Science and Advanced Mathematics
(1987) is a foundational textbook designed to transition students from continuous mathematics (like calculus) to the discrete structures essential for computing and higher-level math. Core Focus and Purpose
The Core Strength: Clarity Over Complexity
The standout feature of Nicodemi’s writing is her pedagogical approach.
Problem-Solving Focus: A significant portion of the exercises requires students to translate word problems into formal mathematical language.
- A detailed summary of the book or a chapter-by-chapter overview
- Key concepts, definitions, and important theorems covered in the book
- Worked examples or explanations of specific sections or problems (you can quote short excerpts you’re stuck on)
- A study guide or practice problem set with solutions based on the book’s topics
- Where to legally obtain or buy the book (summary of options)
Weaknesses
-
"Given the recursive definition of the Fibonacci numbers, prove that the sum of any ten consecutive Fibonacci numbers is divisible by 11. Is this true for every integer divisor? Explain."
You can structure the "useful" sections of your essay around these core modules found in the text: Set Theory and Relations
Beyond the Calculus Crush: Reclaiming the Joy of Pure Reason with Olympia Nicodemi’s Discrete Mathematics
For most undergraduates, the "math" they know is a continuous blur. Calculus. Differential equations. The smooth, slippery slope of real numbers sliding into infinity. It is the mathematics of motion, of speed, of the analog hum of the universe. It is also, for many, the mathematics of anxiety.
