| 000 | 01363nam a22002657a 4500 | ||
|---|---|---|---|
| 005 | 20260908162242.0 | ||
| 008 | 260908s2025 |||||||| |||| 00| 0 eng d | ||
| 020 | _a9781266191541 | ||
| 040 | _cPK-LaUMT | ||
| 082 |
_aT 511 _bROS-D |
||
| 100 | 1 |
_aRosen, Kenneth H. _915437 |
|
| 245 | 1 | 0 |
_aDiscrete mathematics and its applications / _cKenneth H. Rosen |
| 250 | _a2025 release | ||
| 260 |
_aNew York : _bMcGraw Hill, _c2025 |
||
| 300 | _aVarious pagings | ||
| 500 | _aIndex present | ||
| 520 | _a"A discrete mathematics course has more than one purpose. Students should learn a particular set of mathematical facts and how to apply them; more importantly, such a course should teach students how to think logically and mathematically. To achieve these goals, this text stresses mathematical reasoning and the different ways problems are solved. Five important themes are interwoven in this text: mathematical reasoning, combinatorial analysis, discrete structures, algorithmic thinking, and applications and modeling. A successful discrete mathematics course should carefully blend and balance all five themes"-- Provided by publisher | ||
| 546 | _aEng | ||
| 650 | _aMathematics | ||
| 650 |
_aComputer science-Mathematics _915436 |
||
| 650 |
_aDiscrete mathematics _915438 |
||
| 650 |
_aSet operations _915439 |
||
| 650 | _aAlgorithms | ||
| 942 | _cBK | ||
| 999 |
_c142463 _d142463 |
||