Student Handbook for Discrete Mathematics with Ducks SRRSLEH

Student Handbook for Discrete Mathematics with Ducks is a Student Reference, Review, Supplemental Learning, and Example Handbook (SRRSLEH) that mirrors the content of the author’s popular textbook Discrete Mathematics with Ducks (DMwD). This handbook provides a review of key material, illustrative examples, and new problems with accompanying solutions that are helpful even for those using a traditional discrete mathematics textbook. Every chapter in SRRSLEH matches the corresponding chapter of DMwD. Chapters in SRRSLEH contain the following: A list of the notation introduced in the corresponding chapter A list of definitions that students need to know from the corresponding chapter Theorems/facts of note appearing in the corresponding chapter A list of proof techniques introduced, with templates and/or examples given for each one A selection of examples from DMwD, written out formally and briefly rather than colloquially as in DMwD A quick refresher for any discrete math student, this handbook enables students to find information easily and reminds them of the terms and results they should know during their course. Read reviews of DMwD.

THE BASICSCounting and Proofs Definitions and Notation Facts and Theorems Proof Techniques: Direct Proof and Pigeonhole TipsSome Straightforward Examples More Problems More Solutions Sets and LogicDefinitions and Notation Facts and Theorems Proof Techniques: Double-Inclusion, Biconditionals (??s), Proving the Contrapositive, and Proof by ContradictionSome Straightforward Examples More Problems More Solutions Graphs and FunctionsDefinitions and Notation Facts and Theorems Some Straightforward Examples More Problems More Solutions InductionDefinitions and Notation Facts and Theorems Proof Techniques: Induction (How Surprising!)Some Straightforward Examples More Problems More Solutions Algorithms with CiphersDefinitions and Notation Facts and Theorems Some Straightforward Examples More Problems More Solutions COMBINATORICSBinomial Coefficients and Pascal’s TriangleDefinitions and Notation Facts and Theorems Proof Techniques: Overcounting Carefully and Combinatorial ProofSome Straightforward Examples More Problems More Solutions Balls and Boxes and PIE: Counting TechniquesDefinitions and Notation Facts and Theorems Some Straightforward Examples More Problems More Solutions RecurrencesDefinitions and Notation Facts and Theorems Proof Techniques: Showing a Closed Form for a Recurrence Is CorrectSome Straightforward Examples More Problems More Solutions Cutting Up Food: Counting and GeometryDefinitions and Notation Facts and Theorems More Problems More Solutions GRAPH THEORYTreesDefinitions and Notation Facts and Theorems Some Straightforward Examples More Problems More Solutions Euler’s Formula and ApplicationsDefinitions and Notation Facts and Theorems Some Straightforward Examples More Problems More Solutions Graph TraversalsDefinitions and Notation Facts and Theorems Some Straightforward Examples More Problems More Solutions Graph ColoringDefinitions and Notation Facts and Theorems Some Straightforward Examples More Problems More Solutions OTHER MATERIALProbability and ExpectationDefinitions and Notation Facts and Theorems Some Straightforward Examples More Problems More Solutions Fun with CardinalityDefinitions and Notation Facts and Theorems Some Straightforward Examples More Problems More Solutions