02952cam a22003737i 450000100090000000300050000900500170001400800410003101000170007202000180008903500130010704000290012005000120014908200210016110000360018224500670021825000480028526400420033330000450037533600260042033700280044633800270047449000200050150400510052150503840057252013280095654600130228465000220229770000290231990600450234894200440239395201240243799900170256119240562CSPC20260926104722.0260926s2025    sz a     b    001 0 eng    a  2016427777  a9783031734335  a19240562  aDLCbengerdacDLCdCSPC 4aQA297.404223a511.1bK663d1 aKlappenecker, Andreas,dauthor.10aDiscrete structures /cAndreas Klappenecker and Hyunyoung Lee.  aCustom edition for George Mason University. 1aCham, Switzerland :bSpringer,c2025.  axv, 423 pages :billustrations ;c24 cm.  atextbtxt2rdacontent  aunmediatedbn2rdamedia  avolumebnc2rdacarrier0 aAlways learning  aIncludes bibliographical references and index.2 aI. Discrete structures -- Introduction -- Mathematical arguments -- Sets -- Proofs by induction -- Equivalence relations -- Partials 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.  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.  aEnglish. 0aLogicxTextbooks.1 aLee, Hyunyoung,eauthor.  a7bcbccorignewd4encipf20gy-gencatlg  2ddcn0cBKe23h511.1iK663dkCIRm2025  00102ddc4070aCSPCbCSPCcCIRd2026-09-26l0oCIR 511.1 K663d 2025p032573r2026-09-26 10:47:42t1-1w2026-09-26yBK  c33507d33507