*Mathematics | Program Guide: Discrete Mathematics

What is the maximum number of pizza slices one can get by making four straight cuts through a circular pizza? How does a computer determine the best set of pixels to represent a straight line on a computer screen? How many people at a minimum does it take to guard an art gallery? Discrete mathematics has the answer to these-and many other-questions of picking, choosing, and shuffling. Michael takes a different perspective in tackling each of eight problems and explains them in differing degrees of generality, showing in the process how the same mathematical concepts appear in varied guises and contexts. In doing so, he imparts a broader understanding of the ideas underlying discrete mathematics and helps readers appreciate and understand mathematical thinking and discovery. This book explains the basic concepts of discrete mathematics and demonstrates how to apply them in largely nontechnical language.

This book explains this challenging topic in an effective and enlightening way.You will learn about logic, proofs, functions, matrices, sequences, series, and much more. Concise explanations, real-world examples, and worked equations make it easy to understand the material, and end-of-chapter exercises and a final exam help reinforce learning. Includes numerous figures to illustrate key concepts; sample problems with worked solutions; coverage of set theory, graph theory, and number theory; chapters on cryptography and Boolean algebra; a time-saving approach to performing better on an exam or at work. Simple enough for a beginner, but challenging enough for an advanced student

About the Book: The book Fundamental Approach to Discrete Mathematics is a required part of pursuing a computer science degree at most universities. It provides in-depth knowledge to the subject for beginners and stimulates further interest in the topic