000 05760cam a22003854i 4500
005 20221101221220.0
008 090806s2009 njua b 001 0 eng d
010 _a 2008055959
011 _aBIB MATCHES WORLDCAT
020 _a0470457937
_qcloth
020 _a9780470457931
_qcloth
035 _a(OCoLC)294879142
040 _aDLC
_beng
_erda
_cDLC
_dYDX
_dBTCTA
_dYDXCP
_dCDX
_dBWX
_dATU
050 0 0 _aQA39.3
_b.G68 2009
082 0 0 _a510
_222
100 1 _aGossett, Eric,
_eauthor.
_91073893
245 1 0 _aDiscrete mathematics with proof /
_cEric Gossett.
250 _aSecond edition.
264 1 _aHoboken, N.J. :
_bWiley,
_c[2009]
264 4 _c©2009
300 _axxiii, 806, 98 pages :
_billustrations ;
_c26 cm
336 _atext
_btxt
_2rdacontent
337 _aunmediated
_bn
_2rdamedia
338 _avolume
_bnc
_2rdacarrier
504 _aIncludes bibliographical references and index.
505 0 0 _g1.
_tIntroduction --
_g1.1.
_tWhat Is Discrete Mathematics? --
_g1.2.
_tThe Stable Marriage Problem --
_g1.3.
_tOther Examples --
_g1.4.
_tExercises --
_g1.5.
_tChapter Review --
_g2.
_tSets, Logic, and Boolean Algebras --
_g2.1.
_tSets --
_g2.2.
_tLogic in Daily Life --
_g2.3.
_tPropositional Logic --
_g2.4.
_tLogical Equivalence and Rules of Inference --
_g2.5.
_tBoolean Algebras --
_g2.6.
_tPredicate Logic --
_g2.7.
_tQuick Check Solutions --
_g2.8.
_tChapter Review --
_g3.
_tProof --
_g3.1.
_tIntroduction to Mathematical Proof --
_g3.2.
_tElementary Number Theory: Fuel for Practice --
_g3.3.
_tProof Strategies --
_g3.4.
_tApplications of Elementary Number Theory --
_g3.5.
_tMathematical Induction --
_g3.6.
_tCreating Proofs: Hints and Suggestions --
_g3.7.
_tQuick Check Solutions --
_g3.8.
_tChapter Review --
_g4.
_tAlgorithms --
_g4.1.
_tExpressing Algorithms --
_g4.2.
_tMeasuring Algorithm Efficiency --
_g4.3.
_tPattern Matching --
_g4.4.
_tThe Halting Problem --
_g4.5.
_tQuick Check Solutions --
_g4.6.
_tChapter Review --
_g5.
_tCounting --
_g5.1.
_tPermutations and Combinations --
_g5.2.
_tCombinatorial Proofs --
_g5.3.
_tPigeon-Hole Principle --
_g5.4.
_tQuick Check Solutions --
_g5.5.
_tChapter Review --
_g6.
_tFinite Probability Theory --
_g6.1.
_tThe Language of Probabilities --
_g6.2.
_tConditional Probabilities and Independent Events --
_g6.3.
_tCounting and Probability --
_g6.4.
_tExpected Value --
_g6.5.
_tThe Binomial Distribution --
_g6.6.
_tBayes's Theorem --
_g6.7.
_tQuick Check Solutions --
_g7.
_tRecursion --
_g7.1.
_tRecursive Algorithms --
_g7.2.
_tRecurrence Relations --
_g7.3.
_tBig-T and Recursive Algorithms: The Master Theorem --
_g7.4.
_tGenerating Functions --
_g7.5.
_tThe Josephus Problem --
_g7.6.
_tQuick Check Solutions --
_g7.7.
_tChapter Review --
_g8.
_tCombinatorics --
_g8.1.
_tPartitions, Occupancy Problems, Stirling Numbers --
_g8.2.
_tLatin Squares --
_g8.3.
_tBalanced Incomplete Block Designs --
_g8.4.
_tThe Knapsack Problem --
_g8.5.
_tError-Correcting Codes --
_g8.6.
_tDistinct Representatives, Ramsey Numbers --
_g8.7.
_tQuick Check Solutions --
_g8.8.
_tChapter Review --
_g9.
_tFormal Models in Computer Science --
_g9.1.
_tInformation --
_g9.2.
_tFinite-State Machines --
_g9.3.
_tFormal Languages --
_g9.4.
_tRegular Expressions --
_g9.5.
_tThe Three Faces of Regular --
_g9.6.
_tA Glimpse at More Advanced Topics --
_g9.7.
_tQuick Check Solutions --
_g9.8.
_tChapter Review --
_g10.
_tGraphs --
_g10.1.
_tTerminology --
_g10.2.
_tConnectivity and Adjacency --
_g10.3.
_tEuler and Hamilton --
_g10.4.
_tRepresentation and Isomorphism --
_g10.5.
_tThe Big Theorems: Planarity, Euler, Polyhedra, Chromatic Number --
_g10.6.
_tDirected Graphs and Weighted Graphs --
_g10.7.
_tQuick Check Solutions --
_g10.8.
_tChapter Review --
_g11.
_tTrees --
_g11.1.
_tTerminology, Counting --
_g11.2.
_tTraversal, Searching, and Sorting --
_g11.3.
_tMore Applications of Trees --
_g11.4.
_tSpanning Trees --
_g11.5.
_tQuick Check Solutions --
_g11.6.
_tChapter Review --
_g12.
_tFunctions, Relations, Databases, and Circuits --
_g12.1.
_tFunctions and Relations --
_g12.2.
_tEquivalence Relations, Partially Ordered Sets --
_g12.3.
_tn-ary Relations and Relational Databases --
_g12.4.
_tBoolean Functions and Boolean Expressions --
_g12.5.
_tCombinatorial Circuits --
_g12.6.
_tQuick Check Solutions --
_g12.7.
_tChapter Review --
_gA.
_tNumber Systems --
_gA.1.
_tThe Natural Numbers --
_gA.2.
_tThe Integers --
_gA.3.
_tThe Rational Numbers --
_gA.4.
_tThe Real Numbers --
_gA.5.
_tThe Complex Numbers --
_gA.6.
_tOther Number Systems --
_gA.7.
_tRepresentation of Numbers --
_gB.
_tSummation Notation --
_gC.
_tLogic Puzzles and Analyzing Claims --
_gC.1.
_tLogic Puzzles --
_gC.2.
_tAnalyzing Claims --
_gC.3.
_tQuick Check Solutions --
_gD.
_tThe Golden Ratio --
_gE.
_tMatrices --
_gF.
_tThe Greek Alphabet --
_gG.
_tWriting Mathematics --
_gH.
_tSolutions to Selected Exercises --
_gH.1.
_tIntroduction --
_gH.2.
_tSets, Logic, and Boolean Algebras --
_gH.3.
_tProof --
_gH.4.
_tAlgorithms --
_gH.5.
_tCounting --
_gH.6.
_tFinite Probability Theory --
_gH.7.
_tRecursion --
_gH.8.
_tCombinatorics --
_gH.9.
_tFormal Models in Computer Science --
_gH.10.
_tGraphs --
_gH.11.
_tTrees --
_gH.12.
_tFunctions, Relations, Databases, and Circuits --
_gH.13.
_tAppendices.
520 _a"Discrete mathematics has become increasingly popular in recent years due to its growing applications in the field of computer science. Discrete Mathematics with Proof, Second Edition continues to facilitate an up-to-date understanding of this important topic, exposing readers to a wide range of modern and technological applications."--Publisher's website.
588 _aMachine converted from AACR2 source record.
650 0 _aMathematics.
_9320549
650 0 _aComputer science
_xMathematics.
_9317183
907 _a.b11458914
_b27-07-19
_c27-10-15
942 _cB
945 _a510 GOS
_g1
_iA455018B
_j0
_lcmain
_o-
_p$168.63
_q-
_r-
_s-
_t0
_u13
_v3
_w1
_x2
_y.i12907832
_z29-10-15
998 _ab
_ac
_b06-04-16
_cm
_da
_feng
_gnju
_h0
999 _c1194642
_d1194642