01285nam a22002417a 450000500170000000800410001702000180005804000130007608200170008910000220010624500660012825000170019426000350021130000200024650000180026652006430028454600080092765000160093565000330095165000250098465000190100965000150102820260908162242.0260908s2025    |||||||| |||| 00| 0 eng d  a9781266191541  cPK-LaUMT  aT 511bROS-D1 aRosen, Kenneth H.10aDiscrete mathematics and its applications /cKenneth H. Rosen  a2025 release  aNew York :bMcGraw Hill,c2025  aVarious pagings  aIndex present  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  aEng  aMathematics  aComputer science-Mathematics  aDiscrete mathematics  aSet operations  aAlgorithms