Discrete Mathematics: Mathematical Reasoning and Proof with Puzzles, Patterns, and GamesThese active and well-known authors have come together to create a fresh, innovative, and timely approach to Discrete Math. One innovation uses several major threads to help weave core topics into a cohesive whole. Throughout the book the application of mathematical reasoning is emphasized to solve problems while the authors guide the student in thinking about, reading, and writing proofs in a wide variety of contexts. Another important content thread, as the sub-title implies, is the focus on mathematical puzzles, games and magic tricks to engage students. |
Contents
Mathematical Language | 1 |
A Primer of Mathematical | 81 |
Sets and Boolean Algebra | 181 |
Functions and Relations | 248 |
Probability | 440 |
Graphs and Trees | 505 |
150 | 519 |
of the Game | 613 |
Matrix Arithmetic with Technology | 620 |
| 682 | |
Other editions - View all
Common terms and phrases
2006 John Wiley a₁ adjacency matrix algorithm answer arrow diagram binary sequences binary tree Boolean algebra cards Chapter checked closed formula codomain column conclude contrapositive counterexample defined definition digits Discrete Mathematics divisible domain elements entry equation equivalent Eulerian Eulerian circuit exactly Example Exercise F F F F T F false function f given graph G Hamiltonian cycle Hence induction integer inverse Karnaugh map length 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(E probability proof by contradiction properties Proposition prove puzzle 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 write