The seller is away until Aug 17, 2025. Add this item to your watchlist to keep track of it.

Discrete Mathematics with Combinatorics by James A. Anderson (2000, Hardcover)

US $35.00
Condition:
Like New
Dust jacket and hardcover are virtually perfect. Spine is strong and binding is tight. Pages are ... Read moreabout condition
Hurry before it's gone. 1 person is watching this item.
Breathe easy. Returns accepted.
Shipping:
US $4.99 USPS Media MailTM.
Located in: New York, New York, United States
Delivery:
Estimated between Tue, Aug 19 and Wed, Aug 27 to 94104
Delivery time is estimated using our proprietary method which is based on the buyer's proximity to the item location, the shipping service selected, the seller's shipping history, and other factors. Delivery times may vary, especially during peak periods.
Returns:
30 days returns. Buyer pays for return shipping. If you use an eBay shipping label, it will be deducted from your refund amount.
Payments:
       .
Earn up to 5x points when you use your eBay Mastercard®. Learn moreabout earning points with eBay Mastercard

Shop with confidence

eBay Money Back Guarantee
Get the item you ordered or your money back. Learn moreeBay Money Back Guarantee - opens new window or tab
Seller assumes all responsibility for this listing.
eBay item number:224848725090
Last updated on Nov 01, 2022 13:18:34 PDTView all revisionsView all revisions

Item specifics

Condition
Like New
A book that looks new but has been read. Cover has no visible wear, and the dust jacket (if applicable) is included for hard covers. No missing or damaged pages, no creases or tears, and no underlining/highlighting of text or writing in the margins. May be very minimal identifying marks on the inside cover. Very minimal wear and tear. See the seller’s listing for full details and description of any imperfections. See all condition definitionsopens in a new window or tab
Seller Notes
“Dust jacket and hardcover are virtually perfect. Spine is strong and binding is tight. Pages are ...
Country/Region of Manufacture
United States
Subject
General, Combinatorics
ISBN
9780130869982
EAN
9780130869982
Subject Area
Mathematics
Publication Name
Discrete Mathematics with Combinatorics
Publisher
Prentice Hall PTR
Item Length
9.5 in
Publication Year
2000
Type
Textbook
Format
Hardcover
Language
English
Item Height
1.4 in
Author
James A. Anderson
Item Weight
59 Oz
Item Width
8.3 in
Number of Pages
799 Pages
Category

About this product

Product Identifiers

Publisher
Prentice Hall PTR
ISBN-10
0130869988
ISBN-13
9780130869982
eBay Product ID (ePID)
1151959

Product Key Features

Number of Pages
799 Pages
Publication Name
Discrete Mathematics with Combinatorics
Language
English
Publication Year
2000
Subject
General, Combinatorics
Type
Textbook
Author
James A. Anderson
Subject Area
Mathematics
Format
Hardcover

Dimensions

Item Height
1.4 in
Item Weight
59 Oz
Item Length
9.5 in
Item Width
8.3 in

Additional Product Features

