"About binomial theorems I'm teeming with a lot of news, With many cheerful facts about the square on the hypotenuse. " - William S. Gilbert (The Pirates of Penzance, Act I) The question of divisibility is arguably the oldest problem in mathematics. Ancient peoples observed the cycles of nature: the day, the lunar month, and the year, and assumed that each divided evenly into the next. Civilizations as separate as the Egyptians of ten thousand years ago and the Central American Mayans adopted a month of thirty days and a year of twelve months. Even when the inaccuracy of a 360-day year became apparent, they preferred to retain it and add five intercalary days. The number 360 retains its psychological appeal today because it is divisible by many small integers. The technical term for such a number reflects this appeal. It is called a "smooth" number. At the other extreme are those integers with no smaller divisors other than 1, integers which might be called the indivisibles. The mystic qualities of numbers such as 7 and 13 derive in no small part from the fact that they are indivisibles. The ancient Greeks realized that every integer could be written uniquely as a product of indivisibles larger than 1, what we appropriately call prime numbers. To know the decomposition of an integer into a product of primes is to have a complete description of all of its divisors.

The worthy purpose of this text is to provide a complete, self-contained development of the trace formula and theta inversion formula for SL(2, Z i])\SL(2, C). Unlike other treatments of the theory, the approach taken here is to begin with the heat kernel on SL(2, C) associated to the invariant Laplacian, which is derived using spherical inversion. The heat kernel on the quotient space SL(2, Z i])\SL(2, C) is arrived at through periodization, and further expanded in an eigenfunction expansion. A theta inversion formula is obtained by studying the trace of the heat kernel. Following the author's previous work, the inversion formula then leads to zeta functions through the Gauss transform.

From the reviews: "This is a textbook in cryptography with emphasis on algebraic methods. It is supported by many exercises (with answers) making it appropriate for a course in mathematics or computer science. ...] Overall, this is an excellent expository text, and will be very useful to both the student and researcher." Mathematical Reviews

Number theory is a branch of mathematics which draws its vitality from a rich historical background. It is also traditionally nourished through interactions with other areas of research, such as algebra, algebraic geometry, topology, complex analysis and harmonic analysis. More recently, it has made a spectacular appearance in the field of theoretical computer science and in questions of communication, cryptography and error-correcting codes. Providing an elementary introduction to the central topics in number theory, this book spans multiple areas of research. The first part corresponds to an advanced undergraduate course. All of the statements given in this part are of course accompanied by their proofs, with perhaps the exception of some results appearing at the end of the chapters. A copious list of exercises, of varying difficulty, are also included here. The second part is of a higher level and is relevant for the first year of graduate school. It contains an introduction to elliptic curves and a chapter entitled "Developments and Open Problems", which introduces and brings together various themes oriented toward ongoing mathematical research. Given the multifaceted nature of number theory, the primary aims of this book are to: - provide an overview of the various forms of mathematics useful for studying numbers - demonstrate the necessity of deep and classical themes such as Gauss sums - highlight the role that arithmetic plays in modern applied mathematics - include recent proofs such as the polynomial primality algorithm - approach subjects of contemporary research such as elliptic curves - illustrate the beauty of arithmetic The prerequisites for this text are undergraduate level algebra and a little topology of Rn. It will be of use to undergraduates, graduates and phd students, and may also appeal to professional mathematicians as a reference text.

This is a book about prime numbers, congruences, secret messages, and elliptic curves that you can read cover to cover. It grew out of undergr- uate courses that the author taught at Harvard, UC San Diego, and the University of Washington. The systematic study of number theory was initiated around 300B. C. when Euclid proved that there are in?nitely many prime numbers, and also cleverly deduced the fundamental theorem of arithmetic, which asserts that every positive integer factors uniquely as a product of primes. Over a thousand years later (around 972A. D. ) Arab mathematicians formulated the congruent number problem that asks for a way to decide whether or not a given positive integer n is the area of a right triangle, all three of whose sides are rational numbers. Then another thousand years later (in 1976), Di?e and Hellman introduced the ?rst ever public-key cryptosystem, which enabled two people to communicate secretely over a public communications channel with no predetermined secret; this invention and the ones that followed it revolutionized the world of digital communication. In the 1980s and 1990s, elliptic curves revolutionized number theory, providing striking new insights into the congruent number problem, primality testing, publ- key cryptography, attacks on public-key systems, and playing a central role in Andrew Wiles' resolution of Fermat's Last Theorem.

