Vyhledávat v databázi titulů je možné dle ISBN, ISSN, EAN, č. ČNB, OCLC či vlastního identifikátoru. Vyhledávat lze i v databázi autorů dle id autority či jména.

Projekt ObalkyKnih.cz sdružuje různé zdroje informací o knížkách do jedné, snadno použitelné webové služby. Naše databáze v tuto chvíli obsahuje 2895566 obálek a 875351 obsahů českých a zahraničních publikací. Naše API využívá většina knihoven v ČR.

Registrovat »    Zapomenuté heslo?

A Path to Combinatorics for Undergraduates: Counting Strategies



Rok: 2003
ISBN: 9780817642884
OKCZID: 110971579

Citace (dle ČSN ISO 690):
ANDREESCU, Titu. A Path to Combinatorics for Undergraduates. Counting Strategies. Boston: Birkhäuser Verlag, 2004. xviii, 228 s., obr. v tex.


Anotace

 

This unique approach to combinatorics is centered around unconventional, essay-type combinatorial examples, followed by a number of carefully selected, challenging problems and extensive discussions of their solutions. Topics encompass permutations and combinations, binomial coefficients and their applications, bijections, inclusions and exclusions, and generating functions.  Each chapter features fully-worked problems, including many from Olympiads and other competitions, as well as a number of problems original to the authors; at the end of each chapter are further exercises to reinforce understanding, encourage creativity, and build a repertory of problem-solving techniques.  The authors' previous text, "102 Combinatorial Problems," makes a fine companion volume to the present work, which is ideal for Olympiad participants and coaches, advanced high school students, undergraduates, and college instructors.  The book's unusual problems and examples will interest seasoned mathematicians as well.  "A Path to Combinatorics for Undergraduates" is a lively introduction not only to combinatorics, but to mathematical ingenuity, rigor, and the joy of solving puzzles.


Dostupné zdroje

Amazon


Přidat komentář a hodnocení

Od: (127.0.0...)