Description

Book Synopsis
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.

Combinatorial Problems In Mathematical

Product form

£26.60

Includes FREE delivery

RRP £28.00 – you save £1.40 (5%)

Order before 4pm today for delivery by Mon 12 Jan 2026.

A Paperback / softback by Yao Zhang

1 in stock


    View other formats and editions of Combinatorial Problems In Mathematical by Yao Zhang

    Publisher: World Scientific Publishing Co Pte Ltd
    Publication Date: 10/03/2011
    ISBN13: 9789812839497, 978-9812839497
    ISBN10: 9812839496

    Description

    Book Synopsis
    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.

    Recently viewed products

    © 2026 Book Curl

      • American Express
      • Apple Pay
      • Diners Club
      • Discover
      • Google Pay
      • Maestro
      • Mastercard
      • PayPal
      • Shop Pay
      • Union Pay
      • Visa

      Login

      Forgot your password?

      Don't have an account yet?
      Create account