|Listed in category:
Have one to sell?

4-6 DAYS DELIVERY - Discrete Mathematics with Applications by Epp, 5TH INT'L ED.

Condition:
New
3 available / 4 sold
Price:
US $37.99
ApproximatelyEUR 35.56
Postage:
US $3.99 (approx EUR 3.74) Economy Shipping. See detailsfor postage
Located in: AVENEL, NJ, United States
Delivery:
Estimated between Mon, 1 Jul and Sat, 6 Jul to 43230
Estimated delivery dates - opens in a new window or tab include seller's dispatch time, origin postcode, destination postcode and time of acceptance and will depend on delivery service selected and receipt of cleared paymentcleared payment - opens in a new window or tab. Delivery times may vary, especially during peak periods.
Returns:
30 days return. Buyer pays for return postage. See details- for more information about returns
Payments:
    

Shop with confidence

eBay Money Back Guarantee
Get the item you ordered or your money back. 

Seller information

Registered as private seller, so consumer rights stemming from EU consumer protection law do not apply. eBay Money Back Guarantee still applies to most purchases.
Seller assumes all responsibility for this listing.
eBay item number:275832734491
Last updated on 26 May, 2024 12:50:28 BSTView all revisionsView all revisions

Item specifics

Condition
New: A new, unread, unused book in perfect condition with no missing or damaged pages. See the ...
Binding
SOFTCOVER
International ISBN
9789355731029
Contents
SAME as in US edition
Packing
Shrinkwrapped- Box Packed
Shipping Service
DELIVERED WITHIN 5-8 DAYS BY DHL/UPS/FedEx/Aramex
Product Type
INTERNATIONAL EDITION
Edition
5
ISBN
9781337694193
Subject Area
Mathematics
Publication Name
Discrete Mathematics with Applications
Publisher
Cengage Learning
Item Length
10.2 in
Subject
General, Discrete Mathematics
Publication Year
2019
Type
Textbook
Format
Hardcover
Language
English
Item Height
1.6 in
Author
Susanna S. Epp
Item Weight
71.4 Oz
Item Width
8.3 in
Number of Pages
984 Pages

About this product

Product Information

DISCRETE MATHEMATICS WITH APPLICATIONS, 5th Edition, explains complex, abstract concepts with clarity and precision and provides a strong foundation for computer science and upper-level mathematics courses of the computer age. Author Susanna Epp presents not only the major themes of discrete mathematics, but also the reasoning that underlies mathematical thought. Students develop the ability to think abstractly as they study the ideas of logic and proof. While learning about such concepts as logic circuits and computer addition, algorithm analysis, recursive thinking, computability, automata, cryptography and combinatorics, students discover that the ideas of discrete mathematics underlie and are essential to today's science and technology.

Product Identifiers

Publisher
Cengage Learning
ISBN-10
1337694193
ISBN-13
9781337694193
eBay Product ID (ePID)
24038720457

Product Key Features

Number of Pages
984 Pages
Language
English
Publication Name
Discrete Mathematics with Applications
Publication Year
2019
Subject
General, Discrete Mathematics
Type
Textbook
Subject Area
Mathematics
Author
Susanna S. Epp
Format
Hardcover

Dimensions

Item Height
1.6 in
Item Weight
71.4 Oz
Item Length
10.2 in
Item Width
8.3 in

Additional Product Features

Edition Number
5
LCCN
2018-953604
Dewey Edition
22
Target Audience
College Audience
Illustrated
Yes
Dewey Decimal
510
Lc Classification Number
Qa39.3.E65 2020
Table of Content
1. SPEAKING MATHEMATICALLY. Variables. The Language of Sets. The Language of Relations and Functions. The Language of Graphs. 2. THE LOGIC OF COMPOUND STATEMENTS. Logical Form and Logical Equivalence. Conditional Statements. Valid and Invalid Arguments. Application: Digital Logic Circuits. Application: Number Systems and Circuits for Addition. 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: Writing Advice. Direct Proof and Counterexample III: Rational Numbers. Direct Proof and Counterexample IV: Divisibility. Direct Proof and Counterexample V: Division into Cases and the Quotient-Remainder Theorem. Direct Proof and Counterexample VI: Floor and Ceiling. Indirect Argument: Contradiction and Contraposition. Indirect Argument: Two Famous Theorems. Application: Algorithms. 5. SEQUENCES, MATHEMATICAL INDUCTION, AND RECURSION. Sequences. Mathematical Induction I: Proving Formulas. Mathematical Induction II: Applications. Strong Mathematical Induction and the Well-Ordering Principle. Application: Correctness of Algorithms. Defining Sequences Recursively. Solving Recurrence Relations by Iteration. Second-Order Linear Homogeneous Recurrence Relations with Constant Coefficients. General Recursive Definitions and Structural Induction. 6. SET THEORY. Set Theory: Definitions and the Element Method of Proof. Properties of Sets. Disproofs and Algebraic Proofs. Boolean Algebras, Russells Paradox, and the Halting Problem. 7. PROPERTIES OF FUNCTIONS. Functions Defined on General Sets. One-to-one, Onto, and Inverse Functions. Composition of Functions. Cardinality with Applications to Computability. 8. PROPERTIES OF RELATIONS. Relations on Sets. Reflexivity, Symmetry, and Transitivity. Equivalence Relations. Modular Arithmetic with Applications to Cryptography. Partial Order Relations. 9. COUNTING AND PROBABILITY Introduction. Possibility Trees and the Multiplication Rule. Counting Elements of Disjoint Sets: The Addition Rule. The Pigeonhole Principle. Counting Subsets of a Set: Combinations. r-Combinations with Repetition Allowed. Pascals Formula and the Binomial Theorem. Probability Axioms and Expected Value. Conditional Probability, BayesFormula, and Independent Events. 10. THEORY OF GRAPHS AND TREES. Trails, Paths, and Circuits. Matrix Representations of Graphs. Isomorphisms of Graphs. Trees: Examples and Basic Properties. Rooted Trees. Spanning Trees and a Shortest Path Algorithm. 11. ANALYSIS OF ALGORITHM EFFICIENCY. Real-Valued Functions of a Real Variable and Their Graphs. O-, ?-, and ?-Notations. Application: Analysis of Algorithm Efficiency I. Exponential and Logarithmic Functions: Graphs and Orders. Application: Analysis of Algorithm Efficiency II. 12. REGULAR EXPRESSIONS AND FINITE STATE AUTOMATA. Formal Languages and Regular Expressions. Finite-State Automata. Simplifying Finite-State Automata.
Copyright Date
2020

Item description from the seller

TextbooksXpress

TextbooksXpress

97.3% positive Feedback
26K items sold

Detailed seller ratings

Average for the last 12 months

Accurate description
4.9
Reasonable postage cost
4.9
Delivery time
4.9
Communication
4.8
Registered as a private seller
Thereby, consumer rights stemming from EU consumer protection law do not apply. eBay buyer protection still applies to most purchases.

Seller Feedback (3,281)

e***v (34)- Feedback left by buyer.
Past month
Verified purchase
As expected, thanks so much!
a***a (129)- Feedback left by buyer.
Past month
Verified purchase
Bought as a gift for my mother, arrived packed well and undamaged. She loves it
h***- (984)- Feedback left by buyer.
Past month
Verified purchase
very useful and interesting information --book in perfect condition