Random matrix theory is an area of mathematics first developed by physicists interested in the energy levels of atomic nuclei, but it can also be used to describe some exotic phenomena in the number theory of elliptic curves. The purpose of this book is to illustrate this interplay of number theory and random matrices. It begins with an introduction to elliptic curves and the fundamentals of modelling by a family of random matrices, and moves on to highlight the latest research. There are expositions of current research on ranks of elliptic curves, statistical properties of families of elliptic curves and their associated L-functions and the emerging uses of random matrix theory in this field. Most of the material here had its origin in a Clay Mathematics Institute workshop on this topic at the Newton Institute in Cambridge and together these contributions provide a unique in-depth treatment of the subject.

This volume mainly deals with the dynamics of finitely valued sequences, and more specifically, of sequences generated by substitutions and automata. Those sequences demonstrate fairly simple combinatorical and arithmetical properties and naturally appear in various domains. As the title suggests, the aim of the initial version of this book was the spectral study of the associated dynamical systems: the first chapters consisted in a detailed introduction to the mathematical notions involved, and the description of the spectral invariants followed in the closing chapters.

This approach, combined with new material added to the new edition, results in a nearly self-contained book on the subject. New tools - which have also proven helpful in other contexts - had to be developed for this study. Moreover, its findings can be concretely applied, the method providing an algorithm to exhibit the spectral measures and the spectral multiplicity, as is demonstrated in several examples. Beyond this advanced analysis, many readers will benefit from the introductory chapters on the spectral theory of dynamical systems; others will find complements on the spectral study of bounded sequences; finally, a very basic presentation of substitutions, together with some recent findings and questions, rounds out the book.

