000 | 01586nam a22001817a 4500 | ||
---|---|---|---|
003 | OSt | ||
020 | _a9780198723493 | ||
041 | _aEnglish | ||
082 |
_aG 511.6 _bWILS |
||
100 | _aWilson, Robin | ||
245 | _aCombinatorics : a very short introduction | ||
250 | _a1st | ||
260 |
_aOxford New York, _bOxford University Press _c2016. |
||
300 | _a157p; paperback | ||
500 | _aHow many possible sudoku puzzles are there? In the lottery, what is the chance that two winning balls have consecutive numbers? Who invented Pascal’s triangle? (it was not Pascal) Combinatorics, the branch of mathematics concerned with selecting, arranging, and listing or counting collections of objects, works to answer all these questions. Dating back some 3000 years, and initially consisting mainly of the study of permutations and combinations, its scope has broadened to include topics such as graph theory, partitions of numbers, block designs, design of codes, and latin squares. In this Very Short Introduction Robin Wilson gives an overview of the field and its applications in mathematics and computer theory, considering problems from the shortest routes covering certain stops to the minimum number of colours needed to colour a map with different colours for neighbouring countries. Combinatorics is a large branch of mathematics involving the counting, selecting, and arranging of objects. Robin Wilson explores the field, looking at problems such as the shortest routes from A to B, to the number of Sudoku puzzles possible. | ||
650 | _aCombinatorial analysis | ||
942 |
_2ddc _cBK |
||
999 |
_c24728 _d24728 |