Applied Combinatorics

Tucker, Alan

ISBN 10: 047143809X / ISBN 13: 9780471438090

Verlag: Wiley, 2001

Beschreibung

This item is in overall acceptable condition. Covers and dust jackets are intact but may have heavy wear including creases, bends, edge wear, curled corners or minor tears as well as stickers or sticker-residue. Pages are intact but may have minor curls, bends or moderate to considerable highlighting writing. Binding is intact; however, spine may have heavy wear. Digital codes may not be included and have not been tested to be redeemable and or active. A well-read copy overall. Please note that all items are donated goods and are in used condition. Orders shipped Monday through Friday! Your purchase helps put people to work and learn life skills to reach their full potential. Orders shipped Monday through Friday. Your purchase helps put people to work and learn life skills to reach their full potential. Thank you!

Bestandsnummer des Verkäufers 466SUS003JXN

Bibliografische Details

• Titel: Applied Combinatorics
• Verlag: Wiley
• Erscheinungsjahr: 2001
• Sprache: Englisch
• ISBN-10: 047143809X
• ISBN-13: 9780471438090
• Einband: Hardcover
• Auflage: 4. Auflage
• Zustand: acceptable

Über diesen Titel

Inhaltsangabe

This book is designed for use by students with a wide range of ability and maturity. The stronger the students, the harder the exercises that can be assigned. The book can be used for one--quarter, two--quarter, or one--semester course depending on how much material is used. Combinatorical reasoning underlies all analysis of computer systems. It plays a similar role in discrete operations research problems and in finite probability. This book teaches students in the mathematical sciences how to reason and model combinatorically. It seeks to develop proficiency in basic discrete math problem solving in the way that a calculus textbook develops proficiency in basic analysis problem solving. The three principle aspects of combinatorical reasoning emphasized in this book are: the systematic analysis of different possibilities, the exploration of the logical structure of a problem (e.g. finding manageable subpieces or first solving the problem with three objects instead of n), and ingenuity. Although important uses of combinatorics in computer science, operations research, and finite probability are mentioned, these applications are often used solely for motivation. Numerical examples involving the same concepts use more interesting settings such as poker probabilities or logical games.