Pearls of Discrete Mathematics

Regular price €80.99
Quantity:
In stock with our UK publisher. 14-28 days
Delivery/Collection within 10-20 working days
14 days return policy Shipping & Delivery
A01=Martin Erickson
advanced mathematical proofs
algorithmic problem solving
Author_Martin Erickson
Avoidance Game
Binary Strings
binomial
Binomial Coefficients
Binomial Series
Binomial Theorem
Bipartite Graphs
Bonferroni Inequalities
BSC
Category=PBD
coefficient
combinatorial analysis
Complete Graph
discrete mathematics problem solutions
discrete probability theory
eq_isMigrated=1
eq_isMigrated=2
eq_nobargain
Fibonacci
Fibonacci Numbers
Fibonacci Sequence
Form 4k
formula
game theory applications
Gcd
identity
integer sequences
Linear Recurrence Relation
Markov Source
Nonnegative Integers
Nth Fibonacci Number
Odd
pascal's
Pascal's Identity
Pascal's Triangle
positive
Professor Bumble
Ramsey Number
recurrence
Recurrence Formula
Recurrence Relation
relation
triangle

Product details

  • ISBN 9781439816165
  • Weight: 385g
  • Dimensions: 156 x 234mm
  • Publication Date: 16 Sep 2009
  • Publisher: Taylor & Francis Inc
  • Publication City/Country: US
  • Product Form: Paperback
Secure checkout Fast Shipping Easy returns

Methods Used to Solve Discrete Math Problems
Interesting examples highlight the interdisciplinary nature of this area

Pearls 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 relationship of these structures to algebra, geometry, number theory, and combinatorics.

Each chapter begins with a mathematical teaser to engage readers and includes a particularly surprising, stunning, elegant, or unusual result. The author covers the upward extension of Pascal’s triangle, a recurrence relation for powers of Fibonacci numbers, ways to make change for a million dollars, integer triangles, the period of Alcuin’s sequence, and Rook and Queen paths and the equivalent Nim and Wythoff’s Nim games. He also examines the probability of a perfect bridge hand, random tournaments, a Fibonacci-like sequence of composite numbers, Shannon’s theorems of information theory, higher-dimensional tic-tac-toe, animal achievement and avoidance games, and an algorithm for solving Sudoku puzzles and polycube packing problems. Exercises ranging from easy to challenging are found in each chapter while hints and solutions are provided in an appendix.

With over twenty-five years of teaching experience, the author takes an organic approach that explores concrete problems, introduces theory, and adds generalizations as needed. He delivers an absorbing treatment of the basic principles of discrete mathematics.

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

More from this author