Counting: The Art of Enumerative Combinatorics

Author:   George E. Martin
Publisher:   Springer-Verlag New York Inc.
Edition:   2001 ed.
ISBN:  

9780387952253


Pages:   252
Publication Date:   21 June 2001
Format:   Hardback
Availability:   Awaiting stock   Availability explained
The supplier is currently out of stock of this item. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out for you.

Our Price $197.87 Quantity:  
Add to Cart

Share |

Counting: The Art of Enumerative Combinatorics


Add your own review!

Overview

Full Product Details

Author:   George E. Martin
Publisher:   Springer-Verlag New York Inc.
Imprint:   Springer-Verlag New York Inc.
Edition:   2001 ed.
Dimensions:   Width: 15.60cm , Height: 1.50cm , Length: 23.40cm
Weight:   1.220kg
ISBN:  

9780387952253


ISBN 10:   038795225
Pages:   252
Publication Date:   21 June 2001
Audience:   College/higher education ,  Professional and scholarly ,  Undergraduate ,  Postgraduate, Research & Scholarly
Format:   Hardback
Publisher's Status:   Active
Availability:   Awaiting stock   Availability explained
The supplier is currently out of stock of this item. It will be ordered for you and placed on backorder. Once it does come back in stock, we will ship it out for you.

Table of Contents

Reviews

From the reviews: Much of Martin's charming and accessible text could be used with bright school students. ... The book is rounded off by a section called `The back of the book' which includes solutions and discussion of many exercises. George E. Martin is a remarkable writer who brings combinatorics alive. He has written a splendid introduction that requires very few prerequisites, yet soon delivers the reader into some highly effective methods of counting. The book is highly recommended. (S. C. Russen, The Mathematical Gazette, Vol. 88 (551), 2004) This truly is an undergraduate mathematics text; parts of it could be the text for a high school combinatorics course. The author has made a successful effort to illuminate and teach the elementary parts of combinatorics. He uses examples and problems to teach; there are 245 problems in Chapter 1! ... If I were not retired and had been asked to teach an undergraduate course in combinatorics, I would have liked to use this book. (W. Moser, Mathematical Reviews, Issue 2002 g) This book is a nice textbook on enumerative combinatorics to undergraduates. It introduces the most important ideas ... . A lot of `easy' applications are given and homework is listed (with hints). The book also touches some elementary graph enumeration problems. The text is clear and easy to follow. It is even suitable to learn it alone, which is also aided by nice exam problems. (Peter L. Erdoes, Zentralblatt MATH, Vol. 968, 2001) The teaching of topics in discrete mathematics is becoming increasingly popular and this text contains chapters on a number of pertinent areas for exposure at an elementary level. ... The author uses non-worked discovery-type examples to lead into observations about the material. ... There are many interesting exercises for the student to attempt. These are spread throughout the various chapters and are effective in developing interest in the topics. The book contains a `Back of the Book' section rather than an Answers section. (M. J. Williams, The Australian Mathematical Society Gazette, Vol. 29 (1), 2002)


From the reviews: <p> Much of Martina (TM)s charming and accessible text could be used with bright school students. a ] The book is rounded off by a section called a ~The back of the booka (TM) which includes solutions and discussion of many exercises. George E. Martin is a remarkable writer who brings combinatorics alive. He has written a splendid introduction that requires very few prerequisites, yet soon delivers the reader into some highly effective methods of counting. The book is highly recommended. (S. C. Russen, The Mathematical Gazette, Vol. 88 (551), 2004) <p> This truly is an undergraduate mathematics text; parts of it could be the text for a high school combinatorics course. The author has made a successful effort to illuminate and teach the elementary parts of combinatorics. He uses examples and problems to teach; there are 245 problems in Chapter 1! a ] If I were not retired and had been asked to teach an undergraduate course in combinatorics, I would have liked to use this book. (W. Moser, Mathematical Reviews, Issue 2002 g) <p> This book is a nice textbook on enumerative combinatorics to undergraduates. It introduces the most important ideas a ] . A lot of a ~easya (TM) applications are given and homework is listed (with hints). The book also touches some elementary graph enumeration problems. The text is clear and easy to follow. It is even suitable to learn it alone, which is also aided by nice exam problems. (PA(c)ter L. ErdAs, Zentralblatt MATH, Vol. 968, 2001) <p> The teaching of topics in discrete mathematics is becoming increasingly popular and this text contains chapters on a number of pertinent areas for exposure at an elementary level. a ] The author usesnon-worked discovery-type examples to lead into observations about the material. a ] There are many interesting exercises for the student to attempt. These are spread throughout the various chapters and are effective in developing interest in the topics. The book contains a a ~Back of the Booka (TM) section rather than an Answers section. (M. J. Williams, The Australian Mathematical Society Gazette, Vol. 29 (1), 2002)


