"More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems."

    The Text Was Designed To Familiarize Students With The Foundations And Principles Of Computer Science And To Strengthen The Students' Ability To Carry Out Formal And Rigorous Mathematical Arguments. In The New Fourth Edition, Author Peter Linz Has Offered A Straightforward, Uncomplicated Treatment Of Formal Languages And Automata And Avoids Excessive Mathematical Detail So That Students May Focus On And Understand The Underlying Principles. In An Effort To Further The Accessibility And Comprehension Of The Text, The Author Has Added New Illustrative Examples Throughout.

    Drawing heavily on the author's own real-world experiences, the book stresses design and analysis. Coverage is divided into two parts, the first being a general guide to techniques for the design and analysis of computer algorithms. The second is a reference section, which includes a catalog of the 75 most important algorithmic problems. By browsing this catalog, readers can quickly identify what the problem they have encountered is called, what is known about it, and how they should proceed if they need to solve it. This book is ideal for the working professional who uses algorithms on a daily basis and has need for a handy reference. This work can also readily be used in an upper-division course or as a student reference guide. THE ALGORITHM DESIGN MANUAL comes with a CD-ROM that contains: * a complete hypertext version of the full printed book. * the source code and URLs for all cited implementations. * over 30 hours of audio lectures on the design and analysis of algorithms are provided, all keyed to on-line lecture notes.

    Readers are encouraged to do math rather than just study it. The author draws upon his experience as a coach for the International Mathematics Olympiad to give students an enhanced sense of mathematics and the ability to investigate and solve problems.

    Suitable for a two semester course in complex analysis, or as a supplementary text for an advanced course in function theory, this book aims to give students a good foundation of complex analysis and provides a basis for solving problems in mathematics, physics, engineering and many other sciences.

    This book charts its growth and development by sampling from the work of some of its foremost practitioners, beginning with Isaac Newton and Gottfried Wilhelm Leibniz in the late seventeenth century and continuing to Henri Lebesgue at the dawn of the twentieth--mathematicians whose achievements are comparable to those of Bach in music or Shakespeare in literature. William Dunham lucidly presents the definitions, theorems, and proofs. Students of literature read Shakespeare; students of music listen to Bach, he writes. But this tradition of studying the major works of the masters is, if not wholly absent, certainly uncommon in mathematics. This book seeks to redress that situation.Like a great museum, The Calculus Gallery is filled with masterpieces, among which are Bernoulli's early attack upon the harmonic series (1689), Euler's brilliant approximation of pi (1779), Cauchy's classic proof of the fundamental theorem of calculus (1823), Weierstrass's mind-boggling counterexample (1872), and Baire's original category theorem (1899). Collectively, these selections document the evolution of calculus from a powerful but logically chaotic subject into one whose foundations are thorough, rigorous, and unflinching--a story of genius triumphing over some of the toughest, most subtle problems imaginable.Anyone who has studied and enjoyed calculus will discover in these pages the sheer excitement each mathematician must have felt when pushing into the unknown. In touring The Calculus Gallery, we can see how it all came to be.

    Based on her work at the Santa Fe Institute and drawing on its interdisciplinary strategies, Mitchell brings clarity to the workings of complexity across a broad range of biological, technological, and social phenomena, seeking out the general principles or laws that apply to all of them. Richly illustrated, Complexity: A Guided Tour--winner of the 2010 Phi Beta Kappa Book Award in Science--offers a wide-ranging overview of the ideas underlying complex systems science, the current research at the forefront of this field, and the prospects for its contribution to solving some of the most important scientific questions of our time.

    Inside PFTB (Proofs from The Book) is indeed a glimpse of mathematical heaven, where clever insights and beautiful ideas combine in astonishing and glorious ways. There is vast wealth within its pages, one gem after another. Some of the proofs are classics, but many are new and brilliant proofs of classical results. ...Aigner and Ziegler... write: ..". all we offer is the examples that we have selected, hoping that our readers will share our enthusiasm about brilliant ideas, clever insights and wonderful observations." I do. ... " Notices of the AMS, August 1999..". the style is clear and entertaining, the level is close to elementary ... and the proofs are brilliant. ..." LMS Newsletter, January 1999This third edition offers two new chapters, on partition identities, and on card shuffling. Three proofs of Euler's most famous infinite series appear in a separate chapter. There is also a number of other improvements, such as an exciting new way to "enumerate the rationals."

    It provides a transition from elementary calculus to advanced courses in real and complex function theory and introduces the reader to some of the abstract thinking that pervades modern analysis.

    The authors are well-known for their clear presentation that makes the material accessible to a a broad audience and requires no special previous mathematical experience. KEY TOPICS: In this new edition, the authors incorporate a somewhat more informal, friendly writing style to present both classical and contemporary theories of computation. Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book. Each section is followed by problems.

    The study of knots has led to important applications in DNA research and the synthesis of new molecules, and has had a significant impact on statistical mechanics and quantum field theory. Colin Adams’s The Knot Book is the first book to make cutting-edge research in knot theory accessible to a non-specialist audience. Starting with the simplest knots, Adams guides readers through increasingly more intricate twists and turns of knot theory, exploring problems and theorems mathematicians can now solve, as well as those that remain open. He also explores how knot theory is providing important insights in biology, chemistry, physics, and other fields. The new paperback edition has been updated to include the latest research results, and includes hundreds of illustrations of knots, as well as worked examples, exercises and problems. With a simple piece of string, an elementary mathematical background, and The Knot Book, anyone can start learning about some of the most advanced ideas in contemporary mathematics.

    The novel approach taken here banishes determinants to the end of the book and focuses on the central goal of linear algebra: understanding the structure of linear operators on vector spaces. The author has taken unusual care to motivate concepts and to simplify proofs. For example, the book presents - without having defined determinants - a clean proof that every linear operator on a finite-dimensional complex vector space (or an odd-dimensional real vector space) has an eigenvalue. A variety of interesting exercises in each chapter helps students understand and manipulate the objects of linear algebra. This second edition includes a new section on orthogonal projections and minimization problems. The sections on self-adjoint operators, normal operators, and the spectral theorem have been rewritten. New examples and new exercises have been added, several proofs have been simplified, and hundreds of minor improvements have been made throughout the text.

    Rucker acquaints us with Godel's rotating universe, in which it is theoretically possible to travel into the past, and explains an interpretation of quantum mechanics in which billions of parallel worlds are produced every microsecond. It is in the realm of infinity, he maintains, that mathematics, science, and logic merge with the fantastic. By closely examining the paradoxes that arise from this merging, we can learn a great deal about the human mind, its powers, and its limitations.Using cartoons, puzzles, and quotations to enliven his text, Rucker guides us through such topics as the paradoxes of set theory, the possibilities of physical infinities, and the results of Godel's incompleteness theorems. His personal encounters with Godel the mathematician and philosopher provide a rare glimpse at genius and reveal what very few mathematicians have dared to admit: the transcendent implications of Platonic realism.

    

    Today, unfortunately, the traditional place of mathematics in education is in grave danger. The teaching and learning of mathematics has degenerated into the realm of rote memorization, the outcome of which leads to satisfactory formal ability but does not lead to real understanding or to greater intellectual independence. This new edition of Richard Courant's and Herbert Robbins's classic work seeks to address this problem. Its goal is to put the meaning back into mathematics.Written for beginners and scholars, for students and teachers, for philosophers and engineers, What is Mathematics? Second Edition is a sparkling collection of mathematical gems that offers an entertaining and accessible portrait of the mathematical world. Covering everything from natural numbers and the number system to geometrical constructions and projective geometry, from topology and calculus to matters of principle and the Continuum Hypothesis, this fascinating survey allows readers to delve into mathematics as an organic whole rather than an empty drill in problem solving. With chapters largely independent of one another and sections that lead upward from basic to more advanced discussions, readers can easily pick and choose areas of particular interest without impairing their understanding of subsequent parts.Brought up to date with a new chapter by Ian Stewart, What is Mathematics? Second Edition offers new insights into recent mathematical developments and describes proofs of the Four-Color Theorem and Fermat's Last Theorem, problems that were still open when Courant and Robbins wrote this masterpiece, but ones that have since been solved.Formal mathematics is like spelling and grammar - a matter of the correct application of local rules. Meaningful mathematics is like journalism - it tells an interesting story. But unlike some journalism, the story has to be true. The best mathematics is like literature - it brings a story to life before your eyes and involves you in it, intellectually and emotionally. What is Mathematics is like a fine piece of literature - it opens a window onto the world of mathematics for anyone interested to view.