Czerski provides the tools to alter the way we see everything around us by linking ordinary objects and occurrences, like popcorn popping, coffee stains, and fridge magnets, to big ideas like climate change, the energy crisis, or innovative medical testing. She provides answers to vexing questions: How do ducks keep their feet warm when walking on ice? Why does it take so long for ketchup to come out of a bottle? Why does milk, when added to tea, look like billowing storm clouds? In an engaging voice at once warm and witty, Czerski shares her stunning breadth of knowledge to lift the veil of familiarity from the ordinary.

    The fascinating tales in The Disappearing Spoon follow carbon, neon, silicon, gold and every single element on the table as they play out their parts in human history, finance, mythology, conflict, the arts, medicine and the lives of the (frequently) mad scientists who discovered them.Why did a little lithium (Li, 3) help cure poet Robert Lowell of his madness? And how did gallium (Ga, 31) become the go-to element for laboratory pranksters? The Disappearing Spoon has the answers, fusing science with the classic lore of invention, investigation, discovery and alchemy, from the big bang through to the end of time.

    Linear algebra is tightly integrated into the text.

    The book begins with the basic concepts of logic and set theory, to familiarize students with the language of mathematics and how it is interpreted. These concepts are used as the basis for a step-by-step breakdown of the most important techniques used in constructing proofs. To help students construct their own proofs, this new edition contains over 200 new exercises, selected solutions, and an introduction to Proof Designer software. No background beyond standard high school mathematics is assumed. Previous Edition Hb (1994) 0-521-44116-1 Previous Edition Pb (1994) 0-521-44663-5

    It allows one to gain information by discarding information, namely, the individuality of the observations. Stigler s second pillar, information measurement, challenges the importance of big data by noting that observations are not all equally important: the amount of information in a data set is often proportional to only the square root of the number of observations, not the absolute number. The third idea is likelihood, the calibration of inferences with the use of probability. Intercomparison is the principle that statistical comparisons do not need to be made with respect to an external standard. The fifth pillar is regression, both a paradox (tall parents on average produce shorter children; tall children on average have shorter parents) and the basis of inference, including Bayesian inference and causal reasoning. The sixth concept captures the importance of experimental design for example, by recognizing the gains to be had from a combinatorial approach with rigorous randomization. The seventh idea is the residual the notion that a complicated phenomenon can be simplified by subtracting the effect of known causes, leaving a residual phenomenon that can be explained more easily.The Seven Pillars of Statistical Wisdom presents an original, unified account of statistical science that will fascinate the interested layperson and engage the professional statistician."

    Joining the professional web designers and programmers are new audiences who need to know a little bit of code at work (update a content management system or e-commerce store) and those who want to make their personal blogs more attractive. Many books teaching HTML and CSS are dry and only written for those who want to become programmers, which is why this book takes an entirely new approach. • Introduces HTML and CSS in a way that makes them accessible to everyone—hobbyists, students, and professionals—and it’s full-color throughout • Utilizes information graphics and lifestyle photography to explain the topics in a simple way that is engaging • Boasts a unique structure that allows you to progress through the chapters from beginning to end or just dip into topics of particular interest at your leisureThis educational book is one that you will enjoy picking up, reading, then referring back to. It will make you wish other technical topics were presented in such a simple, attractive and engaging way!

    If you're a reasonably proficient programmer who can think logically, you have all the background you'll need. Stepanov and Rose introduce the relevant abstract algebra and number theory with exceptional clarity. They carefully explain the problems mathematicians first needed to solve, and then show how these mathematical solutions translate to generic programming and the creation of more effective and elegant code. To demonstrate the crucial role these mathematical principles play in many modern applications, the authors show how to use these results and generalized algorithms to implement a real-world public-key cryptosystem. As you read this book, you'll master the thought processes necessary for effective programming and learn how to generalize narrowly conceived algorithms to widen their usefulness without losing efficiency. You'll also gain deep insight into the value of mathematics to programming--insight that will prove invaluable no matter what programming languages and paradigms you use. You will learn aboutHow to generalize a four thousand-year-old algorithm, demonstrating indispensable lessons about clarity and efficiencyAncient paradoxes, beautiful theorems, and the productive tension between continuous and discreteA simple algorithm for finding greatest common divisor (GCD) and modern abstractions that build on itPowerful mathematical approaches to abstractionHow abstract algebra provides the idea at the heart of generic programmingAxioms, proofs, theories, and models: using mathematical techniques to organize knowledge about your algorithms and data structuresSurprising subtleties of simple programming tasks and what you can learn from themHow practical implementations can exploit theoretical knowledge

    Raymond M. Smullyan — a celebrated mathematician, logician, magician, and author — presents a logical labyrinth of more than 200 increasingly complex problems. The puzzles delve into Gödel’s undecidability theorem and other examples of the deepest paradoxes of logic and set theory. Detailed solutions follow each puzzle.

    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.

    Taking as territory everything from the Big Bang to the rise of civilization, Bryson seeks to understand how we got from there being nothing at all to there being us. To that end, he has attached himself to a host of the world’s most advanced (and often obsessed) archaeologists, anthropologists, and mathematicians, travelling to their offices, laboratories, and field camps. He has read (or tried to read) their books, pestered them with questions, apprenticed himself to their powerful minds. A Short History of Nearly Everything is the record of this quest, and it is a sometimes profound, sometimes funny, and always supremely clear and entertaining adventure in the realms of human knowledge, as only Bill Bryson can render it. Science has never been more involving or entertaining.

    As well as looking at logic in theoretical terms the book considers its everyday uses and demonstrates how it has genuine practical applications. It will take you step by step through the most difficult concepts and is packed with exercises to help you consolidate your learning at every stage. Covering everything from syllogistic logic to logical paradoxes and even looking at logic in Alice in Wonderland, this is the only guide you will ever need.

    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.

    Readerswill find information on frequency distributions; mean, median, and mode; range, variance, and standard deviation;probability; and more.-Emphasizes Microsoft Excel for number-crunching and computationsDownload a sample chapter.

    Contributors include Steven Weinberg, Peter Galison, John Maynard Smith, and Frank Wilczek.

    And once readers have tested their theories and completed their experiments, they can feast on the results! From salad dressing to mayonnaise, celery to popcorn, and muffins to meringues, this book uses food to make science accessible to a range of tastes. Also included is essential information on eating healthfully, plus additional resources for further exploration.