Stock Image

Discrete and combinatorial mathematics - (Fifth Edition) - (English)(Chinese Edition)


ISBN 10: 7030349563 / ISBN 13: 9787030349569
New Condition: New Soft cover
From liu xing (JiangSu, JS, China)

AbeBooks Seller Since April 7, 2009

Quantity Available: 1

Buy New
Price: US$ 110.50 Convert Currency
Shipping: Free From China to U.S.A. Destination, Rates & Speeds
Add to basket

30 Day Return Policy

About this Item

Ship out in 2 business day, And Fast shipping, Free Tracking number will be provided after the shipment.Paperback. Pub Date :2012-07-01 Publisher: Science Press title: discrete and combinatorial mathematics - (Fifth Edition) - (English) Original price: 116 yuan: (U.S.) Grimaldi published society: Science Press Publication Date :2012-7-1ISBN: 9787030349569 Number of words: 900.000 yards: Revision: 1 Binding: Paperback: 16 Product size and weight: Editor's Choice Discrete and Combinatorial Mathematics (5th Edition English version) by Ralph P. Grimaldi forward to the main content: The major purposeof this new edition is to The continue to provide an introductorysurvey in both discrete and. DGMA realizes mathematics. The coverageis intended for the beginning student. so there are a great numberof examples with detailed-explanations . (The examples are numberedseparately and a thick line is used to denote the end of eachexample.) In addition. wherever proofs are given. they too arepresented with sufficient detail (with the novice in mind). the Summary directory PART 1 Fundamentals of Discrete Mathematics1 Fundamental Principles of Counting1.1 The Rules of Sum and Product1.2 Permutations1.3 Combinations: The Binomial Theorem1.4 Combinations with Repetition1.5 The Catalan Numbers (Optional) 1.6 Summary and Historical Review2 Fundamentals of Logic2.1 Basic Connectives and Truth Tables2.2 Logical Equivalence: The Laws of Logic2.3 Logical Implication: Rules of Inference2.4 The Use of Quantifiers2.5 Quantifiers. Definitions. and the Proofs of Theorems2.6 Summary and Historical Review3 Set Theory3.1 Sets and Subsets3.2 Set Operations and the Laws of Set Theory3.3 Counting and Venn Diagrams3.4 A First Word on Probability3.5 The Axioms of Probability (Optional) 3.6 Conditional Probability: Independence (Optional) 3.7 Discrete Random Variables (Optional) 3.8 Summary and Historical Review4 Properties of the Integers: Mathematical Induction4.1 The Well-Ordering Principle: Mathematical Induction4.2 Recursive Definitions4.3 The Division Algorithm: Prime Numbers4.4 The Greatest Common Divisor: The Euclidean Algorithm4.5 The Fundamental Theorem of Arithmetic4.6 Summary and Historical Review5 Relations and Functions5.1 Cartesian Products and Relations5.2 Functions: Plain and One-to-One5.3 Onto Functions: Stirling Numbers of the Second Kind5.4 Special Functions5.5 The Pigeonhole Principle5.6 Function Composition and Inverse Functions5. 7 Computational Complexity5.8 Analysis of Algorithms5.9 Summary and Historical Review6 Languages: Finite State Machines6.1 Language: The Set Theory of Strings6.2 Finite State Machines: A First Encounter6.3 Finite State Machines: A Second Encounter6.4 Summary and Historical Review 3327 Relations: The Second Time Around7.1 Relations Revisited: Properties of Relations7.2 Computer Recognition: Zero-One Matrices and DirectedGraphs7.3 Partial Orders: Hasse Diagrams7.4 Equivalence Relations and Partitions7.5 Finite State Machines: The Minimization Process7 .6 Summary and Historical ReviewPART 2 Further Topics in Enumeration8 The Principle of Inclusion and Exclusion8.1 The Principle of Inclusion and Exclusion8.2 Generalizations of the Principle8.3 Derangements: Nothing Is in Its Right Place8.4 Rook Polynomials8.5 Arrangements with Forbidden Positions8.6 Summary and Historical Review9 Generating Functions9.1 Introductory Examples9.2 Definition and Examples: Calculational Techniques9.3 Partitions of Integers9.4 The Exponential Generating Function9.5 The Summation Operator9.6 Summary and Historical Review10 Recurrence Relations10.1 The First- Order Linear Recurrence Relation10.2 The Second-Order Linear Homogeneous Recurrence Relation withConstant Coefficients10.3 The Nonhomogeneous Recurrence Relation10.4 The Method of Generating Functions10.5 A Special Kind of Nonlinear Recurrence Relation (Optional) 10.6 Divide-and-Conquer Algorithms (Optional ) 10.6 Summary and Historical ReviewPART 3 Graph Theory and Applications11 An Intro. Bookseller Inventory # FW005222

Ask Seller a Question

Bibliographic Details

Title: Discrete and combinatorial mathematics - (...

Binding: paperback

Book Condition:New

Store Description

Thank you for visiting My bookstore! We are an online bookstore, and Is the China's largest online book sales. Generally our books are from China, with reasonable price and decent printing quality. We are always trying our best to satisfy customer's needs!

Visit Seller's Storefront

Terms of Sale:

We guarantee the condition of every book as it's described on the Abebooks web sites. If you're dissatisfied with your purchase (Incorrect Book/Not as Described/Damaged) or if the order hasn't arrived, you're eligible for a refund within 30 days of the estimated delivery date. If you've changed your mind about a book that you've ordered, please use the Ask bookseller a question link to contact us and we'll respond within 2 business days. Please Note:We don't sell any international Edition to you...

More Information
Shipping Terms:

Most orders are shipped within 24 hours. We will delivery these items to you by AIRMAIL, EUB, EMS, TNT etc.

List this Seller's Books

Payment Methods
accepted by seller

Visa Mastercard American Express

PayPal Bank/Wire Transfer