Reddit mentions of Discrete and Combinatorial Mathematics: An Applied Introduction, Fifth Edition

> Mathematical Logic

It's not exactly Math Logic, just a bunch of techniques mathematicians use. Math Logic is an actual area of study. Similarly, actual Set Theory and Proof Theory are different from the small set of techniques that most mathematicians use.

Also, looks like you have chosen mostly old, but very popular books. While studying out of these books, keep looking for other books. Just because the book was once popular at a school, doesn't mean it is appropriate for your situation. Every year there are new (and quite frankly) pedagogically better books published. Look through them.

Here's how you find newer books. Go to Amazon. In the search field, choose "Books" and enter whatever term that interests you. Say, "mathematical proofs". Amazon will come up with a bunch of books. First, sort by relevance. That will give you an idea of what's currently popular. Check every single one of them. You'll find hidden jewels no one talks about. Then sort by publication date. That way you'll find newer books - some that haven't even been published yet. If you change the search term even slightly Amazon will come up with completely different batch of books. Also, search for books on Springer, Cambridge Press, MIT Press, MAA and the like. They usually house really cool new titles. Here are a couple of upcoming titles that might be of interest to you: An Illustrative Introduction to Modern Analysis by Katzourakis/Varvarouka, Understanding Topology by Shaun Ault. I bet these books will be far more pedagogically sound as compared to the dry-ass, boring compendium of facts like the books by Rudin.

If you want to learn how to do routine proofs, there are about one million titles out there. Also, note books titled Discrete Math are the best for learning how to do proofs. You get to learn techniques that are not covered in, say, How to Prove It by Velleman. My favorites are the books by Susanna Epp, Edward Scheinerman and Ralph Grimaldi. Also, note a lot of intro to proofs books cover much more than the bare minimum of How to Prove It by Velleman. For example, Math Proofs by Chartrand et al has sections about doing Analysis, Group Theory, Topology, Number Theory proofs. A lot of proof books do not cover proofs from Analysis, so lately a glut of new books that cover that area hit the market. For example, Intro to Proof Through Real Analysis by Madden/Aubrey, Analysis Lifesaver by Grinberg(Some of the reviewers are complaining that this book doesn't have enough material which is ridiculous because this book tackles some ugly topological stuff like compactness in the most general way head-on as opposed to most into Real Analysis books that simply shy away from it), Writing Proofs in Analysis by Kane, How to Think About Analysis by Alcock etc.

Here is a list of extremely gentle titles: Discovering Group Theory by Barnard/Neil, A Friendly Introduction to Group Theory by Nash, Abstract Algebra: A Student-Friendly Approach by the Dos Reis, Elementary Number Theory by Koshy, Undergraduate Topology: A Working Textbook by McClusckey/McMaster, Linear Algebra: Step by Step by Singh (This one is every bit as good as Axler, just a bit less pretentious, contains more examples and much more accessible), Analysis: With an Introduction to Proof by Lay, Vector Calculus, Linear Algebra, and Differential Forms by Hubbard & Hubbard, etc

This only scratches the surface of what's out there. For example, there are books dedicated to doing proofs in Computer Science(for example, Fundamental Proof Methods in Computer Science by Arkoudas/Musser, Practical Analysis of Algorithms by Vrajitorou/Knight, Probability and Computing by Mizenmacher/Upfal), Category Theory etc. The point is to keep looking. There's always something better just around the corner. You don't have to confine yourself to books someone(some people) declared the "it" book at some point in time.

Last, but not least, if you are poor, peruse Libgen.

The Rosen text is absolutely awful. Try Grimaldi's more lucid treatment of the subject: http://www.amazon.com/Discrete-Combinatorial-Mathematics-Applied-Introduction/dp/0201726343

This sounds like more of an /r/programming type of question, but I suspect the answer is just to find a programming language you want to learn and pick up an "Intro to [programming language]" book that gets good reviews.

EDIT: You deleted your clarification question before I could respond to it, but the typical starting place would be any introductory book on discrete math. You may want to look at one that tries to be a bit more applied, like Grimaldi's book for example.

Discrete and Combinatorial Mathematics: An Applied Introduction by Ralph P. Grimaldi is the textbook for the Discrete Mathematics class I'm taking at university. I think it's an alright book; high school students shouldn't have a problem with it. There are only a few mentions and examples of cryptography in the book, though.

I'm in Macm 101 this semester. There's a few people in my class taking it for the second time. You need to get at least 50% on the final to pass the class. The textbook can be found online for free if you want to get a head start. https://www.amazon.ca/Discrete-Combinatorial-Mathematics-Ralph-Grimaldi/dp/0201726343

Logic, Number theory, Graph Theory and Algebra are all too much for you to handle on your own without first learning the basics. In fact, most of those books will probably expect you to have some mathematical maturity (that is, reading and writing proofs).

I don't know how theoretical your CS program is going to be, but I would recommend working on your discrete math, basic set theory and logic.

This book will teach you how to write proofs, basic logic and set theory that you will need: http://www.amazon.com/How-Prove-It-Structured-Approach/dp/0521675995


I can't really recommend a good Discrete Math textbook as most of them are "meh", and "How to Prove It" does contain a lot of the material usually taught in a Discrete Math course. The extra topics you will find in discrete maths books is: basic probability, some graph theory, some number theory and combinatorics, and in some books even some basic algebra and algorithm analysis. If I were you I would focus mostly on the combinatorics and probability.


Anyway, here's a list of discrete math books. Pick the one you like the most judging from the reviews:

• http://www.amazon.com/Discrete-Mathematics-Applications-Susanna-Epp/dp/0495391328
  
• http://www.amazon.com/Discrete-Combinatorial-Mathematics-Applied-Introduction/dp/0201726343
  
• http://www.amazon.com/Discrete-Mathematics-Applications-Kenneth-Rosen/dp/0073383090
  
• http://www.amazon.com/Discrete-Mathematics-Computer-Science-Solutions/dp/053449501X
  
• http://www.amazon.com/Mathematics-Discrete-Introduction-Edward-Scheinerman/dp/0840049420 (read the reviews of the previous edition: http://www.amazon.com/Mathematics-Discrete-Introduction-Edward-Scheinerman/dp/0534398987)
  
  
  Don't bother trying to learn too much too soon, as you really do need to let time for the math to sink in.

I'd recommend Grimaldi's Discrete and Combinatorial Mathematics. I've taught several courses out of it now and have been very happy with it.

O cambiar de temas e intentar entender en profunidad las implicaciones de lo visto. Si alguien le da 3 hs seguidas en la misma seccion a Grimaldi se le funde el bocho.

Eso solo de estudiar y entender los conceptos. Hacer ejercicios o resolver los problemas creo que podes meterle facil como dice u/chabon22 varias horas. Total no te sale uno y pasas a otro o cambias a otra guia y ya.