The algorithms you'll use most often as a programmer have already been discovered, tested, and proven. If you want to take a hard pass on Knuth's brilliant but impenetrable theories and the dense multi-page proofs you'll find in most textbooks, this is the book for you. This fully-illustrated and engaging guide makes it easy for you to learn how to use algorithms effectively in your own programs.Grokking Algorithms is a disarming take on a core computer science topic. In it, you'll learn how to apply common algorithms to the practical problems you face in day-to-day life as a programmer. You'll start with problems like sorting and searching. As you build up your skills in thinking algorithmically, you'll tackle more complex concerns such as data compression or artificial intelligence. Whether you're writing business software, video games, mobile apps, or system utilities, you'll learn algorithmic techniques for solving problems that you thought were out of your grasp. For example, you'll be able to:Write a spell checker using graph algorithmsUnderstand how data compression works using Huffman codingIdentify problems that take too long to solve with naive algorithms, and attack them with algorithms that give you an approximate answer insteadEach carefully-presented example includes helpful diagrams and fully-annotated code samples in Python. By the end of this book, you will know some of the most widely applicable algorithms as well as how and when to use them.

     The Science Book covers every area of science--astronomy, biology, chemistry, geology, math, and physics, and brings the greatest scientific ideas to life with fascinating text, quirky graphics, and pithy quotes.

    Dan Harris's Quantitative Chemical Analysis continues to be the most widely used  textbook for analytical chemistry.  It offers consistently modern portrait of the tools and techniques of chemical analysis, incorporating real data, spreadsheets, and a wealth of applications, all presented in a witty, personable style that engages students without compromising the  principles and depth necessary for a thorough and practical understanding.

    In this first anthology of its kind, Carey chooses accounts by scientists themselves--astronomers and physicists, biologists, chemists, psychologists--that are both arrestingly written and clear. Contributors include Carl Sagan, Charles Darwin, Stephen Jay Gould, Oliver Sacks, Lewis Thomas, Rachel Carson, Sigmund Freud, Henry David Thoreau, Mark Twain, and scores of others.

    With his trademark elegant prose, eye for lively detail, and gift for lucid explanation, Professor von Baeyer turns the contemplation of a cooling coffee cup into a beguiling portrait of the birth of a science with relevance to almost every aspect of our lives.

    It offers superior coverage of all key areas, including descriptive chemistry, MO theory, bonding, and physical inorganic chemistry. Chapter topics are presented in logical order and include: basic concepts; nuclear properties; an introduction to molecular symmetry; bonding in polyatomic molecules; structures and energetics of metallic and ionic solids; acids, bases, and ions in aqueous solution; reduction and oxidation; non-aqueous media; and hydrogen. Four special topic chapters, chosen for their currency and interest, conclude the book. For researchers seeking the latest information in the field of inorganic chemistry.

    Rich illustrations, systematic resumes, and extensive citations make it a valuable references source.

    David Peat explains the development and meaning of this Superstring Theory in a thoroughly readable, dramatic manner accessible to lay readers with no knowledge of mathematics. The consequences of the Superstring Theory are nothing less than astonishing.

    So it's not surprising that we persist in thinking that we're in with a chance, whether we're playing the lottery or working out the likelihood of extra-terrestrial life. In Chance, a (not entirely) random selection of the New Scientist's sharpest minds provide fascinating insights into luck, randomness, risk and probability. From the secrets of coincidence to placing the perfect bet, the science of random number generation to the surprisingly haphazard decisions of criminal juries, it will explore these, and many other, tantalising questions.Following on from the bestselling Nothing and Question Everything, this book will open your eyes to the weird and wonderful world of chance - and help you see when some things, in fact, aren't random at all.

    In this fascinating book, Mario Livio tells the tale of a number at the heart of that mystery: phi, or 1.6180339887...This curious mathematical relationship, widely known as "The Golden Ratio," was discovered by Euclid more than two thousand years ago because of its crucial role in the construction of the pentagram, to which magical properties had been attributed. Since then it has shown a propensity to appear in the most astonishing variety of places, from mollusk shells, sunflower florets, and rose petals to the shape of the galaxy. Psychological studies have investigated whether the Golden Ratio is the most aesthetically pleasing proportion extant, and it has been asserted that the creators of the Pyramids and the Parthenon employed it. It is believed to feature in works of art from Leonardo da Vinci's Mona Lisa to Salvador Dali's The Sacrament of the Last Supper, and poets and composers have used it in their works. It has even been found to be connected to the behavior of the stock market!The Golden Ratio is a captivating journey through art and architecture, botany and biology, physics and mathematics. It tells the human story of numerous phi-fixated individuals, including the followers of Pythagoras who believed that this proportion revealed the hand of God; astronomer Johannes Kepler, who saw phi as the greatest treasure of geometry; such Renaissance thinkers as mathematician Leonardo Fibonacci of Pisa; and such masters of the modern world as Goethe, Cezanne, Bartok, and physicist Roger Penrose. Wherever his quest for the meaning of phi takes him, Mario Livio reveals the world as a place where order, beauty, and eternal mystery will always coexist.From the Hardcover edition.

    By 1949, Godel had produced a remarkable proof: In any universe described by the Theory of Relativity, time cannot exist. Einstein endorsed this result reluctantly but he could find no way to refute it, since then, neither has anyone else. Yet cosmologists and philosophers alike have proceeded as if this discovery was never made. In A World Without Time, Palle Yourgrau sets out to restore Godel to his rightful place in history, telling the story of two magnificent minds put on the shelf by the scientific fashions of their day, and attempts to rescue the brilliant work they did together.

    In this book, Chris Bernhardt offers an introduction to quantum computing that is accessible to anyone who is comfortable with high school mathematics. He explains qubits, entanglement, quantum teleportation, quantum algorithms, and other quantum-related topics as clearly as possible for the general reader. Bernhardt, a mathematician himself, simplifies the mathematics as much as he can and provides elementary examples that illustrate both how the math works and what it means.Bernhardt introduces the basic unit of quantum computing, the qubit, and explains how the qubit can be measured; discusses entanglement--which, he says, is easier to describe mathematically than verbally--and what it means when two qubits are entangled (citing Einstein's characterization of what happens when the measurement of one entangled qubit affects the second as "spooky action at a distance"); and introduces quantum cryptography. He recaps standard topics in classical computing--bits, gates, and logic--and describes Edward Fredkin's ingenious billiard ball computer. He defines quantum gates, considers the speed of quantum algorithms, and describes the building of quantum computers. By the end of the book, readers understand that quantum computing and classical computing are not two distinct disciplines, and that quantum computing is the fundamental form of computing. The basic unit of computation is the qubit, not the bit.

    Heath's translation of the thirteen books of Euclid's Elements. In keeping with Green Lion's design commitment, diagrams have been placed on every spread for convenient reference while working through the proofs; running heads on every page indicate both Euclid's book number and proposition numbers for that page; and adequate space for notes is allowed between propositions and around diagrams. The all-new index has built into it a glossary of Euclid's Greek terms.Heath's translation has stood the test of time, and, as one done by a renowned scholar of ancient mathematics, it can be relied upon not to have inadvertantly introduced modern concepts or nomenclature. We have excised the voluminous historical and scholarly commentary that swells the Dover edition to three volumes and impedes classroom use of the original text. The single volume is not only more convenient, but less expensive as well.

    The first and only true textbook written by professors who teach the undergraduate course, it presents the most current concepts in an experimental context with clinical advances highlighted in boxes, supported by the kind of helpful pedagogical tools that other books do not provide.

    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."