| ISBN13: | 9783031734335 |
| ISBN10: | 3031734335 |
| Kötéstípus: | Keménykötés |
| Terjedelem: | 446 oldal |
| Méret: | 235x155 mm |
| Nyelv: | angol |
| Illusztrációk: | 62 Illustrations, black & white; 43 Illustrations, color |
| 700 |
Discrete Structures
EUR 69.54
Kattintson ide a feliratkozáshoz
The aim of this text is to introduce discrete mathematics to beginning students of mathematics or computer science. It does this by bringing some coherency into the seemingly incongruent subjects that compose discrete math, such as logic, set theory, algebra, and combinatorics. It emphasizes their theoretical foundations and illustrates proofs along the way. The book prepares readers for the analysis of algorithms by discussing asymptotic analysis and a discrete calculus for sums. The book also deduces combinatorial methods from the foundations that are laid out. Unlike other texts on this subject, there is a greater emphasis on foundational material that leads to a better understanding. To further assist the reader in grasping and practicing concepts, roughly 690 exercises are provided at various levels of difficulty. Readers are encouraged to study the examples in the text and solve as many of the exercises as possible.
The text is intended for freshman or sophomore undergraduate students in mathematics, computer science, or similar majors. The assumed background is precalculus. The chapter dependency chart included is designed to help students, independent readers, and instructors follow a systematic path for learning and teaching the material, with the option to explore material in later chapters.
The aim of this text is to introduce discrete mathematics to beginning students of mathematics or computer science. It does this by bringing some coherency into the seemingly incongruent subjects that compose discrete math, such as logic, set theory, algebra, and combinatorics. It emphasizes their theoretical foundations and illustrates proofs along the way. The book prepares readers for the analysis of algorithms by discussing asymptotic analysis and a discrete calculus for sums. The book also deduces combinatorial methods from the foundations that are laid out. Unlike other texts on this subject, there is a greater emphasis on foundational material that leads to a better understanding. To further assist the reader in grasping and practicing concepts, roughly 690 exercises are provided at various levels of difficulty. Readers are encouraged to study the examples in the text and solve as many of the exercises as possible.
The text is intended for freshman or sophomore undergraduate students in mathematics, computer science, or similar majors. The assumed background is precalculus. The chapter dependency chart included is designed to help students, independent readers, and instructors follow a systematic path for learning and teaching the material, with the option to explore material in later chapters.
Preface.- Notation.- I. Discrete Structures.- 1. Introduction.-2. Mathematical Arguments.-3. Sets.- 4. Proof by Induction.- 5. Equivalence Relations.- 6. Partial Orders and Lattices.- 7. Floor and Ceiling Functions.- 8. Number Theory.- II. Summation and Asymptotics.- 10. Asymptotic Analysis.- III. Combinatorics.- 11. Counting.- 12. Generating Functions.- 13. Recurrence Relations.- 14. Graphs.- 15. Probability.- Bibliography.- Index.