In [Hardy and Williams, 1986] the authors exploited a very simple idea to obtain a linear congruence involving class numbers of imaginary quadratic fields modulo a certain power of 2. Their congruence provided a unified setting for many congruences proved previously by other authors using various means. The Hardy-Williams idea was as follows. Let d be the discriminant of a quadratic field. Suppose that d is odd and let d = PIP2* . . Pn be its unique decomposition into prime discriminants. Then, for any positive integer k coprime with d, the congruence holds trivially as each Legendre-Jacobi-Kronecker symbol (~) has the value + 1 or -1. Expanding this product gives ~ eld e:=l (mod4) where e runs through the positive and negative divisors of d and v (e) denotes the number of distinct prime factors of e. Summing this congruence for o < k < Idl/8, gcd(k, d) = 1, gives ~ (-It(e) ~ (~) =:O(mod2n). eld o

[Hilbert's] style has not the terseness of many of our modem authors in mathematics, which is based on the assumption that printer's labor and paper are costly but the reader's effort and time are not. H. Weyl [143] The purpose of this book is to describe the classical problems in additive number theory and to introduce the circle method and the sieve method, which are the basic analytical and combinatorial tools used to attack these problems. This book is intended for students who want to lel?Ill additive number theory, not for experts who already know it. For this reason, proofs include many "unnecessary" and "obvious" steps; this is by design. The archetypical theorem in additive number theory is due to Lagrange: Every nonnegative integer is the sum of four squares. In general, the set A of nonnegative integers is called an additive basis of order h if every nonnegative integer can be written as the sum of h not necessarily distinct elements of A. Lagrange 's theorem is the statement that the squares are a basis of order four. The set A is called a basis offinite order if A is a basis of order h for some positive integer h. Additive number theory is in large part the study of bases of finite order. The classical bases are the squares, cubes, and higher powers; the polygonal numbers; and the prime numbers. The classical questions associated with these bases are Waring's problem and the Goldbach conjecture.

The relation between mathematics and physics has a long history, in which the role of number theory and of other more abstract parts of mathematics has recently become more prominent.

More than ten years after a first meeting in 1989 between number theorists and physicists at the Centre de Physique des Houches, a second 2-week event focused on the broader interface of number theory, geometry, and physics.

This book is the result of that exciting meeting, and collects, in 2 volumes, extended versions of the lecture courses, followed by shorter texts on special topics, of eminent mathematicians and physicists.

The present volume has three parts: Conformal Field Theories, Discrete Groups, Renomalization.

The companion volume is subtitled: On Random Matrices, Zeta Functions and Dynamical Systems (Springer, 3-540-23189-7).

Computers have stretched the limits of what is possible in mathematics. More: they have given rise to new fields of mathematical study; the analysis of new and traditional algorithms, the creation of new paradigms for implementing computational methods, the viewing of old techniques from a concrete algorithmic vantage point, to name but a few. Computational Algebra and Number Theory lies at the lively intersection of computer science and mathematics. It highlights the surprising width and depth of the field through examples drawn from current activity, ranging from category theory, graph theory and combinatorics, to more classical computational areas, such as group theory and number theory. Many of the papers in the book provide a survey of their topic, as well as a description of present research. Throughout the variety of mathematical and computational fields represented, the emphasis is placed on the common principles and the methods employed. Audience: Students, experts, and those performing current research in any of the topics mentioned above.

A new and complete treatment of semi-abelian degenerations of abelian varieties, and their application to the construction of arithmetic compactifications of Siegel moduli space, with most of the results being published for the first time. Highlights of the book include a classification of semi-abelian schemes, construction of the toroidal and the minimal compactification over the integers, heights for abelian varieties over number fields, and Eichler integrals in several variables, together with a new approach to Siegel modular forms. A valuable source of reference for researchers and graduate students interested in algebraic geometry, Shimura varieties or diophantine geometry.

This book deals with several aspects of what is now called "explicit number theory." The central theme is the solution of Diophantine equations, i.e., equations or systems of polynomial equations which must be solved in integers, rational numbers or more generally in algebraic numbers. This theme, in particular, is the central motivation for the modern theory of arithmetic algebraic geometry. In this text, this is considered through three of its most basic aspects. The local aspect, global aspect, and the third aspect is the theory of zeta and L-functions. This last aspect can be considered as a unifying theme for the whole subject.

This informative and exhaustive study gives a problem-solving approach to the difficult subject of analytic number theory. It is primarily aimed at graduate students and senior undergraduates. The goal is to provide a rapid introduction to analytic methods and the ways in which they are used to study the distribution of prime numbers. The book also includes an introduction to p-adic analytic methods. It is ideal for a first course in analytic number theory. The new edition has been completely rewritten, errors have been corrected, and there is a new chapter on the arithmetic progression of primes.

Elementary number theory is concerned with arithmetic properties of the ring of integers. Early in the development of number theory, it was noticed that the ring of integers has many properties in common with the ring of polynomials over a finite field. The first part of this book illustrates this relationship by presenting, for example, analogues of the theorems of Fermat and Euler, Wilson?'s theorem, quadratic (and higher) reciprocity, the prime number theorem, and Dirichlet?'s theorem on primes in an arithmetic progression. After presenting the required foundational material on function fields, the later chapters explore the analogy between global function fields and algebraic number fields. A variety of topics are presented, including: the ABC-conjecture, Artin?'s conjecture on primitive roots, the Brumer-Stark conjecture, Drinfeld modules, class number formulae, and average value theorems.

Number theory has a wealth of long-standing problems, the study of which over the years has led to major developments in many areas of mathematics. This volume consists of seven significant chapters on number theory and related topics. Written by distinguished mathematicians, key topics focus on multipartitions, congruences and identities (G. Andrews), the formulas of Koshliakov and Guinand in Ramanujan's Lost Notebook (B. C. Berndt, Y. Lee, and J. Sohn), alternating sign matrices and the Weyl character formulas (D. M. Bressoud), theta functions in complex analysis (H. M. Farkas), representation functions in additive number theory (M. B. Nathanson), and mock theta functions, ranks, and Maass forms (K. Ono), and elliptic functions (M. Waldschmidt).

This book explores the theory of abelian varieties over the field of complex numbers, explaining both classic and recent results in modern language. The second edition adds five chapters on recent results including automorphisms and vector bundles on abelian varieties, algebraic cycles and the Hodge conjecture. ." . . far more readable than most . . . it is also much more complete." Olivier Debarre in Mathematical Reviews, 1994.

The book deals with algorithmic problems related to binary quadratic forms. It uniquely focuses on the algorithmic aspects of the theory. The book introduces the reader to important areas of number theory such as diophantine equations, reduction theory of quadratic forms, geometry of numbers and algebraic number theory. The book explains applications to cryptography and requires only basic mathematical knowledge. The author is a world leader in number theory.

Number Theory: Tradition and Modernization is a collection of survey and research papers on various topics in number theory. Though the topics and descriptive details appear varied, they are unified by two underlying principles: first, making everything readable as a book, and second, making a smooth transition from traditional approaches to modern ones by providing a rich array of examples.

The chapters are presented in quite different in depth and cover a variety of descriptive details, but the underlying editorial principle enables the reader to have a unified glimpse of the developments of number theory. Thus, on the one hand, the traditional approach is presented in great detail, and on the other, the modernization of the methods in number theory is elaborated. The book emphasizes a few common features such as functional equations for various zeta-functions, modular forms, congruence conditions, exponential sums, and algorithmic aspects.

Triangular arrays are a unifying thread throughout various areas of discrete mathematics such as number theory and combinatorics. They can be used to sharpen a variety of mathematical skills and tools, such as pattern recognition, conjecturing, proof-techniques, and problem-solving techniques.
While a good deal of research exists concerning triangular arrays and their applications, the information is scattered in various journals and is inaccessible to many mathematicians. This is the first text that will collect and organize the information and present it in a clear and comprehensive introduction to the topic. An invaluable resource book, it gives a historical introduction to Pascal's triangle and covers application topics such as binomial coefficients, figurate numbers, Fibonacci and Lucas numbers, Pell and Pell-Lucas numbers, graph theory, Fibonomial and tribinomial coefficients and Fibonacci and Lucas polynomials, amongst others. The book also features the historical development of triangular arrays, including short biographies of prominent mathematicians, along with the name and affiliation of every discoverer and year of discovery. The book is intended for mathematicians as well as computer scientists, math and science teachers, advanced high school students, and those with mathematical curiosity and maturity.

In the Riemann zeta function ?(s), the non-real zeros or Riemann zeros, denoted ?, play an essential role mainly in number theory, and thereby g- erate considerable interest. However, they are very elusive objects. Thus, no individual zero has an analytically known location; and the Riemann - pothesis, which states that all those zeros should lie on the critical line, i.e., 1 haverealpart, haschallengedmathematicianssince1859(exactly150years 2 ago). For analogous symmetric sets of numbers{v}, such as the roots of a k polynomial, the eigenvalues of a ?nite or in?nite matrix, etc., it is well known that symmetric functions of the{v} tend to have more accessible properties k than the individual elements v . And, we ?nd the largest wealth of explicit k properties to occur in the (generalized) zeta functions of the generic form 's Zeta(s, a)= (v ]a) k k (with the extra option of replacing v here by selected functions f(v )). k k Not surprisingly, then, zeta functions over the Riemann zeros have been considered, some as early as 1917.What is surprising is how small the lite- ture on those zeta functions has remained overall.We were able to spot them in barely a dozen research articles over the whole twentieth century and in none ofthebooks featuring the Riemannzeta function. So the domainexists, but it has remained largely con?dential and sporadically covered, in spite of a recent surge of interest. Could it then be that those zeta functions have few or uninteresting pr- erties?Inactualfact, theirstudyyieldsanabundanceofquiteexplicitresu

This book started with "Lattice Theory, First Concepts," in 1971. Then came "General Lattice Theory," First Edition, in 1978, and the Second Edition twenty years later. Since the publication of the first edition in 1978, "General Lattice Theory" has become the authoritative introduction to lattice theory for graduate students and the standard reference for researchers. The First Edition set out to introduce and survey lattice theory. Some 12,000 papers have been published in the field since then; so "Lattice Theory: Foundation" focuses on introducing the field, laying the foundation for special topics and applications. "Lattice Theory: Foundation," based on the previous three books, covers the fundamental concepts and results. The main topics are distributivity, congruences, constructions, modularity and semimodularity, varieties, and free products. The chapter on constructions is new, all the other chapters are revised and expanded versions from the earlier volumes. Almost 40 diamond sections, many written by leading specialists in these fields, provide a brief glimpse into special topics beyond the basics. Lattice theory has come a long way... For those who appreciate lattice theory, or who are curious about its techniques and intriguing internal problems, Professor Gratzer's lucid new book provides a most valuable guide to many recent developments. Even a cursory reading should provide those few who may still believe that lattice theory is superficial or naive, with convincing evidence of its technical depth and sophistication. "Bulletin of the American Mathematical Society" Gratzer s book General Lattice Theory has become the lattice theorist s bible. "Mathematical Reviews"

This book presents the Riemann Hypothesis, connected problems, and a taste of the body of theory developed towards its solution. It is targeted at the educated non-expert. Almost all the material is accessible to any senior mathematics student, and much is accessible to anyone with some university mathematics.

The appendices include a selection of original papers. This collection is not very large and encompasses only the most important milestones in the evolution of theory connected to the Riemann Hypothesis. The appendices also include some authoritative expository papers. These are the "expert witnesses whose insight into this field is both invaluable and irreplaceable.

Arithmetic Geometry can be defined as the part of Algebraic Geometry connected with the study of algebraic varieties through arbitrary rings, in particular through non-algebraically closed fields. It lies at the intersection between classical algebraic geometry and number theory. A C.I.M.E. Summer School devoted to arithmetic geometry was held in Cetraro, Italy in September 2007, and presented some of the most interesting new developments in arithmetic geometry. This book collects the lecture notes which were written up by the speakers. The main topics concern diophantine equations, local-global principles, diophantine approximation and its relations to Nevanlinna theory, and rationally connected varieties. The book is divided into three parts, corresponding to the courses given by J-L Colliot-Thelene, Peter Swinnerton Dyer and Paul Vojta.

This book has a nonstandard choice of topics, including material on differential galois groups and proofs of the transcendence of e and pi.

The author uses a conversational tone and has included a selection of stamps to accompany the text.