Każdy sprzedawca w empik.com jest przedsiębiorcą. Wszystkie obowiązki związane z umową sprzedaży ciążą na sprzedawcy.
Dodaj ten produkt do jednej z utworzonych przez Ciebie list i zachowaj go na później.
Sprawdź jak złożyć zamówienie krok po kroku.
Możesz też zadzwonić pod numer +48 22 462 72 50 nasi konsultanci pomogą Ci złożyć zamówienie.
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.
ID produktu: | 1098243036 |
Tytuł: | A Path to Combinatorics for Undergraduates |
Autor: | Andreescu Titu , Feng Zuming |
Wydawca: | Birkhauser Boston , Birkhuser Boston |
Język wydania: | english |
Ilość stron: | 252 |
Numer wydania: | CC |
Rok wydania: | 2003 |
Forma: | książka |
Okładka: | miękka |
Wymiary [mm]: | 13 x 229 x 152 |
Indeks: | 32239003 |
ocen
Podziel się na Facebooku
Właśnie zrecenzowałem A Path to Combinatorics for Undergraduates
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 ...