000 | 02759cam a2200385Mi 4500 | ||
---|---|---|---|
001 | on1285170197 | ||
003 | OCoLC | ||
005 | 20240726104844.0 | ||
008 | 211113s2021 nyu o ||| 0 eng d | ||
040 |
_aEBLCP _beng _erda _cEBLCP _dNT |
||
020 |
_a9781685072971 _q((electronic)l(electronic)ctronic) |
||
050 | 0 | 4 |
_aQA164 _b.C663 2021 |
049 | _aMAIN | ||
100 | 1 |
_aPerestyuk, Mykola, _e1 |
|
245 | 1 | 0 |
_aCombinatorics _bfirst steps. _c |
300 | _a1 online resource (352 pages). | ||
336 |
_atext _btxt _2rdacontent |
||
337 |
_acomputer _bc _2rdamedia |
||
338 |
_aonline resource _bcr _2rdacarrier |
||
347 |
_adata file _2rda |
||
490 | 1 | _aComputational Mathematics and Analysis | |
500 | _aDescription based upon print version of record. | ||
504 | _a2 | ||
505 | 0 | 0 |
_aIntro -- _tCOMBINATORICSFIRST STEPS -- _tCOMBINATORICSFIRST STEPS -- _tContents -- _tPreface -- _tIntroduction -- _tChapter 1Elementary Enumerations ofCombinations -- _t1. What is Combinatorics? -- _tProblems -- _t2. Combinatorial Rule of Product -- _tProblems -- _t3. Bijection. Combinatorial Bijection Principle -- _tProblems -- _t4. Recurrence -- _t4.1. Sequences -- _t4.2. Definition of a Sequence by a Recurrence Relation -- _t4.3. Relation between Recursive and Direct Formulas -- _t4.4. Recurrence Relations in Combinatorial Problems -- _tProblems -- _tChapter 2Basic Concepts of Set Theory -- _t1. Sets -- _t1.1. The Notion of a Set |
505 | 0 | 0 |
_a1.2. Subsets -- _t1.3. Intersection -- _t1.4. Union -- _t1.5. Difference -- _t1.6. Complement -- _t1.7. Cartesian Product -- _t2. Correspondence -- _t2.1. Mapping -- _tProblems -- _tChapter 3Basic Combinatorial Structures -- _t1. Order. Permutations -- _t2. Tuples -- _t3. Subsets -- _t4. Numbers Ckn: Combinatorial and Computational Aspects -- _tProblems -- _t5. Properties of Binomial Coefficients Ck -- _tProblems -- _t6. Raising Binomials to Powers. Newton's Binomial Formula -- _tProblems -- _tChapter 4Paths in a Rectangle -- _tProblems -- _tChapter 5Inclusion-Exclusion Principle -- _tProblems -- _tChapter 6Trajectories Inside a Circle |
505 | 0 | 0 |
_a1. Zigzags in a Circle without Self-Intersections -- _t2. Trajectories in a Circle with Self-Intersections -- _tProblems -- _tChapter 7Trees -- _tProblems -- _tAUTHORS'CONTACT INFORMATION -- _tINDEX -- _tBlank Page -- _tBlank Page |
530 |
_a2 _ub |
||
650 | 0 | _aCombinatorial analysis. | |
655 | 1 | _aElectronic Books. | |
700 | 1 |
_aVyshenskyi, Volodymyr, _e1 |
|
856 | 4 | 0 |
_zClick to access digital title | log in using your CIU ID number and my.ciu.edu password. _uhttpss://search.ebscohost.com/login.aspx?direct=true&scope=site&db=nlebk&db=nlabk&AN=3066034&site=eds-live&custid=s3260518 |
942 |
_cOB _D _eEB _hQA _m2021 _QOL _R _x _8NFIC _2LOC |
||
994 |
_a92 _bNT |
||
999 |
_c80614 _d80614 |
||
902 |
_a1 _bCynthia Snell _c1 _dCynthia Snell |