Pearls of Discrete Mathematics

by Martin Erickson

Overview

Methods Used to Solve Discrete Math ProblemsInteresting examples highlight the interdisciplinary nature of this areaPearls of Discrete Mathematics presents methods for solving counting problems and other types of problems that involve discrete structures. Through intriguing examples, problems, theorems, and proofs, the book illustrates the relation

Product Details

ISBN-13:	9781439857588
Publisher:	CRC Press
Publication date:	09/16/2009
Series:	Discrete Mathematics and Its Applications
Sold by:	Barnes & Noble
Format:	eBook
Pages:	280
File size:	3 MB

About the Author

Martin Erickson is a professor of mathematics at Truman State University.

Table of Contents

Counting: Basic. Counting: Intermediate. Counting: Advanced. Discrete Probability. Number Theory. Information Theory. Games. Algorithms. Appendices. Bibliography. Index.

Editorial Reviews

…this book will remind you why you think mathematics is fun. … the real strengths of this text would be self-study for the motivated student or a source of interesting examples for a more traditional course in various areas of discrete mathematics. … The motivated student will learn much new mathematics if they work through this book carefully. For a student curious about exactly which topics make up the field of discrete mathematics, a more cursory trip through this book will do a good job of answering the question. For the library with a collection in recreational mathematics, this book will serve as a nice bridge to the ‘more serious’ associated areas of mathematics. And finally, for the professional mathematician, using this book as bedtime reading just might remind you of why you found math fun in the first place.
—Robert A. Beezer, University of Puget Sound, SIAM Review, Vol. 52, Issue 3, 2010

The book will be beneficial to many undergraduates in mathematics. In fact, many sections are within reach of some advanced high school students who would like to explore interesting topics in mathematics. … Summing Up: Recommended.
—CHOICE, April 2010, Vol. 47, No. 08

The book under review is a friendly volume in discrete mathematics, which covers various classical topics, such as counting, probability and number theory, and more recent topics, such as information theory, game theory and algorithms. As far as I know, this book is one of only a few at this level that covers such recent topics. Because it covers algorithms, … the book may be interesting for students interested in computer programming. … This is essentially a textbook for undergraduates, and perhaps it can be useful for high school students as well. … because of the variety of topics, teachers will have many choices of what to cover for students in applied fields. …
—Mehdi Hassani, MAA Reviews, December 2009

From the Publisher