Includes bibliographical references (pages 647-648) and index.
CONTENTS NOTE
Text of Note
Counting and proofs -- Sets and logic -- Graphs and functions -- Induction -- Algorithms with ciphers -- Binomial coefficients and Pascal's triangle -- Balls and boxes and PIE: counting techniques -- Recurrences -- Cutting up food: counting and geometry -- Trees -- Euler's formula and applications -- Graph traversals -- Graph coloring -- Probability and expectation -- Fun with cardinality -- Number theory -- Computational complexity.
0
SUMMARY OR ABSTRACT
Text of Note
"Discrete Mathematics with Ducks, Second Edition is a gentle introduction for students who find the proofs and abstractions of mathematics challenging. At the same time, it provides stimulating material that instructors can use for more advanced students. The first edition was widely well received, with its whimsical writing style and numerous exercises and materials that engaged students at all levels. The new, expanded edition continues to facilitate effective and active learning. It is designed to help students learn about discrete mathematics through problem-based activities. These are created to inspire students to understand mathematics by actively practicing and doing, which helps students better retain what they've learned. As such, each chapter contains a mixture of discovery-based activities, projects, expository text, in-class exercises, and homework problems. The author's lively and friendly writing style is appealing to both instructors and students alike and encourages readers to learn. The book's light-hearted approach to the subject is a guiding principle and helps students learn mathematical abstraction. Features: The book's Try This! sections encourage students to construct components of discussed concepts, theorems, and proofs Provided sets of discovery problems and illustrative examples reinforce learning Bonus sections can be used by instructors as part of their regular curriculum, for projects, or for further study"--