Discrete Mathematics - 1st Edition - ISBN: 9780340610473, 9780080928609

Discrete Mathematics

1st Edition

Authors: Amanda Chetwynd Peter Diggle
eBook ISBN: 9780080928609
Paperback ISBN: 9780340610473
Imprint: Butterworth-Heinemann
Published Date: 17th September 1995
Page Count: 224
Tax/VAT will be calculated at check-out Price includes VAT (GST)
30% off
30% off
30% off
30% off
30% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
30% off
30% off
30% off
30% off
30% off
20% off
20% off
25% off
25% off
25% off
25% off
25% off
20% off
20% off
27.95
19.57
19.57
19.57
19.57
19.57
22.36
22.36
21.99
15.39
15.39
15.39
15.39
15.39
17.59
17.59
35.95
25.16
25.16
25.16
25.16
25.16
28.76
28.76
3300.00
2475.00
2475.00
2475.00
2475.00
2475.00
2640.00
2640.00
Unavailable
Price includes VAT (GST)
× DRM-Free

Easy - Download and start reading immediately. There’s no activation process to access eBooks; all eBooks are fully searchable, and enabled for copying, pasting, and printing.

Flexible - Read on multiple operating systems and devices. Easily read eBooks on smart phones, computers, or any eBook readers, including Kindle.

Open - Buy once, receive and download all available eBook formats, including PDF, EPUB, and Mobi (for Kindle).

Institutional Access

Secure Checkout

Personal information is secured with SSL technology.

Free Shipping

Free global shipping
No minimum order.

Table of Contents

  1. Logic - Introduction Truth tables Conditional propositions Quantifiers Types of proof Mathematical induction Project Summary. 2. Sets - Introduction Operations on sets De Morgan's Laws Power sets Inclusion-exclusion Products and partitions Finite and infinite Paradoxes Projects Summary. 3. Relations and Functions - Relations Equivalence relations Partial orders Diagrams of relations Functions One-one and onto Composition of functions The inverse of a function The pigeonhole principle Projects Summary. 4. Combinatorics - History Sum and product Premutations and combinations Pascal's triangle The binominal theorem Multinominals and rearrangements Projects Summary 5. Probability - Introduction Equally likely outcomes Experiments with outcomes which are not equally likely The sample space, outcomes and events Conditional probability, independence and Bayes' theorem Projects Summary. 6. Graphs - Introduction Definitions and examples Representations of graphs and graph isomorphism Paths, cycles and connectivity Trees Hamiltonian and Eulerian graphs Planar graphs Graph colouring Projects Summary Glossary Index.

Description

As an introduction to discrete mathematics, this text provides a straightforward overview of the range of mathematical techniques available to students. Assuming very little prior knowledge, and with the minimum of technical complication, it gives an account of the foundations of modern mathematics: logic; sets; relations and functions. It then develops these ideas in the context of three particular topics: combinatorics (the mathematics of counting); probability (the mathematics of chance) and graph theory (the mathematics of connections in networks).

Worked examples and graded exercises are used throughout to develop ideas and concepts. The format of this book is such that it can be easily used as the basis for a complete modular course in discrete mathematics.

Readership

First and second year undergraduate mathematicians. Also suitable for first year undergraduates in engineering, computer science and physical science.


Details

No. of pages:
224
Language:
English
Copyright:
© Butterworth-Heinemann 2003
Published:
Imprint:
Butterworth-Heinemann
eBook ISBN:
9780080928609
Paperback ISBN:
9780340610473

About the Authors

Amanda Chetwynd Author

Affiliations and Expertise

University of Lancaster, UK

Peter Diggle Author

Affiliations and Expertise

University of Lancaster, UK