Martin J. Erickson - Böcker
Visar alla böcker från författaren Martin J. Erickson. Handla med fri frakt och snabb leverans.
2 produkter
2 produkter
1 135 kr
Skickas inom 7-10 vardagar
Presents a clear bridge between mathematics and the liberal arts Mathematics for the Liberal Arts provides a comprehensible and precise introduction to modern mathematics intertwined with the history of mathematical discoveries. The book discusses mathematical ideas in the context of the unfolding story of human thought and highlights the application of mathematics in everyday life.Divided into two parts, Mathematics for the Liberal Arts first traces the history of mathematics from the ancient world to the Middle Ages, then moves on to the Renaissance and finishes with the development of modern mathematics. In the second part, the book explores major topics of calculus and number theory, including problem-solving techniques and real-world applications. This book emphasizes learning through doing, presents a practical approach, and features: A detailed explanation of why mathematical principles are true and how the mathematical processes workNumerous figures and diagrams as well as hundreds of worked examples and exercises, aiding readers to further visualize the presented conceptsVarious real-world practical applications of mathematics, including error-correcting codes and the space shuttle programVignette biographies of renowned mathematiciansAppendices with solutions to selected exercises and suggestions for further readingMathematics for the Liberal Arts is an excellent introduction to the history and concepts of mathematics for undergraduate liberal arts students and readers in non-scientific fields wishing to gain a better understanding of mathematics and mathematical problem-solving skills.
Del 78 - Wiley Series in Discrete Mathematics and Optimization
Introduction to Combinatorics
Inbunden, Engelska, 2013
1 408 kr
Skickas inom 5-8 vardagar
Praise for the First Edition “This excellent text should prove a useful accoutrement for any developing mathematics program . . . it’s short, it’s sweet, it’s beautifully written.” —The Mathematical Intelligencer“Erickson has prepared an exemplary work . . . strongly recommended for inclusion in undergraduate-level library collections.” —ChoiceFeaturing a modern approach, Introduction to Combinatorics, Second Edition illustrates the applicability of combinatorial methods and discusses topics that are not typically addressed in literature, such as Alcuin’s sequence, Rook paths, and Leech’s lattice. The book also presents fundamental results, discusses interconnection and problem-solving techniques, and collects and disseminates open problems that raise questions and observations.Many important combinatorial methods are revisited and repeated several times throughout the book in exercises, examples, theorems, and proofs alike, allowing readers to build confidence and reinforce their understanding of complex material. In addition, the author successfully guides readers step-by-step through three major achievements of combinatorics: Van der Waerden’s theorem on arithmetic progressions, Pólya’s graph enumeration formula, and Leech’s 24-dimensional lattice. Along with updated tables and references that reflect recent advances in various areas, such as error-correcting codes and combinatorial designs, the Second Edition also features: Many new exercises to help readers understand and apply combinatorial techniques and ideasA deeper, investigative study of combinatorics through exercises requiring the use of computer programsOver fifty new examples, ranging in level from routine to advanced, that illustrate important combinatorial conceptsBasic principles and theories in combinatorics as well as new and innovative results in the fieldIntroduction to Combinatorics, Second Edition is an ideal textbook for a one- or two-semester sequence in combinatorics, graph theory, and discrete mathematics at the upper-undergraduate level. The book is also an excellent reference for anyone interested in the various applications of elementary combinatorics.