Intended Audience
College Audience
LCCN
00-031380
Dewey Edition
21
Illustrated
Yes
Dewey Decimal
510
Table Of Content
1. Truth Tables, Logic, and Proofs. Statements and Connectives. Conditional Statements. Equivalent Statements. Axiomatic Systems: Arguments and Proofs. Completeness in Propositional Logic. Karnaugh Maps. Circuit Diagrams. 2. Set Theory. Introduction to Sets. Set Operations. Venn Diagrams. Boolean Algebras. Relations. Partially Ordered Sets. Equivalence Relations. 3. Logic, Integers, and Proofs. Predicate Calculus. Basic Concepts of Proofs and the Structure of Integers. Mathematical Induction. Divisibility. Prime Integers. Congruence Relations. 4. Functions and Matrices. Functions. Special Functions. Matrices. Cardinality. Cardinals Continued. 5. Algorithms and Recursion. The "for" Procedure and Algorithms for Matrices. Recursive Functions and Algorithms. Complexity of Algorithms. Sorting Algorithms. Prefix and Suffix Notation. Binary and Hexadecimal Numbers. Signed Numbers. Matrices Continued. 6. Graphs, Directed Graphs, and Trees. Graphs. Directed Graphs. Trees. Instant Insanity. Euler Paths and Cycles. Incidence and Adjacency Matrices. Hypercubes and Gray Code. 7. Number Theory. Sieve of Eratosthenes. Fermat''s Factorization Method. The Division and Euclidean Algorithms. Continued Fractions. Convergents. 8. Counting and Probability. Basic Counting Principles. Inclusion-Exclusion Introduced. Permutations and Combinations. Generating Permutations and Combinations. Probability Introduced. Generalized Permutations and Combinations. Permutations and Combinations with Repetition. Pigeonhole Principle. Probability Revisited. Bayes'' Theorem. Markov Chains. 9. Algebraic Structures. Partially Ordered Sets Revisited. Semigroups and Semilattices. Lattices. Groups. Groups and Homomorphisms. 10. Number Theory Revisited. Integral Solutions of Linear Equations. Solutions of Congruence Equations. Chinese Remainder Theorem. Properties of the Function. Order of an Integer. 11. Recursion Revisited. Homogeneous Linear Recurrence Relations. Nonhomogeneous Linear Recurrence Relations. Finite Differences. Factorial Polynomials. Sums of Differences. 12. Counting Continued. Occupancy Problems. Catalan Numbers. General Inclusion-Exclusion and Derangements. Rook Polynomials and Forbidden Positions. 13. Generating Functions. Defining the Generating Function (optional). Generating Functions and Recurrence Relations. Generating Functions and Counting. Partitions. Exponential Generating Functions. 14. Graphs Revisited. Algebraic Properties of Graphs. Planar Graphs. Coloring Graphs. Hamiltonian Paths and Cycles. Weighted Graphs and Shortest Path Algorithms. 15. Trees. Properties of Trees. Binary Search Trees. Weighted Trees. Traversing Binary Trees. Spanning Trees. Minimal Spanning Trees. 16. Networks. Networks and Flows. Matching. Petri Nets. 17. Theory of Computation. Regular Languages. Automata. Grammars. 18. Theory of Codes. Introduction. Generator Matrices. Hamming Codes. 19. Enumeration of Colors. Burnside''s Theorem. Polya''s Theorem. 20. Rings, Integral Domains, and Fields. Rings and Integral Domains. Integral Domains. Polynomials. Algebra and Polynomials. 21. Group and Semigroup Characters. Complex Numbers. Group Characters. Semigroup Characters. 22. Applications of Number Theory. Application: Pattern Matching. Application: Hashing Functions. Application: Cryptography. Bibliography. Hints and Solutions to Selected Exercises. Index.
Synopsis
For freshman-level, one- or two-semester courses in Discrete Mathematics. This carefully organized, very readable text covers every essential topic in discrete mathematics in a logical fashion. Placing each topic in context, it covers concepts associated with discrete mathematical systems that have applications in computer science, engineering, and mathematics. The author introduces more basic concepts at the freshman level than are found in other texts, in a simple, accessible form. Introductory material is balanced with extensive coverage of graphs, trees, recursion, algebra, theory of computing, and combinatorics. Extensive examples throughout the text reinforce concepts.
LC Classification Number
QA39.2.A534 2001

Item description from the seller

About this seller

Hudson Holland

100% positive feedback1.7K items sold

Joined Jul 2017
Eco-friendly. Everything vintage & etcetera.

Detailed seller ratings

Average for the last 12 months
Accurate description
5.0
Reasonable shipping cost
5.0
Shipping speed
5.0
Communication
5.0

Seller feedback (603)

All ratings
Positive
Neutral
Negative
  • 7***0 (220)- Feedback left by buyer.
    Past 6 months
    Verified purchase
    wonderful! item as described, GREAT value, speedy and thoughtful packaging/shipping! THANK YOU!!
  • h***h (286)- Feedback left by buyer.
    Past year
    Verified purchase
    Picture did not do these glasses justice….they are fabulous! Packaging was over the top…..arrived in perfect condition. Shipped very quickly. Excellent buying experience!!
  • j***j (30)- Feedback left by buyer.
    Past year
    Verified purchase
    Great seller, would buy again. Perfect condition. Packed very well and shipped quickly. Thank you!