Discrete Mathematics: Introduction to Mathematical Reasoning / Edition 1

Hardcover (Print)
Rent
Rent from BN.com
$33.35
(Save 83%)
Est. Return Date: 10/31/2014
Buy Used
Buy Used from BN.com
$122.07
(Save 39%)
Item is in good condition but packaging may have signs of shelf wear/aging or torn packaging.
Condition: Used – Good details
Used and New from Other Sellers
Used and New from Other Sellers
from $126.80
Usually ships in 1-2 business days
(Save 36%)
Other sellers (Hardcover)
  • All (12) from $126.80   
  • New (6) from $156.82   
  • Used (6) from $126.80   

Overview

Susanna Epp's DISCRETE MATHEMATICS: AN INTRODUCTION TO MATHEMATICAL REASONING provides a clear introduction to discrete mathematics and mathematical reasoning in a compact form that focuses on core topics. Renowned for her lucid, accessible prose, Epp explains complex, abstract concepts with clarity and precision, helping students develop the ability to think abstractly as they study each topic. In doing so, the book provides students with a strong foundation both for computer science and for other upper-level mathematics courses.

Read More Show Less

Product Details

  • ISBN-13: 9780495826170
  • Publisher: Cengage Learning
  • Publication date: 2/11/2011
  • Edition description: New Edition
  • Edition number: 1
  • Pages: 648
  • Sales rank: 486,775
  • Product dimensions: 8.10 (w) x 10.10 (h) x 1.10 (d)

Meet the Author

Susanna S. Epp received her Ph.D. in 1968 from the University of Chicago, taught briefly at Boston University and the University of Illinois at Chicago, and is currently Vincent DePaul Professor of Mathematical Sciences at DePaul University. After initial research in commutative algebra, she became interested in cognitive issues associated with teaching analytical thinking and proof and has published a number of articles and given many talks related to this topic. She has also spoken widely on discrete mathematics and has organized sessions at national meetings on discrete mathematics instruction. In addition to Discrete Mathematics with Applications and Discrete Mathematics: An Introduction to Mathematical Reasoning, she is co-author of Precalculus and Discrete Mathematics, which was developed as part of the University of Chicago School Mathematics Project. Epp co-organized an international symposium on teaching logical reasoning, sponsored by the Institute for Discrete Mathematics and Theoretical Computer Science (DIMACS), and she was an associate editor of Mathematics Magazine from 1991 to 2001. Long active in the Mathematical Association of America (MAA), she is a co-author of the curricular guidelines for undergraduate mathematics programs: CUPM Curriculum Guide 2004.

Read More Show Less

Table of Contents

1. SPEAKING MATHEMATICALLY. Variables. The Language of Sets. The Language of Relations and Functions. 2. THE LOGIC OF COMPOUND STATEMENTS. Logical Form and Logical Equivalence. Conditional Statements. Valid and Invalid Arguments. 3. THE LOGIC OF QUANTIFIED STATEMENTS. Predicates and Quantified Statements I. Predicates and Quantified Statements II. Statements with Multiple Quantifiers. Arguments with Quantified Statements. 4. ELEMENTARY NUMBER THEORY AND METHODS OF PROOF. Direct Proof and Counterexample I: Introduction. Direct Proof and Counterexample II: Rational Numbers. Direct Proof and Counterexample III: Divisibility. Direct Proof and Counterexample IV: Division into Cases and the Quotient-Remainder Theorem. Indirect Argument: Contradiction and Contraposition. Indirect Argument: Two Classical Theorems. 5. SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION. Sequences. Mathematical Induction I. Mathematical Induction II. Strong Mathematical Induction and the Well-Ordering Principle. Defining Sequences Recursively. Solving Recurrence Relations by Iteration. 6. SET THEORY. Set Theory: Definitions and the Element Method of Proof. Set Identities. Disproofs and Algebraic Proofs. Boolean Algebras and Russell's Paradox. 7. PROPERTIES OF FUNCTIONS. Functions Defined on General Sets. One-to-one, Onto, and Inverse Functions. Composition of Functions. Cardinality and Sizes of Infinity. 8. PROPERTIES OF RELATIONS. Relations on Sets. Reflexivity, Symmetry, and Transitivity. Equivalence Relations. Modular Arithmetic and Zn. The Euclidean Algorithm and Applications. 9. COUNTING. Counting and Probability. The Multiplication Rule. Counting Elements of Disjoint Sets: The Addition Rule. The Pigeonhole Principle. Counting Subsets of a Set: Combinations. Pascal's Formula and the Binomial Theorem. 10. GRAPHS AND TREES. Graphs: An Introduction. Trails, Paths, and Circuits. Matrix Representations of Graphs. Isomorphisms of Graphs. Trees: Examples and Basic Properties. Rooted Trees.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)