Invitation to discrete mathematics
Author(s)
Bibliographic Information
Invitation to discrete mathematics
Oxford University Press, 2009
2nd ed
- : hbk
- : pbk
Available at / 20 libraries
-
: hbk410||MA2009002879,0020090028797,
: pbk410||MA2010002219,0020100022182,0020100022197 -
No Libraries matched.
- Remove all filters.
Note
Includes bibliographical references and index
Description and Table of Contents
- Volume
-
: pbk ISBN 9780198570424
Description
This second edition of Invitation to Discrete Mathematics is a clear and self-contained introduction to discrete mathematics. Aimed mainly at undergraduate and early graduate students of mathematics and computer science, it is written with the goal of stimulating interest in mathematics and an active, problem-solving approach to the presented material. The reader is led to an understanding of the basic principles and methods of actually doing mathematics
(and having fun at that). By focussing on a more selective range of topics than many discrete mathematics textbooks, allowing greater depth of treatment using a number of different approaches, the book reflects the conviction of the authors, active and internationally renowned mathematicians, that the most
important gain from studying mathematics is the cultivation of clear and logical thinking and habits useful for attacking new problems. More than 400 enclosed exercises with a wide range of difficulty, many of them accompanied by hints for solution, support this approach to teaching. The readers will appreciate the lively and informal style of the text accompanied by more than 200 drawings and diagrams. Specialists in various parts of science with a basic mathematical education wishing to apply
discrete mathematics in their field can use the book as a useful source, and even experts in combinatorics may occasionally learn from pointers to research literature or from presentations of recent results. Invitation to Discrete Mathematics should make delightful reading both for beginners and for
mathematical professionals.
The main topics include: elementary counting problems, asymptotic estimates, partially ordered sets, basic graph theory and graph algorithms, finite projective planes, elementary probability and the probabilistic method, generating functions, Ramsey's theorem, and combinatorial applications of linear algebra. General mathematical notions going beyond the high-school level are thoroughly explained in the introductory chapter. An appendix summarizes the undergraduate algebra needed in some of
the more advanced sections of the book.
Table of Contents
- PREFACE TO THE SECOND EDITION
- PREFACE TO THE FIRST EDITION
- APPENDIX
- BIBLIOGRAPHY
- HINTS TO SELECTED EXERCISES
- INDEX
- Volume
-
: hbk ISBN 9780198570431
Description
This book is a clear and self-contained introduction to discrete mathematics. Aimed mainly at undergraduate and early graduate students of mathematics and computer science, it is written with the goal of stimulating interest in mathematics and an active, problem-solving approach to the presented material. The reader is led to an understanding of the basic principles and methods of actually doing mathematics (and having fun at that). Being more narrowly focused than
many discrete mathematics textbooks and treating selected topics in an unusual depth and from several points of view, the book reflects the conviction of the authors, active and internationally renowned mathematicians, that the most important gain from studying mathematics is the cultivation of clear
and logical thinking and habits useful for attacking new problems. More than 400 enclosed exercises with a wide range of difficulty, many of them accompanied by hints for solution, support this approach to teaching. The readers will appreciate the lively and informal style of the text accompanied by more than 200 drawings and diagrams. Specialists in various parts of science with a basic mathematical education wishing to apply discrete mathematics in their field can use the book as a useful
source, and even experts in combinatorics may occasionally learn from pointers to research literature or from presentations of recent results. Invitation to Discrete Mathematics should make a delightful reading both for beginners and for mathematical professionals.
The main topics include: elementary counting problems, asymptotic estimates, partially ordered sets, basic graph theory and graph algorithms, finite projective planes, elementary probability and the probabilistic method, generating functions, Ramsey's theorem, and combinatorial applications of linear algebra. General mathematical notions going beyond the high-school level are thoroughly explained in the introductory chapter. An appendix summarizes the undergraduate algebra needed in some of
the more advanced sections of the book.
Table of Contents
- PREFACE TO THE SECOND EDITION
- PREFACE TO THE FIRST EDITION
- APPENDIX
- BIBLIOGRAPHY
- HINTS TO SELECTED EXERCISES
- INDEX
by "Nielsen BookData"
