Bild 1 von 1

Galerie
Bild 1 von 1

Diskrete Mathematik mit Kombinatorik, James Anderson-
US $15,00
Ca.EUR 12,80
Artikelzustand:
Gut
Buch, das gelesen wurde, sich aber in einem guten Zustand befindet. Der Einband weist nur sehr geringfügige Beschädigungen auf, wie z.B. kleinere Schrammen, er hat aber weder Löcher, noch ist er eingerissen. Bei gebundenen Büchern ist der Schutzumschlag möglicherweise nicht mehr vorhanden. Die Bindung weist geringfügige Gebrauchsspuren auf. Die Mehrzahl der Seiten ist unbeschädigt, das heißt, es gibt kaum Knitter oder Einrisse, es wurden nur in geringem Maße Bleistiftunterstreichungen im Text vorgenommen, es gibt keine Textmarkierungen und die Randbereiche sind nicht beschrieben. Alle Seiten sind vollständig vorhanden. 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 $6,72 (ca. EUR 5,73) USPS Media MailTM.
Standort: Brooklyn, New York, USA
Lieferung:
Lieferung zwischen Do, 28. Aug und Mi, 3. Sep nach 94104 bei heutigem Zahlungseingang
Rücknahme:
Keine Rücknahme.
Zahlungen:
Sicher einkaufen
- Gratis Rückversand im Inland
- Punkte für jeden Kauf und Verkauf
- Exklusive Plus-Deals
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:256735751696
Artikelmerkmale
- Artikelzustand
- ISBN
- 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
barryling
98,1% positive Bewertungen•6.481 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. Mehr erfahrenMehr erfahren
Verkäuferbewertungen (1.540)
- d***m (92)- Bewertung vom Käufer.Letzte 6 MonateBestätigter KaufHighly recommend this seller. Excellent communication (and i asked a lot of questions). Great price and the watch was described 100% correctly. The watch was near perfect condition with box and papers included. Pictures in the listing were accurate. Very happy with the purchase.
- r***y (270)- Bewertung vom Käufer.Letzte 6 MonateBestätigter KaufOrdered because of non-stock photo and described condition, received a book with a huge "RENT ME" sticker that wraps around the front and spine. Clearly not the book in the listing or even similar, classic bait and switch. Aside from that, the book was probably in better shape before it got shipped. It was packaged only in plastic, no bubble, no cardboard. The corners of the hardcover are all smashed. Now I get to take a hair dryer and try to remove the sticker and own a tumbled looking bookA Friendly Introduction to Number Theory. 3rd edition. Joseph Silverman (Nr. 256593646615)
- y***3 (51)- Bewertung vom Käufer.Letzte 6 MonateBestätigter KaufGood price and arrived quicklyTrading on Volume. Donald Cassidy (Nr. 254685642744)
Noch mehr entdecken:
- Mathematik Schule und Ausbildung,
- Bücher über Mathematik Sachbuch,
- Lehrbücher Mathematik,
- Mathematik Studium und Erwachsenenbildung,
- Mathematik Klett Schule und Ausbildung,
- Poul Anderson Belletristik-Bücher,
- Mathematik Schule und Ausbildung als gebundene Ausgabe,
- Mathematik Schule und Ausbildung im Taschenbuch-Format,
- Deutsche Mathematik Schule und Ausbildung,
- Mathematik Schule und Ausbildung Lehrerausgabe