From the reviews: Much of Martin's charming and accessible text could be used with bright school students. ... The book is rounded off by a section called `The back of the book' which includes solutions and discussion of many exercises. George E. Martin is a remarkable writer who brings combinatorics alive. He has written a splendid introduction that requires very few prerequisites, yet soon delivers the reader into some highly effective methods of counting. The book is highly recommended. (S. C. Russen, The Mathematical Gazette, Vol. 88 (551), 2004) This truly is an undergraduate mathematics text; parts of it could be the text for a high school combinatorics course. The author has made a successful effort to illuminate and teach the elementary parts of combinatorics. He uses examples and problems to teach; there are 245 problems in Chapter 1! ... If I were not retired and had been asked to teach an undergraduate course in combinatorics, I would have liked to use this book. (W. Moser, Mathematical Reviews, Issue 2002 g) This book is a nice textbook on enumerative combinatorics to undergraduates. It introduces the most important ideas ... . A lot of `easy' applications are given and homework is listed (with hints). The book also touches some elementary graph enumeration problems. The text is clear and easy to follow. It is even suitable to learn it alone, which is also aided by nice exam problems. (Peter L. Erdoes, Zentralblatt MATH, Vol. 968, 2001) The teaching of topics in discrete mathematics is becoming increasingly popular and this text contains chapters on a number of pertinent areas for exposure at an elementary level. ... The author uses non-worked discovery-type examples to lead into observations about the material. ... There are many interesting exercises for the student to attempt. These are spread throughout the various chapters and are effective in developing interest in the topics. The book contains a `Back of the Book' section rather than an Answers section. (M. J. Williams, The Australian Mathematical Society Gazette, Vol. 29 (1), 2002)


From the reviews: Much of Martin's charming and accessible text could be used with bright school students. ... The book is rounded off by a section called 'The back of the book' which includes solutions and discussion of many exercises. George E. Martin is a remarkable writer who brings combinatorics alive. He has written a splendid introduction that requires very few prerequisites, yet soon delivers the reader into some highly effective methods of counting. The book is highly recommended. (S. C. Russen, The Mathematical Gazette, Vol. 88 (551), 2004) This truly is an undergraduate mathematics text; parts of it could be the text for a high school combinatorics course. The author has made a successful effort to illuminate and teach the elementary parts of combinatorics. He uses examples and problems to teach; there are 245 problems in Chapter 1! ... If I were not retired and had been asked to teach an undergraduate course in combinatorics, I would have liked to use this book. (W. Moser, Mathematical Reviews, Issue 2002 g) This book is a nice textbook on enumerative combinatorics to undergraduates. It introduces the most important ideas ... . A lot of 'easy' applications are given and homework is listed (with hints). The book also touches some elementary graph enumeration problems. The text is clear and easy to follow. It is even suitable to learn it alone, which is also aided by nice exam problems. (Peter L. Erdos, Zentralblatt MATH, Vol. 968, 2001) The teaching of topics in discrete mathematics is becoming increasingly popular and this text contains chapters on a number of pertinent areas for exposure at an elementary level. ... The author uses non-worked discovery-type examples to lead into observations about the material. ... There are many interesting exercises for the student to attempt. These are spread throughout the various chapters and are effective in developing interest in the topics. The book contains a 'Back of the Book' section rather than an Answers section. (M. J. Williams, The Australian Mathematical Society Gazette, Vol. 29 (1), 2002)


