Mathematics: a discrete introduction / Edward R. Scheinerman

By: Scheinerman, Edward R [author]Material type: TextTextPublication details: Boston, MA : Brooks/Cole Cengage Learning, 2013Edition: Third editionDescription: xxvii, 470 pages : illustrations ; 29 cmISBN: 9780840049421Subject(s): COMPUTER SCIENCE -- MATHEMATICS -- TEXTBOOKSLOC classification: QA 76.9.M35 .S34 2013
Contents:
1. FUNDAMENTALS. Joy. Speaking (and Writing) of Mathetimatics. Definition. Theorem. Proof. Counterexample. Boolean Algebra. Self Test. 2. COLLECTIONS. Lists. Factorial. Sets I: Introduction, Subsets. Quantifiers. Sets II: Operations. Combinatorial Proof: Two Examples. Self Test. 3. COUNTING AND RELATIONS. Relations. Equivalence Relations. Partitions. Binomial Coefficients. Counting Multisets. Inclusion-Exclusion. Self Test. 4. MORE PROOF. Contradiction. Smallest Counterexample. Induction. Recurrence Relations. Self Test. 5. FUNCTIONS. Functions. The Pigeonhole Principle. Composition. Permutations. Symmetry. Assorted Notation. Self Test. 6. PROBABILITY. Sample Space. Events. Conditional Probability and Independence. Random Variables. Expectation. Self Test. 7. NUMBER THEORY. Dividing. Greatest Common Divisor. Modular Arithmetic. The Chinese Remainder Theorem. Factoring. Self Test. 8. ALGEBRA. Groups. Group Isomorphism. Subgroups. Fermat's Little Theorem. Public-Key Cryptography I: Introduction. Public-Key Cryptography II: Rabin's Method. Public-Key Cryptography III: RSA. Self Test. 9. GRAPHS. Graph Theory Fundamentals. Subgraphs. Connection. Trees. Eulerian Graphs. Coloring. Planar Graphs. Self Test. 10. PARTIALLY ORDERED SETS. Partially Ordered Sets Fundamentals. Max and Min. Linear Orders. Linear Extensions. Dimension. Lattices. Self Test. APPENDICES. Lots of Hints and Comments; Some Answers. Solutions to Self Tests. Glossary. Fundamentals. Index.
Summary: Master the fundamentals of discrete mathematics and proof-writing with MATHEMATICS: A DISCRETE INTRODUCTION! With a clear presentation, the mathematics text teaches you not only how to write proofs, but how to think clearly and present cases logically beyond this course. Though it is presented from a mathematician's perspective, you will learn the importance of discrete mathematics in the fields of computer science, engineering, probability, statistics, operations research, and other areas of applied mathematics. Tools such hints and proof templates prepare you to succeed in this course.
Item type: Books
Tags from this library: No tags from this library for this title. Log in to add tags.
    Average rating: 0.0 (0 votes)
Item type Current library Home library Collection Shelving location Call number Copy number Status Date due Barcode
Books Books National University - Manila
National University - Manila
Electronics and Communications Engineering General Circulation GC QA 76.9.M35 .S34 2013 (Browse shelf (Opens below)) c.1 Available NULIB000013578

Includes index.

1. FUNDAMENTALS. Joy. Speaking (and Writing) of Mathetimatics. Definition. Theorem. Proof. Counterexample. Boolean Algebra. Self Test. 2. COLLECTIONS. Lists. Factorial. Sets I: Introduction, Subsets. Quantifiers. Sets II: Operations. Combinatorial Proof: Two Examples. Self Test. 3. COUNTING AND RELATIONS. Relations. Equivalence Relations. Partitions. Binomial Coefficients. Counting Multisets. Inclusion-Exclusion. Self Test. 4. MORE PROOF. Contradiction. Smallest Counterexample. Induction. Recurrence Relations. Self Test. 5. FUNCTIONS. Functions. The Pigeonhole Principle. Composition. Permutations. Symmetry. Assorted Notation. Self Test. 6. PROBABILITY. Sample Space. Events. Conditional Probability and Independence. Random Variables. Expectation. Self Test. 7. NUMBER THEORY. Dividing. Greatest Common Divisor. Modular Arithmetic. The Chinese Remainder Theorem. Factoring. Self Test. 8. ALGEBRA. Groups. Group Isomorphism. Subgroups. Fermat's Little Theorem. Public-Key Cryptography I: Introduction. Public-Key Cryptography II: Rabin's Method. Public-Key Cryptography III: RSA. Self Test. 9. GRAPHS. Graph Theory Fundamentals. Subgraphs. Connection. Trees. Eulerian Graphs. Coloring. Planar Graphs. Self Test. 10. PARTIALLY ORDERED SETS. Partially Ordered Sets Fundamentals. Max and Min. Linear Orders. Linear Extensions. Dimension. Lattices. Self Test. APPENDICES. Lots of Hints and Comments; Some Answers. Solutions to Self Tests. Glossary. Fundamentals. Index.

Master the fundamentals of discrete mathematics and proof-writing with MATHEMATICS: A DISCRETE INTRODUCTION! With a clear presentation, the mathematics text teaches you not only how to write proofs, but how to think clearly and present cases logically beyond this course. Though it is presented from a mathematician's perspective, you will learn the importance of discrete mathematics in the fields of computer science, engineering, probability, statistics, operations research, and other areas of applied mathematics. Tools such hints and proof templates prepare you to succeed in this course.

There are no comments on this title.

to post a comment.

© 2021 NU LRC. All rights reserved.Privacy Policy I Powered by: KOHA