TY  - BOOK
AU  - Perestyuk,Mykola
AU  - Vyshenskyi,Volodymyr
TI  - Combinatorics: first steps
T2  - Computational Mathematics and Analysis
SN  - 9781685072971
AV  - QA164 .C663 2021
KW  - Combinatorial analysis
KW  - Electronic Books
N1  - Description based upon print version of record; 2; Intro --; COMBINATORICSFIRST STEPS --; COMBINATORICSFIRST STEPS --; Contents --; Preface --; Introduction --; Chapter 1Elementary Enumerations ofCombinations --; 1. What is Combinatorics? --; Problems --; 2. Combinatorial Rule of Product --; Problems --; 3. Bijection. Combinatorial Bijection Principle --; Problems --; 4. Recurrence --; 4.1. Sequences --; 4.2. Definition of a Sequence by a Recurrence Relation --; 4.3. Relation between Recursive and Direct Formulas --; 4.4. Recurrence Relations in Combinatorial Problems --; Problems --; Chapter 2Basic Concepts of Set Theory --; 1. Sets --; 1.1. The Notion of a Set; 1.2. Subsets --; 1.3. Intersection --; 1.4. Union --; 1.5. Difference --; 1.6. Complement --; 1.7. Cartesian Product --; 2. Correspondence --; 2.1. Mapping --; Problems --; Chapter 3Basic Combinatorial Structures --; 1. Order. Permutations --; 2. Tuples --; 3. Subsets --; 4. Numbers Ckn: Combinatorial and Computational Aspects --; Problems --; 5. Properties of Binomial Coefficients Ck --; Problems --; 6. Raising Binomials to Powers. Newton's Binomial Formula --; Problems --; Chapter 4Paths in a Rectangle --; Problems --; Chapter 5Inclusion-Exclusion Principle --; Problems --; Chapter 6Trajectories Inside a Circle; 1. Zigzags in a Circle without Self-Intersections --; 2. Trajectories in a Circle with Self-Intersections --; Problems --; Chapter 7Trees --; Problems --; AUTHORS'CONTACT INFORMATION --; INDEX --; Blank Page --; Blank Page; 2; b
UR  - httpss://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=3066034&site=eds-live&custid=s3260518
ER  -