Combinatorial problems in mathematical competitions

Author(s)

    • Zhang, Yao

Bibliographic Information

Combinatorial problems in mathematical competitions

Yao Zhang

(Mathematical Olympiad series / series editors, Lee Peng Yee, Xiong Bin, 4)

World Scientific, c2011

  • : pbk

Available at  / 2 libraries

Search this Book/Journal

Description and Table of Contents

Description

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.

Table of Contents

  • 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.

by "Nielsen BookData"

Related Books: 1-1 of 1

Details

  • NCID
    BB06482018
  • ISBN
    • 9789812839497
  • Country Code
    si
  • Title Language Code
    eng
  • Text Language Code
    eng
  • Place of Publication
    Singapore
  • Pages/Volumes
    xii, 289 p.
  • Size
    23 cm
  • Classification
  • Subject Headings
  • Parent Bibliography ID
Page Top