Counting and Configurations

Problems in Combinatorics, Arithmetic, and Geometry

Jiri Herman, Radan Kucera, Jaromir Simsa

402 pages, parution le 18/02/2003

Ajouter à une liste

Indisponible

Résumé

This book presents methods of solving problems in classical combinatorics, combinatorial number theory, and combinatorial geometry. It can be seen as a continuation of the successful book "Equations and Inequalities" by the same authors. However, it can be read independently or used as a textbook in its own right.

The authors' aim is to familiarize the reader with methods for solving problems in elementary mathematics, accessible to beginning university and advanced high-school students. They emphasize basic algebraic operations and other technical skills that are reinforced in numerous examples and exercises. Answers to all exercises can be found at the end of the book.

The book is intended as a text for a problem-solving course at the first- or second-year university level, as a text for enrichment classes for talented high-school students, or for mathematics competition training.

Contents

Combinatorics

Fundamental Rules
Standard Concepts
Problems with Boundary Conditions
Distributions into Bins
Proving Identities
The Inclusion-Exclusion Principle
Basics of Polya's Theory of Enumeration
Recursive Methods

Combinatorial Arithmetic

Arrangements
Sequences
Arrays
Unordered Configurations
Iterations

Combinatorial Geometry

Systems of Points and Curves
Systems of Curves and Regions
Coverings and Packings Colorings

Hints and Answers

Hints and Answers to Chapter 1
Hints and Answers to Chapter 2
Hints and Answers to Chapter 3

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Jiri Herman, Radan Kucera, Jaromir Simsa
Parution	18/02/2003
Nb. de pages	402
Format	16 x 24
Couverture	Relié
Poids	679g
Intérieur	Noir et Blanc
EAN13	9780387955520
ISBN13	978-0-387-95552-0