Shahriar Shahriari - Böcker

Is there always a prime number between $n$ and $2n$? Where, approximately, is the millionth prime? And just what does calculus have to do with answering either of these questions? It turns out that calculus has a lot to do with both questions, as this book can show you. The theme of the book is approximations. Calculus is a powerful tool because it allows us to approximate complicated functions with simpler ones. Indeed, replacing a function locally with a linear - or higher order - approximation is at the heart of calculus. The real star of the book, though, is the task of approximating the number of primes up to a number $x$. This leads to the famous Prime Number Theorem - and to the answers to the two questions about primes. While emphasizing the role of approximations in calculus, most major topics are addressed, such as derivatives, integrals, the Fundamental Theorem of Calculus, sequences, series, and so on.However, our particular point of view also leads us to many unusual topics: curvature, Pade approximations, public key cryptography, and an analysis of the logistic equation, to name a few. The reader takes an active role in developing the material by solving problems. Most topics are broken down into a series of manageable problems, which guide you to an understanding of the important ideas. There is also ample exposition to fill in background material and to get you thinking appropriately about the concepts. ""Approximately Calculus"" is intended for the reader who has already had an introduction to calculus, but wants to engage the concepts and ideas at a deeper level. It is suitable as a text for an honors or alternative second semester calculus course.

Active student engagement is key to this classroom-tested combinatorics text, boasting 1200+ carefully designed problems, ten mini-projects, section warm-up problems, and chapter opening problems. The author - an award-winning teacher - writes in a conversational style, keeping the reader in mind on every page. Students will stay motivated through glimpses into current research trends and open problems as well as the history and global origins of the subject. All essential topics are covered, including Ramsey theory, enumerative combinatorics including Stirling numbers, partitions of integers, the inclusion-exclusion principle, generating functions, introductory graph theory, and partially ordered sets. Some significant results are presented as sets of guided problems, leading readers to discover them on their own. More than 140 problems have complete solutions and over 250 have hints in the back, making this book ideal for self-study. Ideal for a one semester upper undergraduate course, prerequisites include the calculus sequence and familiarity with proofs.