A Path to Combinatorics for Undergraduates :Counting Strategies

4.14 ( 21 Ratings by Goodreads)
A Path to Combinatorics for Undergraduates

A Path to Combinatorics for Undergraduates :Counting Strategies

4.14 (21 Ratings by Goodreads)
paperback
Published: 11 November, 2003
Standard worldwide delivery by Thu, July 16 - Tue, July 21
Order within 0
Condition: NEW
$96.38
Price includes shipping
Available 20+ in stock
- +
FREE Returns within 30 days

Description

The main goal of the two authors is to help undergraduate students understand the concepts and ideas of combinatorics, an important realm of mathematics, and to enable them to ultimately achieve excellence in this field. This goal is accomplished by familiariz­ ing students with typical examples illustrating central mathematical facts, and by challenging students with a number of carefully selected problems. It is essential that the student works through the exercises in order to build a bridge between ordinary high school permutation and combination exercises and more sophisticated, intricate, and abstract concepts and problems in undergraduate combinatorics. The extensive discussions of the solutions are a key part of the learning process. The concepts are not stacked at the beginning of each section in a blue box, as in many undergraduate textbooks. Instead, the key mathematical ideas are carefully worked into organized, challenging, and instructive examples. The authors are proud of their strength, their collection of beautiful problems, which they have accumulated through years of work preparing students for the International Math­ ematics Olympiads and other competitions. A good foundation in combinatorics is provided in the first six chapters of this book. While most of the problems in the first six chapters are real counting problems, it is in chapters seven and eight where readers are introduced to essay-type proofs. This is the place to develop significant problem-solving experience, and to learn when and how to use available skills to complete the proofs.
See more

More Details

Type Book
ISBN13 9780817642884
ISBN10 0817642889
Number Of Pages 228
Item Weight 1000 g
Publisher / Reseller Birkhauser Boston
Format paperback
Edition 2004 ed.
See More +

Media Reviews

From the reviews:

"A good foundation in combinatorics is provided in the early chapters that cover ideas in combinatorial geometry…. This book serves as a solid stepping stone for more advanced combinatorics studies in related mathematical science fields or in computer science."

— L'Enseignement Mathématique

"This book is an introduction to counting strategies in combinatorial theory. The main mathematical ideas are carefully worked into organized, challenging, and instructive examples given in the nine chapters of this book. In the last chapter we find 111 problems (without solutions). The greater part of them are from various mathematical contests. The…experience of the authors in preparing students for various mathematical competitions allowed them to present a big collection of beautiful problems. By studying this book, undergraduates will be well-equipped to further their knowledge in more abstract combinatorics and its related fields."

—MAA Online

"...the book provides quite an amazing collection of combinatorial problems, many of them original, and many of them from a hard to find sources like Russian olympiads. (...) The presentation of the solutions is very clear and instructive, with emphasis on common mistakes."

—Mathematics Bohemica

"The goal of the book is to explain the main concepts and ideas of combinatorics to undergraduate students. Extremely helpful is the extensive use of examples for explanation purposes, which makes this book so pleasant to read. All the ideas and problems are addressed by giving rich examples, and what is even more, each example is solved in high detail immediately after it is posed. … So it is highly recommended to read everything in the book." (Simon Seichter, Simulation News Europe, Vol. 16 (1), 2006)

Show more

GoodReads Reviews