This volume presents students with problems and exercises designed to illuminate the properties of functions and graphs. The 1st part of the book employs simple functions to analyze the fundamental methods of constructing graphs. The 2nd half deals with more complicated and refined questions concerning linear functions, quadratic trinomials, linear fractional functions, power functions, and rational functions. 1969 edition.
An Essential Reference for Intermediate and Advanced R Programmers Advanced R presents useful tools and techniques for attacking many types of R programming problems, helping you avoid mistakes and dead ends. With more than ten years of experience programming in R, the author illustrates the elegance, beauty, and flexibility at the heart of R. The book develops the necessary skills to produce quality code that can be used in a variety of circumstances. You will learn: The fundamentals of R, including standard data types and functions Functional programming as a useful framework for solving wide classes of problems The positives and negatives of metaprogramming How to write fast, memory-efficient code This book not only helps current R users become R programmers but also shows existing programmers what’s special about R. Intermediate R programmers can dive deeper into R and learn new strategies for solving diverse problems while programmers from other languages can learn the details of R and understand why R works the way it does.
This balanced introduction covers all fundamentals, from the real number system and point sets to set theory and metric spaces. Useful references to the literature conclude each chapter. 1956 edition.
Designed for precollege teachers by a collaborative of teachers, educators, and mathematicians, Famous Functions in Number Theory is based on a course offered in the Summer School Teacher Program at the Park City Mathematics Institute. But this book isn't a "course" in the traditional sense. It consists of a carefully sequenced collection of problem sets designed to develop several interconnected mathematical themes, and one of the goals of the problem sets is for readers to uncover these themes for themselves. Famous Functions in Number Theory introduces readers to the use of formal algebra in number theory. Through numerical experiments, participants learn how to use polynomial algebra as a bookkeeping mechanism that allows them to count divisors, build multiplicative functions, and compile multiplicative functions in a certain way that produces new ones. One capstone of the investigations is a beautiful result attributed to Fermat that determines the number of ways a positive integer can be written as a sum of two perfect squares. Famous Functions in Number Theory is a volume of the book series "IAS/PCMI-The Teacher Program Series" published by the American Mathematical Society. Each volume in that series covers the content of one Summer School Teacher Program year and is independent of the rest. Titles in this series are co-published with the Institute for Advanced Study/Park City Mathematics Institute. Members of the Mathematical Association of America (MAA) and the National Council of Teachers of Mathematics (NCTM) receive a 20% discount from list price.
This graduate-level text gives a thorough overview of the analysis of Boolean functions, beginning with the most basic definitions and proceeding to advanced topics.
This textbook presents the concepts and tools necessary to understand, build, and implement algorithms for computing elementary functions (e.g., logarithms, exponentials, and the trigonometric functions). Both hardware- and software-oriented algorithms are included, along with issues related to accurate floating-point implementation. This third edition has been updated and expanded to incorporate the most recent advances in the field, new elementary function algorithms, and function software. After a preliminary chapter that briefly introduces some fundamental concepts of computer arithmetic, such as floating-point arithmetic and redundant number systems, the text is divided into three main parts. Part I considers the computation of elementary functions using algorithms based on polynomial or rational approximations and using table-based methods; the final chapter in this section deals with basic principles of multiple-precision arithmetic. Part II is devoted to a presentation of “shift-and-add” algorithms (hardware-oriented algorithms that use additions and shifts only). Issues related to accuracy, including range reduction, preservation of monotonicity, and correct rounding, as well as some examples of implementation are explored in Part III. Numerous examples of command lines and full programs are provided throughout for various software packages, including Maple, Sollya, and Gappa. New to this edition are an in-depth overview of the IEEE-754-2008 standard for floating-point arithmetic; a section on using double- and triple-word numbers; a presentation of new tools for designing accurate function software; and a section on the Toom-Cook family of multiplication algorithms. The techniques presented in this book will be of interest to implementers of elementary function libraries or circuits and programmers of numerical applications. Additionally, graduate and advanced undergraduate students, professionals, and researchers in scientific computing, numerical analysis, software engineering, and computer engineering will find this a useful reference and resource. PRAISE FOR PREVIOUS EDITIONS “[T]his book seems like an essential reference for the experts (which I'm not). More importantly, this is an interesting book for the curious (which I am). In this case, you'll probably learn many interesting things from this book. If you teach numerical analysis or approximation theory, then this book will give you some good examples to discuss in class." — MAA Reviews (Review of Second Edition) "The rich content of ideas sketched or presented in some detail in this book is supplemented by a list of over three hundred references, most of them of 1980 or more recent. The book also contains some relevant typical programs." — Zentralblatt MATH (Review of Second Edition) “I think that the book will be very valuable to students both in numerical analysis and in computer science. I found [it to be] well written and containing much interesting material, most of the time disseminated in specialized papers published in specialized journals difficult to find." — Numerical Algorithms (Review of First Edition)
The theory of theta functions has a long history; for this, we refer A. Krazer and W. Wirtinger the reader to an encyclopedia article by ("Sources" [9]). We shall restrict ourselves to postwar, i. e., after 1945, periods. Around 1948/49, F. Conforto, c. L. Siegel, A. Well reconsidered the main existence theorems of theta functions and found natural proofs for them. These are contained in Conforto: Abelsche Funktionen und algebraische Geometrie, Springer (1956); Siegel: Analytic functions of several complex variables, Lect. Notes, I.A.S. (1948/49); Well: Theoremes fondamentaux de la theorie des fonctions theta, Sem. Bourbaki, No. 16 (1949). The complete account of Weil's method appeared in his book of 1958 [20]. The next important achievement was the theory of compacti fication of the quotient variety of Siegel's upper-half space by a modular group. There are many ways to compactify the quotient variety; we are talking about what might be called a standard compactification. Such a compactification was obtained first as a Hausdorff space by I. Satake in "On the compactification of the Siegel space", J. Ind. Math. Soc. 20, 259-281 (1956), and as a normal projective variety by W.L. Baily in 1958 [1]. In 1957/58, H. Cartan took up this theory in his seminar [3]; it was shown that the graded ring of modular forms relative to the given modular group is a normal integral domain which is finitely generated over C
Self-contained text, useful for classroom or independent study, covers Bessel functions of zero order, modified Bessel functions, definite integrals, asymptotic expansions, and Bessel functions of any real order. 226 problems.
