Bild 1 von 10










Galerie
Bild 1 von 10










Ähnlichen Artikel verkaufen?
Diskrete Mathematik mit Kombinatorik von James A. Anderson (2000, Hardcover)
US $35,00
Ca.CHF 27,84
Artikelzustand:
“Dust jacket and hardcover are virtually perfect. Spine is strong and binding is tight. Pages are ”... Mehr erfahrenÜber den Artikelzustand
Neuwertig
Buch, das wie neu aussieht, aber bereits gelesen wurde. Der Einband weist keine sichtbaren Gebrauchsspuren auf. Bei gebundenen Büchern ist der Schutzumschlag vorhanden (sofern zutreffend). Alle Seiten sind vollständig vorhanden, es gibt keine zerknitterten oder eingerissenen Seiten und im Text oder im Randbereich wurden keine Unterstreichungen, Markierungen oder Notizen vorgenommen. Der Inneneinband kann minimale Gebrauchsspuren aufweisen. Minimale Gebrauchsspuren. Genauere Einzelheiten sowie eine Beschreibung eventueller Mängel entnehmen Sie bitte dem Angebot des Verkäufers.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Versand:
US $4,99 (ca. CHF 3,97) USPS Media MailTM.
Standort: New York, New York, USA
Lieferung:
Lieferung zwischen Di, 19. Aug und Di, 26. Aug nach 91768 bei heutigem Zahlungseingang
Rücknahme:
30 Tage Rückgabe. Käufer zahlt Rückversand. Wenn Sie ein eBay-Versandetikett verwenden, werden die Kosten dafür von Ihrer Rückerstattung abgezogen.
Zahlungen:
Sicher einkaufen
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:224848725090
Artikelmerkmale
- Artikelzustand
- Neuwertig
- Hinweise des Verkäufers
- Country/Region of Manufacture
- United States
- Subject
- Mathematics
- ISBN
- 9780130869982
- EAN
- 9780130869982
Über dieses Produkt
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
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
Artikelbeschreibung des Verkäufers
Info zu diesem Verkäufer
Hudson Holland
100% positive Bewertungen•1.7 Tsd. Artikel verkauft
Angemeldet als privater VerkäuferDaher finden verbraucherschützende Vorschriften, die sich aus dem EU-Verbraucherrecht ergeben, keine Anwendung. Der eBay-Käuferschutz gilt dennoch für die meisten Käufe.
Verkäuferbewertungen (603)
- e***a (1098)- Bewertung vom Käufer.Letzte 6 MonateBestätigter KaufSeller had to cancel order-which, I can imagine happens sometimes with sellers who have both on-line and physical locations. They refunded right away
- a***g (706)- Bewertung vom Käufer.Letzte 6 MonateBestätigter KaufUsed, beautiful 3 strand Lapis Lazuli necklace, timely shipping, excellent value, and shipped in original box.Vtg LUC 925 Sterling Silver Blue Sodalite Lapis Lazuli 3 Strand Beaded Necklace (Nr. 225933564398)
- d***p (1912)- Bewertung vom Käufer.Letzte 6 MonateBestätigter KaufWow! These are Fabulous and much Nicer in person. They are very Highly Crafted and well designed. The materials are also of high quality. Just Beautiful and so flattering on! The price is great and quick ship, too!
Noch mehr entdecken:
- James-A. - Michener-Belletristik-Bücher,
- Poul Anderson Belletristik-Bücher,
- Kevin-J. - Anderson-Belletristik-Bücher,
- Poul-Anderson-Taschenbuch-Belletristik - Bücher,
- Deutsche Bücher Poul Anderson Belletristik,
- James Patterson Belletristik-Bücher,
- James Rollins Belletristik-Bücher,
- James Joyce Belletristik-Bücher,
- Deutsche Bücher James Michener Belletristik,
- James-Fenimore-Cooper-Belletristik - Bücher