Combinatorial problems in mathematical competitions (Mathematical Olympiad series, Vol. 4)

This book focuses on combinatorial problems in mathematical competitions. It provides basic knowledge on how to solve combinatorial problems in mathematical competitions, and also introduces important solutions to combinatorial problems and some typical problems with often-used solutions. Some enlightening and novel examples and exercises are well chosen in this book. With this book, readers can explore, analyze and summarize the ideas and methods of solving combinatorial problems. Their mathematical culture and ability will be improved remarkably after reading this book.

Fundamental Knowledge: Principles and Formulas of Counting. Pigeonhole Principle and Mean Value Principle. The Generating Functions. Recurrence Sequence of Numbers. Basic Method: Classification and Method of Fractional Steps. Correspondent Method. Counting in Two Ways. Recurrence Method. Coloring Method and Evaluation Method. Reduction to Absurdity and the Extreme Principle. Local Adjustment Method. Constructive Method. Typical Problems: Combinatorial Counting Problems. Existence Problems and the Proof of Inequalities in Combinatorial Problems. Combinatorial Extremum Problems.