This entertaining book presents a collection of 180 famous mathematical puzzles and intriguing elementary problems that great mathematicians have posed, discussed, and/or solved. The selected problems do not require advanced mathematics, making this book accessible to a variety of readers. Mathematical recreations offer a rich playground for both amateur and professional mathematicians. Believing that creative stimuli and aesthetic considerations are closely related, great mathematicians from ancient times to the present have always taken an interest in puzzles and diversions. The goal of this book is to show that famous mathematicians have all communicated brilliant ideas, methodological approaches, and absolute genius in mathematical thoughts by using recreational mathematics as a framework. Concise biographies of many mathematicians mentioned in the text are also included. The majority of the mathematical problems presented in this book originated in number theory, graph theory, optimization, and probability. Others are based on combinatorial and chess problems, while still others are geometrical and arithmetical puzzles. This book is intended to be both entertaining as well as an introduction to various intriguing mathematical topics and ideas. Certainly, many stories and famous puzzles can be very useful to prepare classroom lectures, to inspire and amuse students, and to instill affection for mathematics.

The aim of this book is to present formulas and methods developed using complex interval arithmetic. While most of numerical methods described in the literature deal with real intervals and real vectors, there is no systematic study of methods in complex interval arithmetic. The book fills this gap. Several main subjects are considered: outer estimates for the range of complex functions, especially complex centered forms, the best approximations of elementary complex functions by disks, iterative methods for the inclusion by polynomial zeros including their implementation on parallel computers, the analysis of numerical stability of iterative methods by using complex interval arithmetic and numerical computation of curvilinear integrals with error bounds. Mainly new methods are presented developed over the last years, including a lot of very recent results by the authors some of which have not been published before.

99 puzzles built around the chessboard. Arithmetical and probability problems, chessboard recreations, geometrical puzzles, mathematical amusements and games, more. Solutions.

This book details the heart and soul of modern commutative and algebraic geometry. It covers such topics as the Hilbert Basis Theorem, the Nullstellensatz, invariant theory, projective geometry, and dimension theory. In addition to enhancing the text of the second edition, with over 200 pages reflecting changes to enhance clarity and correctness, this third edition of Ideals, Varieties and Algorithms includes: a significantly updated section on Maple; updated information on AXIOM, CoCoA, Macaulay 2, Magma, Mathematica and SINGULAR; and presents a shorter proof of the Extension Theorem.

This book is the first on the topic and explains the most cutting-edge methods needed for precise calculations and explores the development of powerful algorithms to solve research problems. Multipoint methods have an extensive range of practical applications significant in research areas such as signal processing, analysis of convergence rate, fluid mechanics, solid state physics, and many others. The book takes an introductory approach in making qualitative comparisons of different multipoint methods from various viewpoints to help the reader understand applications of more complex methods. Evaluations are made to determine and predict efficiency and accuracy of presented models useful to wide a range of research areas along with many numerical examples for a deep understanding of the usefulness of each method. This book will make it possible for the researchers to tackle difficult problems and deepen their understanding of problem solving using numerical methods. Multipoint methods are of great practical importance, as they determine sequences of successive approximations for evaluative purposes. This is especially helpful in achieving the highest computational efficiency. The rapid development of digital computers and advanced computer arithmetic have provided a need for new methods useful to solving practical problems in a multitude of disciplines such as applied mathematics, computer science, engineering, physics, financial mathematics, and biology. Provides a succinct way of implementing a wide range of useful and important numerical algorithms for solving research problems Illustrates how numerical methods can be used to study problems which have applications in engineering and sciences, including signal processing, and control theory, and financial computation Facilitates a deeper insight into the development of methods, numerical analysis of convergence rate, and very detailed analysis of computational efficiencyProvides a powerful means of learning by systematic experimentation with some of the many fascinating problems in scienceIncludes highly efficient algorithms convenient for the implementation into the most common computer algebra systems such as Mathematica, MatLab, and Maple.