Math 232 - Discrete Math Notes 2.1 Direct Proofs and Counterexamples Axiom: Proposition that is assumed to be true. Proof: A logical argument establishing the truth of the theorem given the truth of the axioms.
Hello, r/learnmath, you're looking hot today.
I'm a junior college student preparing for what will undoubtedly be the most difficult semester of my undergraduate career. More closely related to my issue, I'm set to take a course on discrete math aimed at computer scientists. See, I don't think the material will be too challenging, but my professor will be. This class is notorious at my university for being the one that everyone just does their best not to fail because of the professor's teaching style and test-writing abilities. I wish to excel in this course, for I've always had an interest in this kind of math, but I've had no idea where to start. I've tried multiple times to take a crack at Concrete Mathematics with little effect, felt like I was missing something. Irrelevant.
I was thinking of posting the syllabus, asking what you would recommend when it comes to learning these particular topics in a preferably but not necessarily free format. Then, I'll lurk around this sub and try and help people out with math whenever I can to pay you back for your kindnesses.
Anyway.
We are recommended Discrete Mathematics by Ensley and Crawley. I have no idea if this book is any good, but I do know the professor uses it a lot. We will be focusing on chapters 1-7, if anyone happens to have the book.
Syllabus:
Logic and proofs, induction
Sets, Boolean algebra, functions, relations, recursion
Algorithms and analysis, graphs, trees
Elementary number theory and cryptography
Counting methods, permutations, combinations, finite probability
Recurrence relations
I have no idea why he formatted it this way, but there you go.
Expected learning outcomes:
Analyze logical expressions and demonstrate ability to apply proof technique
Construct and analyze functions and relations, including equivalence relations
Design and analyze algorithms, with applications to graphs and trees
Apply basic number theory to the design of cryptography systems
Apply counting techniques to compute finite probabilities
Solve recurrence relations and apply recurrence to the analysis of algorithms.
I realize my best bet may be to just grab the textbook as soon as possible and just have at it, but I received a copy of this semester's syllabus from a friend about 20 minutes ago, and I probably won't be able to get the book for quite a while with Christmas this close around the corner.
I don't have a particular fondness for any medium be they videos, books, or otherwise. Anything is welcome, as long as I can access it now-ish.
Discrete Mathematics Pdf
Thanks in advance, m8s.