000			03056nam a2200361 i 4500
001			19240562
003			CSPC
005			20260929090738.0
008			260926s2025 sz a b 001 0 eng
010			_a 2016427777
020			_a9783031734335
040			_aDLC _beng _erda _cDLC _dCSPC
050		4	_aQA297.4 _b.K53 2025
082	0	4	_223 _a511.1 _bK663d
100	1		_aKlappenecker, Andreas, _eauthor.
245	1	0	_aDiscrete structures / _cAndreas Klappenecker and Hyunyoung Lee.
264		1	_aCham, Switzerland : _bSpringer Nature Switzerland, _c2025.
300			_axv, 423 pages : _billustrations (chiefly color) ; _c24 cm.
336			_atext _btxt _2rdacontent
337			_aunmediated _bn _2rdamedia
338			_avolume _bnc _2rdacarrier
490	0		_aUndergraduate texts in mathematics
504			_aIncludes bibliographical references and index.
505	0		_aI. Discrete structures -- Introduction -- Mathematical arguments -- Sets -- Proof by induction -- Equivalence relations -- Partial orders and lattices -- Floor and ceiling functions -- Number theory -- II. Summation and asymptotics -- Sums -- Asymptotic analysis -- III. Combinatorics -- Counting -- Generating functions -- Recurrence relations -- Graphs -- Probability theory.
520			_a"The aim of this text is to introduce discrete mathematics to beginning students of mathematics or computer science. It does this by bringing some coherency into the seemingly incongruent subjects that compose discrete math, such as logic, set theory, algebra, and combinatorics. It emphasizes their theoretical foundations and illustrates proofs along the way. The book prepares readers for the analysis of algorithms by discussing asymptotic analysis and a discrete calculus for sums. The book also deduces combinatorial methods from the foundations that are laid out. Unlike other texts on this subject, there is a greater emphasis on foundational material that leads to a better understanding. To further assist the reader in grasping and practicing concepts, roughly 690 exercises are provided at various levels of difficulty. Readers are encouraged to study the examples in the text and solve as many of the exercises as possible. The text is intended for freshman or sophomore undergraduate students in mathematics, computer science, or similar majors. The assumed background is precalculus. The chapter dependency chart included is designed to help students, independent readers, and instructors follow a systematic path for learning and teaching the material, with the option to explore material in later chapters"-- Provided by publisher.
546			_aEnglish.
650		0	_aDiscrete mathematics.
700	1		_aLee, Hyunyoung, _eauthor.
906			_a7 _bcbc _corignew _d4 _encip _f20 _gy-gencatlg
942			_2ddc _n0 _cBK _e23 _h511.1 _iK663d _kCIR _m2025
999			_c33521 _d33521