[ 3 / biz / cgl / ck / diy / fa / ic / jp / lit / sci / vr / vt ] [ index / top / reports ] [ become a patron ] [ status ]
2023-11: Warosu is now out of extended maintenance.

/sci/ - Science & Math

View post   
File: 47 KB, 397x499, 51IXUZTs74L._SX395_BO1,204,203,200_.jpg [View same] [iqdb] [saucenao] [google]
8007956 No.8007956 [Reply] [Original]

I've just learned that the text we're using for Discrete math next fall is this http://www.amazon.com/Discrete-Mathematics-Edition-Richard-Johnsonbaugh/dp/0131593188 and that my instructor is not highly rated. Unfortunately this is unavoidable and I'd like to get a good understanding of the material over the summer.

What are your favorite texts over discrete mathematics?

>> No.8007971
File: 63 KB, 669x794, Discrete math.png [View same] [iqdb] [saucenao] [google]
8007971

>>8007956

>> No.8007976

I used this book for my Advanced Discrete Math class http://www.amazon.com/Invitation-Discrete-Mathematics-Jiri-Matousek/dp/0198570422
It's way better then the one I used for my intro to Discrete class. It's got good examples and explanations. Also make sure you understand how to prove things. Math Stack Exchange and proofs wiki are good resources for examples.

>> No.8007981

>>8007971
OP please don't try to do this all over the summer. This kills the undergrad. If you're going to focus on anything, focus on proofs and number theory. I'm guessing you're a CS bro, so you'll have classes in statistics, algorithm analysis, and abstract algebra later on down the line (hopefully).

>> No.8007989

>>8007981
Thanks for narrowing that bit down for me, and yeah you're correct (though Comp. Eng.). I don't see abstract algebra as a requirement (not that I know what it is as a lowly Calc1 student) but I'm sure I could fit it on my list at some point.

>> No.8008118

>>8007989
Abstract algebra for crypto familam.

>> No.8008145

>>8007956
I've read nearly every page of these 5 books
> A course in enumeration by Aigner
> Flajolet and Sedgewick Analytic combinatorics
> Stanley's enumerative combinatorics
> Modern Graph Theory by Bollobas
> Additive combinatorics y Tao and Vu

Even if it's not high-level like Tao/Vu, the BEST is clearly Martin Aigner. Many illustrations, lots of exercices, many many astounding and beautiful results, perfect pedagogy. I have no words strong enough for this book.

Bollobas is ultra-complete and has more than 600 exercises, but it's really hard to read. This guy is just better than us and what's clear for him is not for me.

Flajolet/Sedgewick and Stanley = absolue reference, I learnt a lot in these books, you'll have to read parts of them

Tao/Vu : I don't really like, proofs are messy, but it's high-level