Mathematica 9 is now available

Wolfram Library Archive

Courseware Demos MathSource Technical Notes
All Collections Articles Books Conference Proceedings

Discrete Mathematics: An Introduction to Proofs and Combinatorics

Kevin Ferland
Book information

Publisher: Houghton Mifflin (Boston)
Copyright year: 2009
ISBN: 9780618415380
Medium: Hardcover
Pages: 630
Out of print?: N
Buy this book
Book cover image

Representing Numbers | Proofs | Logic and Sets | Basic Proof Writing | Elementary Number Theory | Indexed by Integers | Relations | Combinatorics | Basic Counting | More Counting | Basic Graph Theory | Graph Properties | Trees and Algorithms

Discrete Mathematics combines a balance of theory and applications with mathematical rigor and an accessible writing style. The author uses a range of examples to teach core concepts, while corresponding exercises allow students to apply what they learn. Throughout the text, engaging anecdotes and topics of interest inform as well as motivate learners. The text is ideal for one- or two-semester courses and for students who are typically mathematics, mathematics education, or computer science majors. Part I teaches student how to write proofs; Part II focuses on computation and problem solving. The second half of the book may also be suitable for introductory courses in combinatorics and graph theory.

*Mathematics > Discrete Mathematics
*Mathematics > Discrete Mathematics > Combinatorics
*Mathematics > Discrete Mathematics > Graph Theory
*Mathematics > Number Theory

Archimedean principle, Proofs, Number theory, Algorithms, Graph theory, Counting orbits, Divisibility