| 000 | 01554nam a2200361 a 4500 | ||
|---|---|---|---|
| 008 | 2011 | ||
| 020 | _a1420082604 | ||
| 020 | _a9781420082609 | ||
| 020 |
_a9781420082609: _c£34.99 |
||
| 072 | 7 |
_aPBV _2thema |
|
| 072 | 7 |
_aPBF _2thema |
|
| 072 | 7 |
_aPBD _2thema |
|
| 082 | _a511.6 | ||
| 100 | 1 | _aAllenby, R. B. J. T. | |
| 245 | 1 | 0 |
_aHow to count : _ban introduction to combinatorics / _cR.B.J.T. Allenby, Alan Slomson. |
| 250 | _a2nd ed. | ||
| 260 |
_aBoca Raton, FL : _bCRC Press, _cc2011. |
||
| 300 |
_axv, 430 p. : _bill. ; _c27 cm. |
||
| 490 | 1 | _aDiscrete mathematics and its applications. | |
| 505 | 0 | 0 | _aWhat's it all about? -- Permutations and combinations -- Occupancy problems -- The inclusion-exclusion principle -- Stirling and Catalan numbers -- Partitions and dot diagrams -- Generating functions and recurrence relations -- Partitions and generating functions -- Introduction to graphs -- Trees -- Groups of permutations -- Group actions -- Counting patterns -- Poĺya counting -- Dirichlet's pigeonhole principle -- Ramsey theory -- Rook polynomials and matchings. |
| 590 | _a36.95 | ||
| 650 | 0 |
_aCombinatorial analysis. _92371 |
|
| 650 | 0 | _aSlomson, A. B. | |
| 650 | 0 |
_aCombinatorial analysis _vProblems, exercises, etc |
|
| 650 | 7 |
_aMathematics. _2ukslc |
|
| 650 | 7 |
_aCombinatorics & graph theory _2thema |
|
| 650 | 7 |
_aAlgebra _2thema |
|
| 650 | 7 |
_aDiscrete mathematics _2thema |
|
| 902 | _a130820 | ||
| 907 |
_a.b10432231 _bcgen _c- |
||
| 942 | _n0 | ||
| 998 |
_b0 _c130719 _dm _ea _f- _g0 |
||
| 999 |
_c41189 _d41189 |
||