Concrete Mathematics: A Foundation for Computer Science


Ronald L. Graham - 1988
    "More concretely," the authors explain, "it is the controlled manipulation of mathematical formulas, using a collection of techniques for solving problems."

The Simpsons and Their Mathematical Secrets


Simon Singh - 2013
    That they exist, Simon Singh reveals, underscores the brilliance of the shows' writers, many of whom have advanced degrees in mathematics in addition to their unparalleled sense of humor. While recounting memorable episodes such as “Bart the Genius” and “Homer3,” Singh weaves in mathematical stories that explore everything from p to Mersenne primes, Euler's equation to the unsolved riddle of P v. NP; from perfect numbers to narcissistic numbers, infinity to even bigger infinities, and much more. Along the way, Singh meets members of The Simpsons' brilliant writing team-among them David X. Cohen, Al Jean, Jeff Westbrook, and Mike Reiss-whose love of arcane mathematics becomes clear as they reveal the stories behind the episodes. With wit and clarity, displaying a true fan's zeal, and replete with images from the shows, photographs of the writers, and diagrams and proofs, The Simpsons and Their Mathematical Secrets offers an entirely new insight into the most successful show in television history.

Elementary Analysis: The Theory of Calculus


Kenneth A. Ross - 1980
    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.

Introductory Circuit Analysis


Robert L. Boylestad - 1968
    Features exceptionally clear explanations and descriptions, step-by-step examples, more than 50 practical applications, over 2000 easy-to-challenging practice problems, and comprehensive coverage of essentials. PSpice, OrCAd version 9.2 Lite Edition, Multisims 2001 version of Electronics Workbench, and MathCad software references and examples are used throughout. Computer programs (C++, BASIC and PSpice) are printed in color, as they run, at the point in the book where they are discussed. Current and Voltage. Resistance. Ohm's Law, Power, and Energy. Series Circuits. Parallel Circuits. Series-Parallel Networks. Methods of Analysis & Selected Topics. Network Theorems. Capacitors. Magnetic Circuits. Inductors. Sinusodial Alternating Waveforms. The Basic Elements and Phasors. Series and Parallel ac Circuits. Series-Parallel ac Networks. Methods of Analysis and Related Topics. Network Theorems (ac). Power (ac). Resonance. Transformers. Polyphase Systems. Decibels, Filters, and Bode Points. Pulse Waveforms and the R-C Response. Nonsinusodial Circuits. System Analysis: An Introduction. For those working in electronic technology.

Proofs from the Book, 3e


Martin Aigner - 1998
    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."

Biochemical Engineering Fundamentals


James E. Bailey - 1977
    The biological background provided enables students to comprehend the major problems in biochemical engineering and formulate effective solutions.

Elementary Differential Equations


Earl D. Rainville - 1962
    Each chapter includes many illustrative examples to assist the reader. The book emphasizes methods for finding solutions to differential equations. It provides many abundant exercises, applications, and solved examples with careful attention given to readability. Elementary Differential Equations includes a thorough treatment of power series techniques. In addition, the book presents a classical treatment of several physical problems to show how Fourier series become involved in the solution of those problems. The eighth edition of Elementary Differential Equations has been revised to include a new supplement in many chapters that provides suggestions and exercises for using a computer to assist in the understanding of the material in the chapter. It also now provides an introduction to the phase plane and to different types of phase portraits. A valuable reference book for readers interested in exploring the technological and other applications of differential equations.

Information Theory, Inference and Learning Algorithms


