9780817643171-0817643176-102 Combinatorial Problems

102 Combinatorial Problems

ISBN-13: 9780817643171
ISBN-10: 0817643176
Edition: 2003
Author: Titu Andreescu, Zuming Feng
Publication date: 2002
Publisher: Birkhäuser
Format: Paperback 128 pages
FREE US shipping on ALL non-marketplace orders
Rent
35 days
from $45.95 USD
FREE shipping on RENTAL RETURNS
Marketplace
from $65.86 USD
Buy

From $19.50

Rent

From $45.95

Book details

ISBN-13: 9780817643171
ISBN-10: 0817643176
Edition: 2003
Author: Titu Andreescu, Zuming Feng
Publication date: 2002
Publisher: Birkhäuser
Format: Paperback 128 pages

Summary

102 Combinatorial Problems (ISBN-13: 9780817643171 and ISBN-10: 0817643176), written by authors Titu Andreescu, Zuming Feng, was published by Birkhäuser in 2002. With an overall rating of 3.9 stars, it's a notable title among other Pure Mathematics (Schools & Teaching, Mathematics) books. You can easily purchase or rent 102 Combinatorial Problems (Paperback) from BooksRun, along with many other new and used Pure Mathematics books and textbooks. And, if you're looking to sell your copy, our current buyback offer is $2.68.

Description

"102 Combinatorial Problems" consists of carefully selected problems that have been used in the training and testing of the USA International Mathematical Olympiad (IMO) team. Key features: * Provides in-depth enrichment in the important areas of combinatorics by reorganizing and enhancing problem-solving tactics and strategies * Topics include: combinatorial arguments and identities, generating functions, graph theory, recursive relations, sums and products, probability, number theory, polynomials, theory of equations, complex numbers in geometry, algorithmic proofs, combinatorial and advanced geometry, functional equations and classical inequalities The book is systematically organized, gradually building combinatorial skills and techniques and broadening the student's view of mathematics. Aside from its practical use in training teachers and students engaged in mathematical competitions, it is a source of enrichment that is bound to stimulate interest in a variety of mathematical areas that are tangential to combinatorics.

Rate this book Rate this book

We would LOVE it if you could help us and other readers by reviewing the book