Discrete Mathematics: Mathematical Reasoning and Proof with Puzzles, Patterns, and GamesDid you know that games and puzzles have given birth to many of today’s deepest mathematical subjects? Now, with Douglas Ensley and Winston Crawley’s Introduction to Discrete Mathematics, you can explore mathematical writing, abstract structures, counting, discrete probability, and graph theory, through games, puzzles, patterns, magic tricks, and real-world problems. You will discover how new mathematical topics can be applied to everyday situations, learn how to work with proofs, and develop your problem-solving skills along the way. Online applications help improve your mathematical reasoning. Improve your grade with the Student Solutions Manual. |
Other editions - View all
Common terms and phrases
a₁ adjacency matrix algorithm answer arrow diagram binary sequences binary tree Boolean algebra cards checked closed formula codomain column conclude contrapositive counterexample defined definition digits divisible domain elements entry equation equivalent Eulerian Eulerian circuit exactly Example Exercise F F F false given graph G Hamiltonian cycle Hence induction integer inverse Karnaugh map length mathematical mathematical induction means natural number negation node notation one-to-one ordered list outcomes pigeonhole principle planar graph player positive integer possible Practice Problem predicate Prob(E1 Prob(X probability proof by contradiction properties Proposition prove puzzle R₁ R₂ rational number real numbers recurrence relation recursive reflexive result rule Section shown in Figure simple Solutions to Practice statement P(m subset subtree Theorem transitive true truth table vertex vertices walk write