| Description |
1 online resource (xii, 289 pages) : illustrations |
| Series |
Mathematical Oympiad series, 1793-8570 ; vol. 4 |
|
Mathematical Olympiad series ; 4.
|
| Contents |
Principles and Formulas of Counting -- 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 -- Reduction of Absurdity and the Extreme Principle -- Local Adjusted Method -- Constructive Method -- Combinatorial Counting Problems -- Existence Problems and the Proof of Inequalities in Combinatorial Problems -- Combinatorial Extremum Problems |
| Summary |
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 |
| Notes |
Print version record |
| SUBJECT |
USA Mathematical Olympiad. http://id.loc.gov/authorities/names/n97055528
|
|
U.S.A. Mathematical Olympiad fast |
| Subject |
Combinatorial analysis -- Problems, exercises, etc
|
|
MATHEMATICS -- History & Philosophy.
|
|
Combinatorial analysis
|
| Genre/Form |
exercise books.
|
|
Problems and exercises
|
|
Problems and exercises.
|
|
Problèmes et exercices.
|
| Form |
Electronic book
|
| ISBN |
9789812839503 |
|
981283950X |
|
