This book and its solution were designed for an introductory course in Discrete Mathematics, the prerequisites of formal mathematics are minimal; no calculation is required. There are no requirements of computer science. The book includes examples, exercises, figures, tables, problem solving sections, sections containing suggestions for problem solving, review sections, notes, chapter review, self-assessments, and computer exercises to help the student to master discrete mathematics.
This edition, like the previous ones, includes topics like algorithms, combinatorics, sets, functions and mathematical induction to cover the needs of these groups. It also takes into account the understanding and construction of evidence and, in general, the reinforcement of mathematic maturity.