"synopsis" may belong to another edition of this title.
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)
"About this title" may belong to another edition of this title.
Shipping:
FREE
Within U.S.A.
Book Description Soft Cover. Condition: new. Seller Inventory # 9781441929150
Book Description Condition: New. Book is in NEW condition. Seller Inventory # 1441929150-2-1
Book Description Condition: New. New! This book is in the same immaculate condition as when it was published. Seller Inventory # 353-1441929150-new
Book Description Condition: New. Seller Inventory # ABLIING23Mar2411530294543
Book Description Condition: New. PRINT ON DEMAND Book; New; Fast Shipping from the UK. No. book. Seller Inventory # ria9781441929150_lsuk
Book Description Paperback. Condition: New. Seller Inventory # 6666-IUK-9781441929150
Book Description Taschenbuch. Condition: Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -This book provides an introduction to discrete mathematics. At the end of the book the reader should be able to answer counting questions such as: How many ways are there to stack n poker chips, each of which can be red, white, blue, or green, such that each red chip is adjacent to at least 1 green chip The book can be used as a textbook for a semester course at the sophomore level. The first five chapters can also serve as a basis for a graduate course for in-service teachers. Counting: The Art of Enumerative Combinatorics provides an introduction to discrete mathematics that addresses questions that begin, How many ways are there to.For example, ¿How many ways are there to order a collection of 12 ice cream cones if 8 flavors are available ¿ At the end of the book the reader should be able to answer such nontrivial counting questions as, ¿How many ways are there to color the faces of a cube if ¿k¿ colors are available with each face having exactly one color ¿ or ¿How many ways are there to stack ¿n¿ poker chips, each of which can be red, white, blue, or green, such that each red chip is adjacent to at least 1 green chip ¿ Since there are no prerequisites, this book can be used for college courses in combinatorics at the sophomore level for either computer science or mathematics students. The first five chapters have served as the basis for a graduate course for in-service teachers. Chapter 8 introduces graph theory. 268 pp. Englisch. Seller Inventory # 9781441929150
Book Description Paperback / softback. Condition: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Seller Inventory # C9781441929150
Book Description Paperback. Condition: New. Special order direct from the distributor Softcover reprint of hardcover 1st ed. 2001. Seller Inventory # ING9781441929150
Book Description Paperback. Condition: new. New. Fast Shipping and good customer service. Seller Inventory # Holz_New_1441929150