Note: This is the 3rd edition. If you need the 2nd edition for a course you are taking, it can be found as a "other format" on amazon, or by searching its isbn: 1534970746 This gentle introduction to discrete mathematics is written for first and second year math majors, especially those who intend to teach. The text began as a set of lecture notes for the discrete mathematics course at the University of Northern Colorado. This course serves both as an introduction to topics in discrete math and as the "introduction to proof" course for math majors. The course is usually taught with a large amount of student inquiry, and this text is written to help facilitate this. Four main topics are covered: counting, sequences, logic, and graph theory. Along the way proofs are introduced, including proofs by contradiction, proofs by induction, and combinatorial proofs. The book contains over 470 exercises, including 275 with solutions and over 100 with hints. There are also Investigate! activities throughout the text to support active, inquiry based learning. While there are many fine discrete math textbooks available, this text has the following advantages: It is written to be used in an inquiry rich course. It is written to be used in a course for future math teachers. It is open source, with low cost print editions and free electronic editions. This third edition brings improved exposition, a new section on trees, and a bunch of new and improved exercises. For a complete list of changes, and to view the free electronic version of the text, visit the book's website at discrete.openmathbooks.org
Praise for the German edition ... This book is a well-written introduction to discrete mathematics and is highly recommended to every student ofmathematics and computer science as well as to teachers of these topics.
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.
This concise, undergraduate-level text focuses on combinatorics, graph theory with applications to some standard network optimization problems, and algorithms. More than 200 exercises, many with complete solutions. 1991 edition.
This books gives an introduction to discrete mathematics for beginning undergraduates. One of original features of this book is that it begins with a presentation of the rules of logic as used in mathematics.
Applications are included throughout the text and are sourced from a variety of disciplines, including biology, economics, music, and more.
This new edition includes new chapters on statements and proof, logical framework, natural numbers and the integers and updated exercises from the previous edition.
Discrete Mathematics and its Applications, Sixth Edition, is intended for one- or two-term introductory discrete mathematics courses taken by students from a wide variety of majors, including computer science, mathematics, and engineering.
Some of these topics include: Mathematical and structural induction Set theory Combinatorics Functions, relations, and ordered sets Boolean algebra and Boolean functions Graph theory Introduction to Discrete Mathematics via Logic and Proof ...
Graph study is discussed, including Euler and Hamilton cycles and trees. This is a vehicle for some easy proofs, as well as serving as another example of a data structure. Matrices and vectors are then defined.
The book is designed as an accessible introduction for students in mathematics or computer science as it explores questions that test the understanding of proof strategies, such as mathematical induction.