David J.C. MacKay - 2002
    These topics lie at the heart of many exciting areas of contemporary science and engineering - communication, signal processing, data mining, machine learning, pattern recognition, computational neuroscience, bioinformatics, and cryptography. This textbook introduces theory in tandem with applications. Information theory is taught alongside practical communication systems, such as arithmetic coding for data compression and sparse-graph codes for error-correction. A toolbox of inference techniques, including message-passing algorithms, Monte Carlo methods, and variational approximations, are developed alongside applications of these tools to clustering, convolutional codes, independent component analysis, and neural networks. The final part of the book describes the state of the art in error-correcting codes, including low-density parity-check codes, turbo codes, and digital fountain codes -- the twenty-first century standards for satellite communications, disk drives, and data broadcast. Richly illustrated, filled with worked examples and over 400 exercises, some with detailed solutions, David MacKay's groundbreaking book is ideal for self-learning and for undergraduate or graduate courses. Interludes on crosswords, evolution, and sex provide entertainment along the way. In sum, this is a textbook on information, communication, and coding for a new generation of students, and an unparalleled entry point into these subjects for professionals in areas as diverse as computational biology, financial engineering, and machine learning.

How to Ace Calculus: The Streetwise Guide


Colin Conrad Adams - 1998
    Capturing the tone of students exchanging ideas among themselves, this unique guide also explains how calculus is taught, how to get the best teachers, what to study, and what is likely to be on exams—all the tricks of the trade that will make learning the material of first-semester calculus a piece of cake. Funny, irreverent, and flexible, How to Ace Calculus shows why learning calculus can be not only a mind-expanding experience but also fantastic fun.

Introduction to Superstrings and M-Theory


Michio Kaku - 1989
    Called by some, "the theory of everything," superstrings may solve a problem that has eluded physicists for the past 50 years, the final unification of the two great theories of the twentieth century, general relativity and quantum field theory. Now, here is a thoroughly revised, second edition of a course-tested comprehensive introductory graduate text on superstrings which stresses the most current areas of interest, not covered in other presentations, including: - Four-dimensional superstrings - Kac-Moody algebras - Teichm�ller spaces and Calabi-Yau manifolds - M-theory Membranes and D-branes - Duality and BPS relations - Matrix models The book begins with a simple discussion of point particle theory, and uses Feynman path integrals to unify the presentation of superstrings. It has been updated throughout, and three new chapters on M-theory have been added. Prerequisites are an acquaintance with quantum mechanics and relativity.

Solving Mathematical Problems: A Personal Perspective


Terence Tao - 2006
    Covering number theory, algebra, analysis, Euclidean geometry, and analytic geometry, Solving Mathematical Problems includes numerous exercises and model solutions throughout. Assuming only a basic level of mathematics, the text is ideal for students of 14 years and above in pure mathematics.

Computer Science Illuminated


Nell B. Dale - 2002
    Written By Two Of Today'S Most Respected Computer Science Educators, Nell Dale And John Lewis, The Text Provides A Broad Overview Of The Many Aspects Of The Discipline From A Generic View Point. Separate Program Language Chapters Are Available As Bundle Items For Those Instructors Who Would Like To Explore A Particular Programming Language With Their Students. The Many Layers Of Computing Are Thoroughly Explained Beginning With The Information Layer, Working Through The Hardware, Programming, Operating Systems, Application, And Communication Layers, And Ending With A Discussion On The Limitations Of Computing. Perfect For Introductory Computing And Computer Science Courses, Computer Science Illuminated, Third Edition's Thorough Presentation Of Computing Systems Provides Computer Science Majors With A Solid Foundation For Further Study, And Offers Non-Majors A Comprehensive And Complete Introduction To Computing.

The Fractal Geometry of Nature


Benoît B. Mandelbrot - 1977
    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.

Computers and Intractability: A Guide to the Theory of NP-Completeness


Michael R. Garey - 1979
    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.

Introduction to Real Analysis


Robert G. Bartle - 1982
    Therefore, this book provides the fundamental concepts and techniques of real analysis for readers in all of these areas. It helps one develop the ability to think deductively, analyze mathematical situations and extend ideas to a new context. Like the first two editions, this edition maintains the same spirit and user-friendly approach with some streamlined arguments, a few new examples, rearranged topics, and a new chapter on the Generalized Riemann Integral.