Book picks similar to
Counterexamples in Analysis by Bernard R. Gelbaum
mathematics
math
textbooks
real-analysis
Math Through the Ages: A Gentle History for Teachers and Others
William P. Berlinghoff - 2002
Each sketch contains Questions and Projects to help you learn more about its topic and to see how its main ideas fit into the bigger picture of history. The 25 short stories are preceded by a 56-page bird's-eye overview of the entire panorama of mathematical history, a whirlwind tour of the most important people, events, and trends that shaped the mathematics we know today. Reading suggestions after each sketch provide starting points for readers who want to pursue a topic further."
Discrete-Time Signal Processing (Prentice-Hall Signal Processing Series)
Alan V. Oppenheim - 1989
Revised from the 1989 edition not so much with new information, which has not changed much at the introductory level, bu
Algorithmic Puzzles
Anany V. Levitin - 2011
This logic extends far beyond the realm of computer science and into the wide and entertaining world of puzzles. In Algorithmic Puzzles, Anany and Maria Levitin use many classic brainteasers as well as newer examples from job interviews with major corporations to show readers how to apply analytical thinking to solve puzzles requiring well-defined procedures.The book's unique collection of puzzles is supplemented with carefully developed tutorials on algorithm design strategies and analysis techniques intended to walk the reader step-by-step through the various approaches to algorithmic problem solving. Mastery of these strategies--exhaustive search, backtracking, and divide-and-conquer, among others--will aid the reader in solving not only the puzzles contained in this book, but also others encountered in interviews, puzzle collections, and throughout everyday life. Each of the 150 puzzles contains hints and solutions, along with commentary onthe puzzle's origins and solution methods. The only book of its kind, Algorithmic Puzzles houses puzzles for all skill levels. Readers with only middle school mathematics will develop their algorithmic problem-solving skills through puzzles at the elementary level, while seasoned puzzle solvers will enjoy the challenge of thinking throughmore difficult puzzles.
Discrete Mathematical Structures
Bernard Kolman - 1995
It covers areas such as fundamentals, logic, counting, relations and digraphs, trees, topics in graph theory, languages and finite-state machines, and groups and coding.
Painless Algebra
Lynette Long - 1998
The author defines all terms, points out potential pitfalls in algebraic calculation, and makes problem solving a fun activity. New in this edition are painless approaches to understanding and graphing linear equations, solving systems of linear inequalities, and graphing quadratic equations. Barron’s popular Painless Series of study guides for middle school and high school students offer a lighthearted, often humorous approach to their subjects, transforming details that might once have seemed boring or difficult into a series of interesting and mentally challenging ideas. Most titles in the series feature many fun-to-solve “Brain Tickler” problems with answers at the end of each chapter.
The Norton Anthology of English Literature, Volume 2: The Romantic Period through the Twentieth Century
M.H. AbramsKatharine Eisaman Maus - 1962
Under the direction of Stephen Greenblatt, General Editor, the editors have reconsidered all aspects of the anthology to make it an even better teaching tool.
Pro Git
Scott Chacon - 2009
It took the open source world by storm since its inception in 2005, and is used by small development shops and giants like Google, Red Hat, and IBM, and of course many open source projects.A book by Git experts to turn you into a Git expert. Introduces the world of distributed version control Shows how to build a Git development workflow.
The Official Guide for GMAT Quantitative Review
Graduate Management Admission Council (GMAC) - 2005
This work focuses on the maths skills necessary to pass the GMAT, with nearly 300 questions and explanations on subjects such as arithmetic, algebra, geometry and data sufficiency.
Operations Research: Applications and Algorithms (with CD-ROM and InfoTrac)
Wayne L. Winston - 1987
It moves beyond a mere study of algorithms without sacrificing the rigor that faculty desire. As in every edition, Winston reinforces the book's successful features and coverage with the most recent developments in the field. The Student Suite CD-ROM, which now accompanies every new copy of the text, contains the latest versions of commercial software for optimization, simulation, and decision analysis.
The Principles of Mathematics
Bertrand Russell - 1903
Russell's classic The Principles of Mathematics sets forth his landmark thesis that mathematics and logic are identical―that what is commonly called mathematics is simply later deductions from logical premises.His ideas have had a profound influence on twentieth-century work on logic and the foundations of mathematics.
Physics for Scientists and Engineers
Douglas C. Giancoli - 1988
For the calculus-based General Physics course primarily taken by engineers and scientists.
Learn You a Haskell for Great Good!
Miran Lipovača - 2011
Learn You a Haskell for Great Good! introduces programmers familiar with imperative languages (such as C++, Java, or Python) to the unique aspects of functional programming. Packed with jokes, pop culture references, and the author's own hilarious artwork, Learn You a Haskell for Great Good! eases the learning curve of this complex language, and is a perfect starting point for any programmer looking to expand his or her horizons. The well-known web tutorial on which this book is based is widely regarded as the best way for beginners to learn Haskell, and receives over 30,000 unique visitors monthly.
Elements of the Theory of Computation
Harry R. Lewis - 1981
The authors are well-known for their clear presentation that makes the material accessible to a a broad audience and requires no special previous mathematical experience. KEY TOPICS: In this new edition, the authors incorporate a somewhat more informal, friendly writing style to present both classical and contemporary theories of computation. Algorithms, complexity analysis, and algorithmic ideas are introduced informally in Chapter 1, and are pursued throughout the book. Each section is followed by problems.
Mindstorms: Children, Computers, And Powerful Ideas
Seymour Papert - 1980
We have Mindstorms to thank for that. In this book, pioneering computer scientist Seymour Papert uses the invention of LOGO, the first child-friendly programming language, to make the case for the value of teaching children with computers. Papert argues that children are more than capable of mastering computers, and that teaching computational processes like de-bugging in the classroom can change the way we learn everything else. He also shows that schools saturated with technology can actually improve socialization and interaction among students and between students and teachers.