by Yao Zhang (Hunan Normal University, P R China)

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.

• Counting Principles and Counting Formulas
• Pigeonhole Principles and Mean Value Principles
• Generating Functions
• Recurrence Sequence of Numbers
• Classification and Method of Fractional Steps
• Corresponding Method
• Counting in Two Ways
• Recurrence Method
• Coloring Method and Evaluation Method
• Proof by Contradiction and Extreme Principle
• Locally Adjusted Method
• Constructive Method
• Combinatorial Counting Problems
• Existence Problems and the Proof of Inequalities in Combinatorial Problems
• Combinatorial Extremum Problems