"From the reviews: ""Much of Martin’s charming and accessible text could be used with bright school students. … The book is rounded off by a section called ‘The back of the book’ which includes solutions and discussion of many exercises. George E. Martin is a remarkable writer who brings combinatorics alive. He has written a splendid introduction that requires very few prerequisites, yet soon delivers the reader into some highly effective methods of counting. The book is highly recommended."" (S. C. Russen, The Mathematical Gazette, Vol. 88 (551), 2004) ""This truly is an undergraduate mathematics text; parts of it could be the text for a high school combinatorics course. The author has made a successful effort to illuminate and teach the elementary parts of combinatorics. He uses examples and problems to teach; there are 245 problems in Chapter 1! … If I were not retired and had been asked to teach an undergraduate course in combinatorics, I would have liked to use this book."" (W. Moser, Mathematical Reviews, Issue 2002 g) ""This book is a nice textbook on enumerative combinatorics to undergraduates. It introduces the most important ideas … . A lot of ‘easy’ applications are given and homework is listed (with hints). The book also touches some elementary graph enumeration problems. The text is clear and easy to follow. It is even suitable to learn it alone, which is also aided by nice exam problems."" (Péter L. Erdös, Zentralblatt MATH, Vol. 968, 2001) ""The teaching of topics in discrete mathematics is becoming increasingly popular and this text contains chapters on a number of pertinent areas for exposure at an elementary level. … The author uses non-worked discovery-type examples to lead into observations about the material. … There are many interesting exercises for the student to attempt. These are spread throughout the various chapters and are effective in developing interest in the topics. The book contains a‘Back of the Book’ section rather than an Answers section."" (M. J. Williams, The Australian Mathematical Society Gazette, Vol. 29 (1), 2002)"


From the reviews: Much of Martin's charming and accessible text could be used with bright school students. ... The book is rounded off by a section called 'The back of the book' which includes solutions and discussion of many exercises. George E. Martin is a remarkable writer who brings combinatorics alive. He has written a splendid introduction that requires very few prerequisites, yet soon delivers the reader into some highly effective methods of counting. The book is highly recommended. (S. C. Russen, The Mathematical Gazette, Vol. 88 (551), 2004) This truly is an undergraduate mathematics text; parts of it could be the text for a high school combinatorics course. The author has made a successful effort to illuminate and teach the elementary parts of combinatorics. He uses examples and problems to teach; there are 245 problems in Chapter 1! ... If I were not retired and had been asked to teach an undergraduate course in combinatorics, I would have liked to use this book. (W. Moser, Mathematical Reviews, Issue 2002 g) This book is a nice textbook on enumerative combinatorics to undergraduates. It introduces the most important ideas ... . A lot of 'easy' applications are given and homework is listed (with hints). The book also touches some elementary graph enumeration problems. The text is clear and easy to follow. It is even suitable to learn it alone, which is also aided by nice exam problems. (Peter L. Erdoes, Zentralblatt MATH, Vol. 968, 2001) The teaching of topics in discrete mathematics is becoming increasingly popular and this text contains chapters on a number of pertinent areas for exposure at an elementary level. ... The author uses non-worked discovery-type examples to lead into observations about the material. ... There are many interesting exercises for the student to attempt. These are spread throughout the various chapters and are effective in developing interest in the topics. The book contains a 'Back of the Book' section rather than an Answers section. (M. J. Williams, The Australian Mathematical Society Gazette, Vol. 29 (1), 2002)


Author Information

From the reviews: ""Much of Martin's charming and accessible text could be used with bright school students. ... The book is rounded off by a section called 'The back of the book' which includes solutions and discussion of many exercises. George E. Martin is a remarkable writer who brings combinatorics alive. He has written a splendid introduction that requires very few prerequisites, yet soon delivers the reader into some highly effective methods of counting. The book is highly recommended."" (S. C. Russen, The Mathematical Gazette, Vol. 88 (551), 2004) ""This truly is an undergraduate mathematics text; parts of it could be the text for a high school combinatorics course. The author has made a successful effort to illuminate and teach the elementary parts of combinatorics. He uses examples and problems to teach; there are 245 problems in Chapter 1! ... If I were not retired and had been asked to teach an undergraduate course in combinatorics, I would have liked to use this book."" (W. Moser, Mathematical Reviews, Issue 2002 g) ""This book is a nice textbook on enumerative combinatorics to undergraduates. It introduces the most important ideas ... . A lot of 'easy' applications are given and homework is listed (with hints). The book also touches some elementary graph enumeration problems. The text is clear and easy to follow. It is even suitable to learn it alone, which is also aided by nice exam problems."" (Peter L. Erdos, Zentralblatt MATH, Vol. 968, 2001) ""The teaching of topics in discrete mathematics is becoming increasingly popular and this text contains chapters on a number of pertinent areas for exposure at an elementary level. ... The author uses non-worked discovery-type examples to lead into observations about the material. ... There are many interesting exercises for the student to attempt. These are spread throughout the various chapters and are effective in developing interest in the topics. The book contains a 'Back of the Book' section rather than an Answers section."" (M. J. Williams, The Australian Mathematical Society Gazette, Vol. 29 (1), 2002)

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
Shopping cart
Mailing List