Inquiry-Based Enumerative Combinatorics: One, Two, Skip a Few... Ninety-Nine, One Hundred (Undergraduate Texts in Mathematics) Hardback -
by Petersen, T. Kyle
- Used
- Good
- Hardback
Standard delivery: 7 to 14 days
Details
- Title Inquiry-Based Enumerative Combinatorics: One, Two, Skip a Few... Ninety-Nine, One Hundred (Undergraduate Texts in Mathematics)
- Author Petersen, T. Kyle
- Binding Hardback
- Condition Used - Good
- Pages 238
- Volumes 1
- Language ENG
- Publisher Springer
- Bookseller's Inventory # 3030183076.G
- ISBN 9783030183073 / 3030183076
- Weight 1.41 lbs (0.64 kg)
- Category Mathematics
- Dewey Decimal Code 511.6
- Quantity available 1
About Bonita California, United States
Reader reviews for Inquiry-Based Enumerative Combinatorics: One, Two, Skip a Few... Ninety-Nine, One Hundred (Undergraduate Texts in Mathematics)
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
From the rear cover
This textbook offers the opportunity to create a uniquely engaging combinatorics classroom by embracing Inquiry-Based Learning (IBL) techniques. Readers are provided with a carefully chosen progression of theorems to prove and problems to actively solve. Students will feel a sense of accomplishment as their collective inquiry traces a path from the basics to important generating function techniques.
Beginning with an exploration of permutations and combinations that culminates in the Binomial Theorem, the text goes on to guide the study of ordinary and exponential generating functions. These tools underpin the in-depth study of Eulerian, Catalan, and Narayana numbers that follows, and a selection of advanced topics that includes applications to probability and number theory. Throughout, the theory unfolds via over 150 carefully selected problems for students to solve, many of which connect to state-of-the-art research.
Inquiry-Based Enumerative Combinatoricsis ideal for lower-division undergraduate students majoring in math or computer science, as there are no formal mathematics prerequisites. Because it includes many connections to recent research, students of any level who are interested in combinatorics will also find this a valuable resource.