Quadratic Irrationals: An Introduction to Classical Number Theory gives a unified treatment of the classical theory of quadratic irrationals. Presenting the material in a modern and elementary algebraic setting, the author focuses on equivalence, continued fractions, quadratic characters, quadratic orders, binary quadratic forms, and class groups.T

The reports of a conference of 11 scholars who began the task of examing together primary sources that might shed som elight on exactly how and in what fomrs mathematical problems, concepts, and techniques may have been transmitted between various civilizations, from antiquity down to the European Renaissance following more or less the legendary silk routes between China and Western Europe.

Focussing on the mathematics related to the recent proof of ergodicity of the (Weil–Petersson) geodesic flow on a nonpositively curved space whose points are negatively curved metrics on surfaces, this book provides a broad introduction to an important current area of research. It offers original textbook-level material suitable for introductory or advanced courses as well as deep insights into the state of the art of the field, making it useful as a reference and for self-study. The first chapters introduce hyperbolic dynamics, ergodic theory and geodesic and horocycle flows, and include an English translation of Hadamard's original proof of the Stable-Manifold Theorem. An outline of the strategy, motivation and context behind the ergodicity proof is followed by a careful exposition of it (using the Hopf argument) and of the pertinent context of Teichmüller theory. Finally, some complementary lectures describe the deep connections between geodesic flows in negative curvature and Diophantine approximation.

Taking readers from elementary number theory, via algorithmic, to applied number theory in computer science, this text introduces basic concepts, results, and methods, before going on to discuss their applications in the design of hardware and software, cryptography, and security. Aimed at undergraduates in computing and information technology, and presupposing only high-school math, this book will also interest mathematics students concerned with applications. XXXXXXX Neuer Text This is an essential introduction to number theory for computer scientists. It treats three areas, elementary-, algorithmic-, and applied number theory in a unified and accessible manner. It introduces basic concepts and methods, and discusses their applications to the design of hardware, software, cryptography, and information security. Aimed at computer scientists, electrical engineers and students the presentation presupposes only an understanding of high-school math.

A concise, unified view of mathematics together with its historical development. Aiming at mathematicians who have mastered the basic topics but wish to gain a better grasp of mathematics as a whole, the author gives the reasons for the emergence of the main fields of modern mathematics, and explains the connections between them by tracing the course of a few mathematical themes from ancient times down to the 20th century. The emphasis here is on history as a method for unifying and motivating mathematics, rather than as an end in itself, and there is more mathematical detail than in other general histories. However, no historical expertise is assumed, and classical mathematics is rephrased in modern terms where needed. Nevertheless, there are copious references to original sources for readers wishing to explore the classics for themselves. In summary, readers will be able to add to their mathematical knowledge as well as gaining a new perspective on what they already know.

Effective Polynomial Computation is an introduction to the algorithms of computer algebra. It discusses the basic algorithms for manipulating polynomials including factoring polynomials. These algorithms are discussed from both a theoretical and practical perspective. Those cases where theoretically optimal algorithms are inappropriate are discussed and the practical alternatives are explained. Effective Polynomial Computation provides much of the mathematical motivation of the algorithms discussed to help the reader appreciate the mathematical mechanisms underlying the algorithms, and so that the algorithms will not appear to be constructed out of whole cloth. Preparatory to the discussion of algorithms for polynomials, the first third of this book discusses related issues in elementary number theory. These results are either used in later algorithms (e.g. the discussion of lattices and Diophantine approximation), or analogs of the number theoretic algorithms are used for polynomial problems (e.g. Euclidean algorithm and p-adic numbers). Among the unique features of Effective Polynomial Computation is the detailed material on greatest common divisor and factoring algorithms for sparse multivariate polynomials. In addition, both deterministic and probabilistic algorithms for irreducibility testing of polynomials are discussed.

Number Theory is a comprehensive exploration of the foundational concepts, theorems, and applications in number theory. Prime numbers, congruences, and Diophantine equations, offering both classical insights and modern perspectives. It caters to a broad audience, from students to advanced mathematicians, with a focus on problem-solving, proofs, and historical context. Rich with examples, exercises, and applications, Number Theory illuminates the subject's intrinsic beauty and its significance in fields like cryptography, computer science, and mathematical research.