Found 7 comments on HN
BiancaDelRio · 2018-03-02 · Original thread
I am not sure to be honest, but if you want a book with answers, try Discrete Mathematics with Applications by Epp [0]

It has a very large number of answers in the back, but not all of them. You'll come out ahead even if you only do the problems with an answer as each section has anywhere between 30 to 60 problems. If you want to try every problem (or some of the interesting ones that don't have answers), there's an instructor's manual for 3rd edition. The one I linked is the 4th ed. No problem as the editions 3 and 4 mainly differ in numbering of their sections and chapters, so if you match a chapter from 4 ed to the one in the instructor's manual for 3rd ed, the answers are identical and in the same order. If none of this works for you, either just google the problem or visit MSE [1] as almost none of the problems in the undergrad books are original and many people before you have asked the same questions many times over.

Note, the price of the book is steep, but I am sure you know of libg3n.



prostitutka · 2017-11-20 · Original thread
My answer to your question is math. Learn to read and write proofs. Any intro to proofs will do: those employed in discrete math, the ones in analysis, the diagram chasing ones, whatever...Working with math proofs will definitely straighten out your thinking and whip your mind into shape.

Some suggestions to get you started:

Book of Proof by Richard Hammack:

Discrete Math by Susanna Epp:

Mathematical Proofs: A Transition to Advanced Mathematics by Chartrand et al:

How to Think About Analysis by Lara Alcock:

Learning to Reason: An Introduction to Logic, Sets, and Relations by Nancy Rodgers:

Mathematics: A Discrete Introduction by Edward Scheinerman:

The Real Analysis Lifesaver: All the Tools You Need to Understand Proofs by Rafi Grinberg:

Linear Algebra: Step by Step by Kuldeep Singh:

Abstract Algebra: A Student-Friendly Approach by the Dos Reis:

That's probably plenty for a start.

impendia · 2017-03-06 · Original thread
This fall I will be teaching the required "Discrete Math for CS course" to about fifty students at the University of South Carolina. Previously I used Epp's book [1] which in my opinion is an outstanding book but regrettably is $280.44. Many of our students are working minimum wage jobs to make ends meet, and I don't want to make them pay so much if I can at all help it.

Lucky I saw this!!

I do have one reservation though -- many of our students come in with a weaker mathematical background than MIT students; for example we spent several weeks doing proofs by induction (and no other kinds of proofs) and this text doesn't seem to feature a couple of weeks worth of examples.

I think I'll probably go with this and supplement as needed. Really it looks quite wonderful. (And hell, the book seems to be open source which would mean that I could potentially write supplmentary material directly into the book and make my version available publicly as well.)

This thread seems like a particularly good place to solicit advice: experiences with this book or others, what you wished you'd learned in your own undergraduate course on this subject, etc. I've taught this course once before -- I feel I did quite well but I still have room to improve. Thanks!


I recommend learning discrete mathematics, then data structures and algorithms.

I cannot stress enough how important mathematical foundations is. It'll make everything else much easier to learn. I haven't read the book but heard good things about: as a beginner text.

Coursera has multiple offerings on Data Structures / Algorithms -- find one that works best for you.

For instance:

By doing all of those you'll get a good introductory exposure to the topics.

You should also look at a rigorous course offering of Algorithms. MIT has a few online to view.

Some readings for a beginner are: (not beginner level but classic)

After all of this you should be fine with diving into interview books. You'll want to whiteboard solutions and be able to do all the difficult problems. Look into sites like leetcode, glassdoor and be able to do the difficult problems posted there.

bitchy · 2016-09-05 · Original thread
These books will kick your teeth in if you're not prepared. You either get a teacher who'll hold your hand or you need to gear up for fight(develop math maturity and learn all the tricks and tips). To the latter end, you can check out the Book of Proof by Richard Hammack[0] and Discrete Math by Susanna Epp[1].



impendia · 2014-09-12 · Original thread
Would somebody please disrupt the textbook publishing industry?

$264.39, for students that work part time jobs at $7.00 an hour (before taxes).

Not only students are angry about this. Professors are angry, and authors are angry too. Bitter fights between professors and publishers are common.

Everybody wants to see the big players in this industry fail. Please, someone, make it happen.

phillmv · 2012-02-15 · Original thread
Well… it depends on the paper! Some stuff might need more than a single course of background to fully understand.

For more rudimentary papers, any undergrad course on discrete mathematics should get you started. I personally was forced to read - and it's pretty decent.

Get dozens of book recommendations delivered straight to your inbox every Thursday.