It reveals the attraction that has drawn leading mathematicians and amateurs alike to number theory over the course of history.

    This introductory text is suitable for use in a course on the subject or for self-study, featuring broad coverage and a readable exposition, with many examples and exercises. The four main chapters present the basics: fundamental group and covering spaces, homology and cohomology, higher homotopy groups, and homotopy theory generally. The author emphasizes the geometric aspects of the subject, which helps students gain intuition. A unique feature is the inclusion of many optional topics not usually part of a first course due to time constraints: Bockstein and transfer homomorphisms, direct and inverse limits, H-spaces and Hopf algebras, the Brown representability theorem, the James reduced product, the Dold-Thom theorem, and Steenrod squares and powers.

    This sharply intelligent, consistently provocative book takes the reader on an astonishing, thought-provoking voyage into the realm of delightful uncertainty--a world of paradox in which logical argument leads to contradiction and common sense is seemingly rendered irrelevant.

    This revised edition includes a CD-Rom with exercises that will help the student have a better understanding of equations, formulas, etc.

    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.

    In this new, innovative overview textbook, the authors put special emphasis on the deep ideas of mathematics, and present the subject through lively and entertaining examples, anecdotes, challenges and illustrations, all of which are designed to excite the student's interest. The underlying ideas include topics from number theory, infinity, geometry, topology, probability and chaos theory. Throughout the text, the authors stress that mathematics is an analytical way of thinking, one that can be brought to bear on problem solving and effective thinking in any field of study.

    This book examines the huge scope of mathematical areas explored and developed by Euler, which includes number theory, combinatorics, geometry, complex variables and many more. The information known to Euler over 300 years ago is discussed, and many of his advances are reconstructed. Readers will be left in no doubt about the brilliance and pervasive influence of Euler's work.

    It is highly recommended for anyone planning to study advanced analysis, e.g., complex variables, differential equations, Fourier analysis, numerical analysis, several variable calculus, and statistics. It is also recommended for future secondary school teachers. A limited number of concepts involving the real line and functions on the real line are studied. Many abstract ideas, such as metric spaces and ordered systems, are avoided. The least upper bound property is taken as an axiom and the order properties of the real line are exploited throughout. A thorough treatment of sequences of numbers is used as a basis for studying standard calculus topics. Optional sections invite students to study such topics as metric spaces and Riemann-Stieltjes integrals.

    Politicians and marketers present shoddy evidence for dubious claims all the time. But smart people make mistakes too, and when it comes to statistics, plenty of otherwise great scientists--yes, even those published in peer-reviewed journals--are doing statistics wrong."Statistics Done Wrong" comes to the rescue with cautionary tales of all-too-common statistical fallacies. It'll help you see where and why researchers often go wrong and teach you the best practices for avoiding their mistakes.In this book, you'll learn: - Why "statistically significant" doesn't necessarily imply practical significance- Ideas behind hypothesis testing and regression analysis, and common misinterpretations of those ideas- How and how not to ask questions, design experiments, and work with data- Why many studies have too little data to detect what they're looking for-and, surprisingly, why this means published results are often overestimates- Why false positives are much more common than "significant at the 5% level" would suggestBy walking through colorful examples of statistics gone awry, the book offers approachable lessons on proper methodology, and each chapter ends with pro tips for practicing scientists and statisticians. No matter what your level of experience, "Statistics Done Wrong" will teach you how to be a better analyst, data scientist, or researcher.

    Luenberger, known for his ability to make complex ideas simple, presents essential ideas of investments and their applications, offering students the most comprehensive treatment of the subject available.

    This book surveys the most important computer algorithms currently in use and provides a full treatment of data structures and algorithms for sorting, searching, graph processing, and string processing -- including fifty algorithms every programmer should know. In this edition, new Java implementations are written in an accessible modular programming style, where all of the code is exposed to the reader and ready to use.The algorithms in this book represent a body of knowledge developed over the last 50 years that has become indispensable, not just for professional programmers and computer science students but for any student with interests in science, mathematics, and engineering, not to mention students who use computation in the liberal arts.The companion web site, algs4.cs.princeton.edu contains An online synopsis Full Java implementations Test data Exercises and answers Dynamic visualizations Lecture slides Programming assignments with checklists Links to related material The MOOC related to this book is accessible via the "Online Course" link at algs4.cs.princeton.edu. The course offers more than 100 video lecture segments that are integrated with the text, extensive online assessments, and the large-scale discussion forums that have proven so valuable. Offered each fall and spring, this course regularly attracts tens of thousands of registrants.Robert Sedgewick and Kevin Wayne are developing a modern approach to disseminating knowledge that fully embraces technology, enabling people all around the world to discover new ways of learning and teaching. By integrating their textbook, online content, and MOOC, all at the state of the art, they have built a unique resource that greatly expands the breadth and depth of the educational experience.

    The complexity of nature's shapes differs in kind, not merely degree, from that of the shapes of ordinary geometry, the geometry of fractal shapes.Now that the field has expanded greatly with many active researchers, Mandelbrot presents the definitive overview of the origins of his ideas and their new applications. The Fractal Geometry of Nature is based on his highly acclaimed earlier work, but has much broader and deeper coverage and more extensive illustrations.

    Aimed at undergraduate students in mathematics, physics, and engineering, the book's intuitive explanations, lack ofadvanced prerequisites, and consciously user-friendly prose style will help students to master the subject more readily than was previously possible. The key to this is the book's use of new geometric arguments in place of the standard calculational ones. These geometric arguments are communicatedwith the aid of hundreds of diagrams of a standard seldom encountered in mathematical works. A new approach to a classical topic, this work will be of interest to students in mathematics, physics, and engineering, as well as to professionals in these fields.

    Of course, it’s not all cooking; we’ll also run the New York and Chicago marathons, pay visits to Cinderella and Lewis Carroll, and even get to the bottom of a tomato’s identity as a vegetable. This is not the math of our high school classes: mathematics, Cheng shows us, is less about numbers and formulas and more about how we know, believe, and understand anything, including whether our brother took too much cake.At the heart of How to Bake Pi is Cheng’s work on category theory—a cutting-edge “mathematics of mathematics.” Cheng combines her theory work with her enthusiasm for cooking both to shed new light on the fundamentals of mathematics and to give readers a tour of a vast territory no popular book on math has explored before. Lively, funny, and clear, How to Bake Pi will dazzle the initiated while amusing and enlightening even the most hardened math-phobe.

    He has selected a group of diversions which are not only entertaining but mathematically meaningful as well. The result is a work which is rewarding on almost every level of mathematical achievement."—Miriam Hecht, Iscripta Mathematica