MAPLE THROUGH EXAMPLES. DISCRETE MATHEMATICS

Discrete mathematics studies structures whose elements can be counted individually (discrete elements), such as integers, graphs, and logical statements, which are applied in various scientific fields, primarily computer science. Discrete mathematics is fundamental to the study of computer science, since the structures it analyzes are used to model and solve real-world problems through the design and programming of both algorithms and data structures. For this reason, some scholars in this area consider discrete mathematics to be the "calculus" of computer science. It is the branch of mathematics that allows us to understand how a computer works, how we can communicate with it, and how we can solve problems through computation. Discrete mathematics includes number theory, combinatorics, mathematical logic, set theory, relations and functions, computation theory and algorithms, induction and recursion, graph theory, probability, and other subjects within the discrete field. This book explores the topic of discrete mathematics using the Maple software.