Discrete Mathematics combines a balance of theory and applications with mathematical rigor and an accessible writing style. The author uses a range of examples to teach core concepts, while corresponding exercises allow students to apply what they learn. Throughout the text, engaging anecdotes and topics of interest inform as well as motivate learners. The text is ideal for one- or two-semester courses and for students who are typically mathematics, mathematics education, or computer science majors. Part I teaches student how to write proofs; Part II focuses on computation and problem solving. The second half of the book may also be suitable for introductory courses in combinatorics and graph theory.
"synopsis" may belong to another edition of this title.
0. Representing Numbers. Part I: PROOFS. 1. Logic and Sets. Statement Forms and Logical Equivalences. Set Notation. Quantifiers. Set Operations and Identities. Valid Arguments. Chapter 1 Review Problems. 2. Basic Proof Writing. Direct Demonstration. General Demonstration (Part 1). General Demonstration (Part 2). Indirect Arguments. Splitting into Cases. Chapter 2 Review Problems. 3. Elementary Number Theory. Divisors. Consequences of Well-Ordering. Euclid's Algorithm and Lemma. Rational Numbers. Irrational Numbers. Modular Arithmetic. Chapter 3 Review Problems. 4. Indexed by Integers. Sequences, Indexing, and Recursion. Sigma Notation. Mathematical Induction, an Introduction. Induction and Summations. Strong Induction. The Binomial Theorem. Chapter 4 Review Problems. 5. Relations. General Relations. Special Relations on Sets. Basics of Functions. Special Functions. General Set Constructions. Cardinality. Chapter 5 Review Problems. Part II: COMBINATORICS. 6. Basic Counting. The Multiplication Principle. Permutations and Combinations. Addition and Subtraction. Probability. Applications of Combinations. Correcting for Overcounting. Chapter 6 Review Problems. 7. More Counting. Inclusion-Exclusion. Multinomial Coefficients. Generating Functions. Counting Orbits. Combinatorial Arguments. Chapter 7 Review Problems. 8. Basic Graph Theory. Motivation and Introduction. Matrices and Special Graphs. Isomorphisms. Invariants. Directed Graphs and Markov Chains. Chapter 8 Review Problems. 9. Graph Properties. Connectivity. Euler Circuits. Hamiltonian Cycles. Planar Graphs. Chromatic Number. Chapter 9 Review Problems. 10. Trees and Algorithms. Trees. Search Trees. Weighted Trees. Analysis of Algorithms (Part 1). Analysis of Algorithms (Part 2). Chapter 10 Review Problems. Appendix A: Assumed Properties of Z and R. Appendix B: Pseudocode.
"About this title" may belong to another edition of this title.
£ 4.43 shipping from U.S.A. to United Kingdom
Destination, rates & speeds£ 22.21 shipping from U.S.A. to United Kingdom
Destination, rates & speedsSeller: BooksRun, Philadelphia, PA, U.S.A.
Hardcover. Condition: Fair. 1. Ship within 24hrs. Satisfaction 100% guaranteed. APO/FPO addresses supported. Seller Inventory # 0618415386-7-1
Quantity: 1 available
Seller: Toscana Books, AUSTIN, TX, U.S.A.
Hardcover. Condition: new. Excellent Condition.Excels in customer satisfaction, prompt replies, and quality checks. Seller Inventory # Scanned0618415386
Quantity: 1 available
Seller: TextbookRush, Grandview Heights, OH, U.S.A.
Condition: Good. Softcover, International Edition. This is an International Edition. Seller Inventory # 39356488
Quantity: 2 available
Seller: TextbookRush, Grandview Heights, OH, U.S.A.
Condition: Very Good. Softcover, International Edition. This is an International Edition. Seller Inventory # 39749770
Quantity: 1 available
Seller: Textbooks_Source, Columbia, MO, U.S.A.
hardcover. Condition: Good. 1st Edition. Ships in a BOX from Central Missouri! May not include working access code. Will not include dust jacket. Has used sticker(s) and some writing or highlighting. UPS shipping for most packages, (Priority Mail for AK/HI/APO/PO Boxes). Seller Inventory # 000871907U
Quantity: 2 available