Kategoria BISAC: Mathematics >> Number Theory

The field of weak arithmetics is an application of logical methods to number theory that was developed by mathematicians, philosophers, and theoretical computer scientists. In this volume, after a general presentation of weak arithmetics, the following topics are studied: the properties of integers of a real closed field equipped with exponentiation; conservation results for the induction schema restricted to first-order formulas with a finite number of alternations of quantifiers; a survey on a class of tools called pebble games; the fact that the reals e and pi have approximations...

First developed in the early 1980s by Lenstra, Lenstra, and Lovasz, the LLL algorithm was originally used to provide a polynomial-time algorithm for factoring polynomials with rational coefficients. It very quickly became an essential tool in integer linear programming problems and was later adapted for use in cryptanalysis. This book provides an introduction to the theory and applications of lattice basis reduction and the LLL algorithm. With numerous examples and suggested exercises, the text discusses various applications of lattice basis reduction to cryptography, number theory,...

Bellos has traveled all around the globe and has plunged into history to uncover fascinating stories of mathematical achievement, from the breakthroughs of Euclid, the greatest mathematician of all time, to the creations of the Zen master of origami, one of the hottest areas of...

John Wallis (1616-1703) was the most influential English mathematician prior to Newton. He published his most famous work, Arithmetica Infinitorum, in Latin in 1656. This book studied the quadrature of curves and systematised the analysis of Descartes and Cavelieri. Upon publication, this text immediately became the standard book on the subject and was frequently referred to by subsequent writers. This will be the first English translation of this text ever to be published.

The problem of representing an integer as a sum of squares of integers is one of the oldest and most significant in mathematics. It goes back at least 2000 years to Diophantus, and continues more recently with the works of Fermat, Euler, Lagrange, Jacobi, Glaisher, Ramanujan, Hardy, Mordell, Andrews, and others. Jacobi's elliptic function approach dates from his epic Fundamenta Nova of 1829. Here, the author employs his combinatorial/elliptic function methods to derive many infinite families of explicit exact formulas involving either squares or triangular numbers, two of which...

Tauberian theory compares summability methods for series and integrals, helps to decide when there is convergence, and provides asymptotic and remainder estimates. The author shows the development of the theory from the beginning and his expert commentary evokes the excitement surrounding the early results. He shows the fascination of the difficult Hardy-Littlewood theorems and of an unexpected simple proof, and extolls Wiener's breakthrough based on Fourier theory. There are the spectacular "high-indices" theorems and Karamata's "regular variation," which permeates probability theory. The...

The theory of transcendental numbers is closely related to the study of diophantine approximation. This book deals with values of the usual exponential function ez: a central open problem is the conjecture on algebraic independence of logarithms of algebraic numbers. Two chapters provide complete and simplified proofs of zero estimates (due to Philippon) on linear algebraic groups.