Discrete Mathematics; by Sherwood Washburn, Thomas Marlowe, and Charles T. Ryan
Discrete mathematics is basically logic for computer science majors.
Contents:
1. Sets, subsets, induction, and recursion
2. Integers, remainders, and the Golden Ratio
3. Functions, relations, and counting
4. Graphs (i.e. configurations of nodes)
5. Proof techniques and logic
6. Boolean algebras, Boolean functions, and logic
---
7. Graphs and relations
8. Algorithms
9. Combinatorics
10. Models of computation
Thank you for asking. No, I have not read Elements, This might be a dream for the future. Yes, I am a math major and I was on-time in all regards this past week (first week of the semester). Discrete Mathematics? No that was a failed experiment, although I may attempt to take an intro to computer science class in the spring. I got to page 80 out of 360 or so, but I kept shuffling around my particular courses for this fall and spring. To be honest, the subject matter really interests me. But I want to graduate in greater than or equal to a year. Knock on wood.Are you a math major, or just nerding out on math textbooks? At least, I’m assuming based on the contents you provided it’s a textbook? Just curious haha
Have you read Euclid’s Elements yet ?
Thank you for asking. No, I have not read Elements, This might be a dream for the future. Yes, I am a math major and I was on-time in all regards this past week (first week of the semester). Discrete Mathematics? No that was a failed experiment, although I may attempt to take an intro to computer science class in the spring. I got to page 80 out of 360 or so, but I kept shuffling around my particular courses for this fall and spring. To be honest, the subject matter really interests me. But I want to graduate in greater than or equal to a year. Knock on wood.