| 000 | 01055nam a22002057a 4500 | ||
|---|---|---|---|
| 999 |
_c2987 _d2987 |
||
| 005 | 20191104110930.0 | ||
| 008 | 191102b ||||| |||| 00| 0 eng d | ||
| 020 | _a0395937760 | ||
| 040 | _cSAUT Mbeya Library | ||
| 082 |
_222nd ed. _a512 ALG |
||
| 245 |
_aAlgebra 1 : _bequations, graphs, applications / _cRon Larson...[et al.] |
||
| 260 |
_aIllinois : _bMcDougal Littell, _cc2001. |
||
| 300 |
_axxi, 834p. : _bill. (some col.) ; _c27cm. |
||
| 500 | _aIncludes index | ||
| 520 | _aStudy of classical combinatorial structures, such as random graphs, permutations, and systems of random linear equations in finite fields. The author shows how the application of the generalized scheme of allocation in the study of random graphs and permutations reduces the combinatorial problems to classical problems of probability theory on the summation of independent random variables. | ||
| 650 | 0 |
_96534 _a Algebra _vStudy and teaching (Secondary) |
|
| 650 | 0 |
_96540 _aMathematics _xStudy and teaching (Secondary) |
|
| 700 |
_96536 _aRon Larson |
||
| 942 |
_2ddc _cBK |
||