Like masterpieces of art, music, and literature, great mathematical theorems are creative milestones, works of genius destined to last forever. Now William Dunham gives them the attention they deserve. Dunham places each theorem within its historical context and explores the very human and often turbulent life of the creator — from Archimedes, the absentminded theoretician whose absorption in his work often precluded eating or bathing, to Gerolamo Cardano, the sixteenth-century mathematician whose accomplishments flourished despite a bizarre array of misadventures, to the paranoid genius of modern times, Georg Cantor. He also provides step-by-step proofs for the theorems, each easily accessible to readers with no more than a knowledge of high school mathematics. A rare combination of the historical, biographical, and mathematical, Journey Through Genius is a fascinating introduction to a neglected field of human creativity. “It is mathematics presented as a series of works of art; a fascinating lingering over individual examples of ingenuity and insight. It is mathematics by lightning flash.” —Isaac Asimov
This epoch-making and monumental work on Vedic Mathematics unfolds a new method of approach. It relates to the truth of numbers and magnitudes equally applicable to all sciences and arts. The book brings to light how great and true knowledge is born of intuition, quite different from modern Western method. The ancient Indian method and its secret techniques are examined and shown to be capable of solving various problems of mathematics. The universe we live in has a basic mathematical structure obeying the rules of mathematical measures and relations. All the subjects in mathematics-Multiplication, Division, Factorization, Equations, Calculus, Analytical Conics, etc.-are dealt with in forty chapters, vividly working out all problems, in the easiest ever method discovered so far. The volume, more a 'magic', is the result of intuitional visualization of fundamental mathematical truths born after eight years of highly concentrated endeavour of Jagadguru Sri Bharati Krsna Tirtha.
A foundational work on historical and social studies of quantification What accounts for the prestige of quantitative methods? The usual answer is that quantification is desirable in social investigation as a result of its successes in science. Trust in Numbers questions whether such success in the study of stars, molecules, or cells should be an attractive model for research on human societies, and examines why the natural sciences are highly quantitative in the first place. Theodore Porter argues that a better understanding of the attractions of quantification in business, government, and social research brings a fresh perspective to its role in psychology, physics, and medicine. Quantitative rigor is not inherent in science but arises from political and social pressures, and objectivity derives its impetus from cultural contexts. In a new preface, the author sheds light on the current infatuation with quantitative methods, particularly at the intersection of science and bureaucracy.
Mathematical Recreations and Essays W. W. Rouse Ball For nearly a century, this sparkling classic has provided stimulating hours of entertainment to the mathematically inclined. The problems posed here often involve fundamental mathematical methods and notions, but their chief appeal is their capacity to tease and delight. In these pages you will find scores of "recreations" to amuse you and to challenge your problem-solving faculties-often to the limit. Now in its 13th edition, Mathematical Recreations and Essays has been thoroughly revised and updated over the decades since its first publication in 1892. This latest edition retains all the remarkable character of the original, but the terminology and treatment of some problems have been updated and new material has been added. Among the challenges in store for you: Arithmetical and geometrical recreations; Polyhedra; Chess-board recreations; Magic squares; Map-coloring problems; Unicursal problems; Cryptography and cryptanalysis; Calculating prodigies; ... and more. You'll even find problems which mathematical ingenuity can solve but the computer cannot. No knowledge of calculus or analytic geometry is necessary to enjoy these games and puzzles. With basic mathematical skills and the desire to meet a challenge you can put yourself to the test and win. "A must to add to your mathematics library."-The Mathematics Teacher We are delighted to publish this classic book as part of our extensive Classic Library collection. Many of the books in our collection have been out of print for decades, and therefore have not been accessible to the general public. The aim of our publishing program is to facilitate rapid access to this vast reservoir of literature, and our view is that this is a significant literary work, which deserves to be brought back into print after many decades. The contents of the vast majority of titles in the Classic Library have been scanned from the original works. To ensure a high quality product, each title has been meticulously hand curated by our staff. Our philosophy has been guided by a desire to provide the reader with a book that is as close as possible to ownership of the original work. We hope that you will enjoy this wonderful classic work, and that for you it becomes an enriching experience.
In August 1859 Bernhard Riemann, a little-known 32-year old mathematician, presented a paper to the Berlin Academy titled: "On the Number of Prime Numbers Less Than a Given Quantity." In the middle of that paper, Riemann made an incidental remark â€" a guess, a hypothesis. What he tossed out to the assembled mathematicians that day has proven to be almost cruelly compelling to countless scholars in the ensuing years. Today, after 150 years of careful research and exhaustive study, the question remains. Is the hypothesis true or false? Riemann's basic inquiry, the primary topic of his paper, concerned a straightforward but nevertheless important matter of arithmetic â€" defining a precise formula to track and identify the occurrence of prime numbers. But it is that incidental remark â€" the Riemann Hypothesis â€" that is the truly astonishing legacy of his 1859 paper. Because Riemann was able to see beyond the pattern of the primes to discern traces of something mysterious and mathematically elegant shrouded in the shadows â€" subtle variations in the distribution of those prime numbers. Brilliant for its clarity, astounding for its potential consequences, the Hypothesis took on enormous importance in mathematics. Indeed, the successful solution to this puzzle would herald a revolution in prime number theory. Proving or disproving it became the greatest challenge of the age. It has become clear that the Riemann Hypothesis, whose resolution seems to hang tantalizingly just beyond our grasp, holds the key to a variety of scientific and mathematical investigations. The making and breaking of modern codes, which depend on the properties of the prime numbers, have roots in the Hypothesis. In a series of extraordinary developments during the 1970s, it emerged that even the physics of the atomic nucleus is connected in ways not yet fully understood to this strange conundrum. Hunting down the solution to the Riemann Hypothesis has become an obsession for many â€" the veritable "great white whale" of mathematical research. Yet despite determined efforts by generations of mathematicians, the Riemann Hypothesis defies resolution. Alternating passages of extraordinarily lucid mathematical exposition with chapters of elegantly composed biography and history, Prime Obsession is a fascinating and fluent account of an epic mathematical mystery that continues to challenge and excite the world. Posited a century and a half ago, the Riemann Hypothesis is an intellectual feast for the cognoscenti and the curious alike. Not just a story of numbers and calculations, Prime Obsession is the engrossing tale of a relentless hunt for an elusive proof â€" and those who have been consumed by it.
Metamath is a computer language and an associated computer program for archiving, verifying, and studying mathematical proofs. The Metamath language is simple and robust, with an almost total absence of hard-wired syntax, and we believe that it provides about the simplest possible framework that allows essentially all of mathematics to be expressed with absolute rigor. While simple, it is also powerful; the Metamath Proof Explorer (MPE) database has over 23,000 proven theorems and is one of the top systems in the "Formalizing 100 Theorems" challenge. This book explains the Metamath language and program, with specific emphasis on the fundamentals of the MPE database.