Traditional mathematics teaching is largely about solving exactly stated problems exactly, yet life often hands us partly defined problems needing only moderately accurate solutions. This engaging book is an antidote to the rigor mortis brought on by too much mathematical rigor, teaching us how to guess answers without needing a proof or an exact calculation.In Street-Fighting Mathematics, Sanjoy Mahajan builds, sharpens, and demonstrates tools for educated guessing and down-and-dirty, opportunistic problem solving across diverse fields of knowledge--from mathematics to management. Mahajan describes six tools: dimensional analysis, easy cases, lumping, picture proofs, successive approximation, and reasoning by analogy. Illustrating each tool with numerous examples, he carefully separates the tool--the general principle--from the particular application so that the reader can most easily grasp the tool itself to use on problems of particular interest. Street-Fighting Mathematics grew out of a short course taught by the author at MIT for students ranging from first-year undergraduates to graduate students ready for careers in physics, mathematics, management, electrical engineering, computer science, and biology. They benefited from an approach that avoided rigor and taught them how to use mathematics to solve real problems.Street-Fighting Mathematics will appear in print and online under a Creative Commons Noncommercial Share Alike license.

    Indeed, such equations are crucial to mathematical physics. Although simplifications can be made that reduce these equations to ordinary differential equations, nevertheless the complete description of physical systems resides in the general area of partial differential equations.This highly useful text shows the reader how to formulate a partial differential equation from the physical problem (constructing the mathematical model) and how to solve the equation (along with initial and boundary conditions). Written for advanced undergraduate and graduate students, as well as professionals working in the applied sciences, this clearly written book offers realistic, practical coverage of diffusion-type problems, hyperbolic-type problems, elliptic-type problems, and numerical and approximate methods. Each chapter contains a selection of relevant problems (answers are provided) and suggestions for further reading.

    Rare Book

    The stories show that, as James Gleick puts it in the foreword, "inspiration strikes willy-nilly." One researcher thinks of quantum chaotic systems at a bus stop; another suddenly realizes a path to proving a theorem of number theory while in a friend's backyard; a statistician has a "bathroom sink epiphany" and discovers the key to solving the Gaussian correlation inequality. Readers of The Prime Number Conspiracy, says Quanta editor-in-chief Thomas Lin, are headed on "breathtaking intellectual journeys to the bleeding edge of discovery strapped to the narrative rocket of humanity's never-ending pursuit of knowledge."Quanta is the only popular publication that offers in-depth coverage of the latest breakthroughs in understanding our mathematical universe. It communicates mathematics by taking it seriously, wrestling with difficult concepts and clearly explaining them in a way that speaks to our innate curiosity about our world and ourselves. Readers of this volume will learn that prime numbers have decided preferences about the final digits of the primes that immediately follow them (the "conspiracy" of the title); consider whether math is the universal language of nature (allowing for "a unified theory of randomness"); discover surprising solutions (including a pentagon tiling proof that solves a century-old math problem); ponder the limits of computation; measure infinity; and explore the eternal question "Is mathematics good for you?"ContributorsAriel Bleicher, Robbert Dijkgraaf, Kevin Hartnett, Erica Klarreich, Thomas Lin, John Pavlus, Siobhan Roberts, Natalie WolchoverCopublished with Quanta Magazine

    Johnson. It was the first book exclusively on the theory of NP-completeness and computational intractability. The book features an appendix providing a thorough compendium of NP-complete problems (which was updated in later printings of the book). The book is now outdated in some respects as it does not cover more recent development such as the PCP theorem. It is nevertheless still in print and is regarded as a classic: in a 2006 study, the CiteSeer search engine listed the book as the most cited reference in computer science literature.

    Many of these students are extremely intelligent and hardworking, but even the best will, at some point, struggle with the demands of making the transition to advanced mathematics. Some have difficulty adjusting to independent study and to learning from lectures. Other struggles, however, are more fundamental: the mathematics shifts in focus from calculation to proof, so students are expected to interact with it in different ways. These changes need not be mysterious - mathematics education research has revealed many insights into the adjustments that are necessary - but they are not obvious and they do need explaining.This no-nonsense book translates these research-based insights into practical advice for a student audience. It covers every aspect of studying for a mathematics degree, from the most abstract intellectual challenges to the everyday business of interacting with lecturers and making good use of study time. Part 1 provides an in-depth discussion of advanced mathematical thinking, and explains how a student will need to adapt and extend their existing skills in order to develop a good understanding of undergraduate mathematics. Part 2 covers study skills as these relate to the demands of a mathematics degree. It suggests practical approaches to learning from lectures and to studying for examinations while also allowing time for a fulfilling all-round university experience.The first subject-specific guide for students, this friendly, practical text will be essential reading for anyone studying mathematics at university.

    Feynman gave his famous course on computation at the California Institute of Technology, he asked Tony Hey to adapt his lecture notes into a book. Although led by Feynman, the course also featured, as occasional guest speakers, some of the most brilliant men in science at that time, including Marvin Minsky, Charles Bennett, and John Hopfield. Although the lectures are now thirteen years old, most of the material is timeless and presents a “Feynmanesque” overview of many standard and some not-so-standard topics in computer science such as reversible logic gates and quantum computers.

    The author of What Is the Name of This Book? presents a compilation of more than two hundred challenging new logic puzzles--ranging from simple brainteasers to complex mathematical paradoxes.

    Focused on helping students understand and construct proofs and expanding their mathematical maturity, this best-selling text is an accessible introduction to discrete mathematics. Johnsonbaugh's algorithmic approach emphasizes problem-solving techniques. The Seventh Edition reflects user and reviewer feedback on both content and organization.

    This work represents the views of a mathematician on the analogies between computing machines and the living human brain.

    From man's first act of counting to higher mathematics, from the smallest living creature to the dazzling reaches of outer space, Asimov is a master at "explaining complex material better than any other living person." (The New York Times) You'll learn: HOW to make a trillion seem small; WHY imaginary numbers are real; THE real size of the universe - in photons; WHY the zero isn't "good for nothing;" AND many other marvelous discoveries, in ASIMOV ON NUMBERS.

    Selected for originality, general interest, or because they demonstrate valuable techniques, the problems are ideal as a supplement to courses in probability or statistics, or as stimulating recreation for the mathematically minded. Detailed solutions. Illustrated.

    In a self-contained manner it proceeds from mathematical and theoretical considerations to actual practical computer routines. With over 100 new routines bringing the total to well over 300, plus upgraded versions of the original routines, the new edition remains the most practical, comprehensive handbook of scientific computing available today.

    Sipser's candid, crystal-clear style allows students at every level to understand and enjoy this field. His innovative "proof idea" sections explain profound concepts in plain English. The new edition incorporates many improvements students and professors have suggested over the years, and offers updated, classroom-tested problem sets at the end of each chapter.

    But from the perspective of mathematics, groupings of ten are arbitrary, and can have serious shortcomings. Twelve would be better for divisibility, and eight is smaller and well suited to repeated halving. Grouping by two, as in binary code, has turned out to have its own remarkable advantages.Paul Lockhart reveals arithmetic not as the rote manipulation of numbers--a practical if mundane branch of knowledge best suited for balancing a checkbook or filling out tax forms--but as a set of ideas that exhibit the fascinating and sometimes surprising behaviors usually reserved for higher branches of mathematics. The essence of arithmetic is the skillful arrangement of numerical information for ease of communication and comparison, an elegant intellectual craft that arises from our desire to count, add to, take away from, divide up, and multiply quantities of important things. Over centuries, humans devised a variety of strategies for representing and using numerical information, from beads and tally marks to adding machines and computers. Lockhart explores the philosophical and aesthetic nature of counting and of different number systems, both Western and non-Western, weighing the pluses and minuses of each.A passionate, entertaining survey of foundational ideas and methods, Arithmetic invites readers to experience the profound and simple beauty of its subject through the eyes of a modern research mathematician.