Discrete Mathematics
Title | Discrete Mathematics PDF eBook |
Author | Oscar Levin |
Publisher | Createspace Independent Publishing Platform |
Pages | 342 |
Release | 2016-08-16 |
Genre | |
ISBN | 9781534970748 |
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 360 exercises, including 230 with solutions and 130 more involved problems suitable for homework. 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.
Discrete Mathematics
Title | Discrete Mathematics PDF eBook |
Author | Norman Biggs |
Publisher | Oxford University Press |
Pages | 444 |
Release | 2002-12-19 |
Genre | Computers |
ISBN | 9780198507178 |
Discrete mathematics is a compulsory subject for undergraduate computer scientists. 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 Optimization Algorithms
Title | Discrete Optimization Algorithms PDF eBook |
Author | Maciej M. Sys?o |
Publisher | Courier Corporation |
Pages | 564 |
Release | 2006-01-01 |
Genre | Computers |
ISBN | 0486453537 |
Rich in publications, the well-established field of discrete optimization nevertheless features relatively few books with ready-to-use computer programs. This book, geared toward upper-level undergraduates and graduate students, addresses that need. In addition, it offers a look at the programs' derivation and performance characteristics. Subjects include linear and integer programming, packing and covering, optimization on networks, and coloring and scheduling. A familiarity with design, analysis, and use of computer algorithms is assumed, along with knowledge of programming in Pascal. The book can be used as a supporting text in discrete optimization courses or as a software handbook, with twenty-six programs that execute the most common algorithms in each topic area. Each chapter is self-contained, allowing readers to browse at will.
Discrete Mathematics with Applications, Metric Edition
Title | Discrete Mathematics with Applications, Metric Edition PDF eBook |
Author | Susanna Epp |
Publisher | |
Pages | 984 |
Release | 2019 |
Genre | |
ISBN | 9780357114087 |
DISCRETE MATHEMATICS WITH APPLICATIONS, 5th Edition, Metric Edition explains complex, abstract concepts with clarity and precision and provides a strong foundation for computer science and upper-level mathematics courses of the computer age. Author Susanna Epp presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. Students develop the ability to think abstractly as they study the ideas of logic and proof. While learning about such concepts as logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography and combinatorics, students discover that the ideas of discrete mathematics underlie and are essential to today's science and technology.
Discrete Mathematics with Ducks
Title | Discrete Mathematics with Ducks PDF eBook |
Author | Sarah-marie Belcastro |
Publisher | CRC Press |
Pages | 733 |
Release | 2018-11-15 |
Genre | Mathematics |
ISBN | 1351683683 |
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
Discrete Choice Methods with Simulation
Title | Discrete Choice Methods with Simulation PDF eBook |
Author | Kenneth Train |
Publisher | Cambridge University Press |
Pages | 346 |
Release | 2003-01-13 |
Genre | Business & Economics |
ISBN | 9780521017152 |
Table of contents
Discrete Mathematics
Title | Discrete Mathematics PDF eBook |
Author | Martin Aigner |
Publisher | American Mathematical Society |
Pages | 402 |
Release | 2023-01-24 |
Genre | Mathematics |
ISBN | 1470470632 |
The advent of fast computers and the search for efficient algorithms revolutionized combinatorics and brought about the field of discrete mathematics. This book is an introduction to the main ideas and results of discrete mathematics, and with its emphasis on algorithms it should be interesting to mathematicians and computer scientists alike. The book is organized into three parts: enumeration, graphs and algorithms, and algebraic systems. There are 600 exercises with hints and solutions to about half of them. The only prerequisites for understanding everything in the book are linear algebra and calculus at the undergraduate level. Praise for the German edition… This book is a well-written introduction to discrete mathematics and is highly recommended to every student of mathematics and computer science as well as to teachers of these topics. —Konrad Engel for MathSciNet Martin Aigner is a professor of mathematics at the Free University of Berlin. He received his PhD at the University of Vienna and has held a number of positions in the USA and Germany before moving to Berlin. He is the author of several books on discrete mathematics, graph theory, and the theory of search. The Monthly article Turan's graph theorem earned him a 1995 Lester R. Ford Prize of the MAA for expository writing, and his book Proofs from the BOOK with Günter M. Ziegler has been an international success with translations into 12 languages.