Description This fifth edition of Discrete and Combinatorial Mathematics: An Applied Introductioncontinues to improve on the features that have made it themarket leader. The text is flexibly organized, enabling instructorsto adapt the book to their particular courses. Excellent exercise sets allow students to perfect skillsthrough practice. This new edition continues to feature variouscomputer science applications, making this the ideal text forpreparing students for advanced study. Historical reviews and biographies bring a human element to their assignments. Chapter summaries allow students to review what they have learned. Expanded treatment of discrete probability in Chapter 3. New material on cryptology, private-key cryptosystems in Chapter 13, public-key RSA cryptosystems in Chapter 15. Fundamental Principles of Counting Fundamentals of Logic Set theory Properties of the integers:Mathematical Induction Relations and Functions Language:Finite State Machines Relations:The Second Time Around The Principle of Inclusion and Exclusion Generating Functions Recurrence Relations An introduction to graph theory Trees Rings and modular arithmetic Boolean algebra and switching functions Algebraic structures,semigroups,monoids,groups,coding theory and polya's method of enumeration Finite fields and combinatorial designs Solved Question Papers
This book is amazing. It aroused in me a love of discrete mathematics. It has great coverage of combinatorics, set theory, graph theory, finite state machines. The examples are great although they jump from basic to advanced pretty rapidly. I'm a math major, and this has been my favorite textbook. I wish I could use it for a few more classes.h
Чудесно и пълно въведение в темата представено предимно със задачи. За мен беше добро допълнение към неделните сутрешни кафета с цигара, по-добро за събуждане от кръстословица или роман. Не ми хареса, че на особено гадните задачи не са дадени отговори и няколко от тях са ме мъчили по повече от седмица.