Independent Study of Discrete Mathematics

In summary, the person is asking for textbook recommendations for independently studying Discrete Math due to a scheduling conflict at their university. The conversation covers recommendations for books on logic/proofs and combinatorics/graph theory, as well as books that cover all topics in one. Some suggested books include "Book of Proof" for proof methods, "Combinatorics and Graph Theory" by Harris, et al, and "Discrete Mathematics and Its Applications" by Rosen. Other recommendations include "Discrete and Combinatorial Mathematics" by R. Grimaldi and "Concrete Mathematics" by D. Knuth, et al. The person also shares their personal experience with using discrete math in their studies and encourages the individual to sample different books to find
  • #1
Dewgale
98
9
Hi all,

Due to a scheduling conflict at my university I can't take Discrete Math, and it's a pre-requisite for all of the math courses I want to take next year. Any recommendations on which textbooks I ought to use to independently study the subject?

Thanks!
 
Physics news on Phys.org
  • #2
What topics do you want it to cover? How good are you with proofs?
 
  • #3
Let's look at what most Discrete Math courses cover (at least in the United States): 1)Logic/Proofs, 2)Combinatorics and Graph Theory. I will go into some details on each, as well as recommending books solely on each topic, and then presenting some that cover all.
1)Logic/Proofs: So, many Discrete Math courses begin with an overview of both symbolic logic, and/or proof methods. A book for logic can be found here for free here. I haven't read it personally, but it is supposedly pretty good. Apparently Dr. Suppes is from the philosophy department at Stanford, and this is apparent in the notation he uses in the book :-p (a logic text from a mathematician may more likely use typical Boolean connectives for notation). You may not have to read the entire thing, but it would be important to know the following: sentences, connectives, truth tables, converting statements to symbols and back, quantifiers, column proofs, proof by contradiction, conditional proofs, etc. That could cover Symbolic logic. Now, when you read a book on symbolic logic as a math student, you may not entirely see how it would apply to mathematics, etc. That's why it would also be really advised to find a book on proofs. A free one that also happens to be very good is Book of Proof, which I'll link here. This book, and mathematical proof books in general, contain some logic, but won't go nearly as deep into it as a symbolic logic book.
2)Combinatorics and Graph Theory: Next comes combinatorics. Topics here include counting principles, permutations,recurrence relations,generating functions, and marriage problems. The book I used is Combinatorics and Graph Theory by Harris, et al. It's good, and though it feels a little lighthearted and conversational, can be a little challenging to follow even in it's proofs. There is also no solutions guide. As suggested in the title, it also covers Graph theory, and actually covers it first. Despite going over both, and being as long as other such math books, it does cover a good amount of typical material there. A pretty good book that is free is this one. As the title suggests, it is a guided discovery book, which is a really powerful way to learn. You may want to actually use this book instead of the former one, since the whole idea is centered around self study, and you could always ask either a professor, or on this site for any questions you may have or can't figure out. It also covers some graph theory (and again, free!)! If you use either of the top books you may not need to go much further in graph theory (unless you end up liking it).
3)All: There are some books that cover the above subjects in one. One in particular are these free https://www.seas.harvard.edu/courses/cs20/MIT6_042Notes.pdf, which actually seem pretty good, I mean, it was intended for MIT students!:rolleyes:
 
  • Like
Likes Dewgale
  • #4
Wow, thank you so much! I'll get started on that right away!
 
  • #5
Get an old edition of Discrete Mathematics by Epps and Rosen. I find Epps easier to follow, however it lacks less depth than Rosen. Use Epps as main book and Rosen as a reference.
 
  • #6
At the university I went to, we used Rosen's Discrete Mathematics and Its Applications and we covered pretty much the entire book for a math for comp sci course. I thought the book was good for my level as a student (at the time I was concurrently taking first year calculus). I felt like I had an advantage when the next level of math courses (e.g. linear algebra) compared to the engineers who hadn't gone through logic and proof. I also felt that learning discrete math made the field of mathematics seem more interesting to me since prior to that I thought it was all about calculations and formulas due to the nature of my high school courses.

That said, I can't really say if the textbook alone is sufficient (I must've gotten something out of the lectures). Also I've never read any other intro discrete math book so you should different read samples of a few alternatives and see what you think best fits you.
 
  • #7
If you want rather hardcore books on the discrete mathematics, following two books are really good:

"Discrete and Combinatorial Mathematics" by R. Grimaldi
"Concrete Mathematics" by D. Knuth, et al.
 

Related to Independent Study of Discrete Mathematics

1. What is discrete mathematics?

Discrete mathematics is a branch of mathematics that deals with discrete objects, such as integers, graphs, and sets. It involves the study of mathematical structures and techniques that are used in computer science, cryptography, and other fields.

2. Why is discrete mathematics important?

Discrete mathematics is important because it provides the foundation for many areas of computer science and engineering. It is used to solve real-world problems, design algorithms, and analyze the efficiency of computer programs.

3. What are some key topics in discrete mathematics?

Some key topics in discrete mathematics include set theory, combinatorics, graph theory, logic, and number theory. Other important topics include algorithms, probability, and cryptography.

4. How is discrete mathematics used in computer science?

Discrete mathematics is used in computer science to model and solve problems related to computing, such as data structures, algorithms, and networks. It provides the necessary tools for designing and analyzing efficient algorithms and systems.

5. What are some career options for those with a background in discrete mathematics?

Individuals with a background in discrete mathematics can pursue careers in various fields, including computer science, information technology, data analysis, cryptography, and research. They may also work as mathematicians, statisticians, or operations research analysts.

Similar threads

  • Science and Math Textbooks
Replies
2
Views
949
  • Science and Math Textbooks
Replies
28
Views
2K
  • Science and Math Textbooks
Replies
4
Views
1K
  • Science and Math Textbooks
Replies
3
Views
973
  • Science and Math Textbooks
Replies
3
Views
1K
  • Science and Math Textbooks
Replies
1
Views
2K
  • Science and Math Textbooks
Replies
8
Views
1K
  • Science and Math Textbooks
Replies
4
Views
2K
  • Science and Math Textbooks
Replies
28
Views
3K
  • Science and Math Textbooks
Replies
6
Views
1K
Back
Top