This book introduces the theory of modular forms, from which all rational elliptic curves arise, with an eye toward the Modularity Theorem. Discussion covers elliptic curves as complex tori and as algebraic curves; modular curves as Riemann surfaces and as algebraic curves; Hecke operators and Atkin-Lehner theory; Hecke eigenforms and their arithmetic properties; the Jacobians of modular curves and the Abelian varieties associated to Hecke eigenforms. As it presents these ideas, the book states the Modularity Theorem in various forms, relating them to each other and touching on their applications to number theory. The authors assume no background in algebraic number theory and algebraic geometry. Exercises are included.

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 set of lectures provides a structured introduction to the concept of equidistribution in number theory. This concept is of growing importance in many areas, including cryptography, zeros of L-functions, Heegner points, prime number theory, the theory of quadratic forms, and the arithmetic aspects of quantum chaos.

The volume brings together leading researchers from a range of fields who reveal fascinating links between seemingly disparate areas.

Outer billiards provides a toy model for planetary motion and exhibits intricate and mysterious behavior even for seemingly simple examples. It is a dynamical system in which a particle in the plane moves around the outside of a convex shape according to a scheme that is reminiscent of ordinary billiards. The Plaid Model, which is a self-contained sequel to Richard Schwartz's Outer Billiards on Kites, provides a combinatorial model for orbits of outer billiards on kites. Schwartz relates these orbits to such topics as polytope exchange transformations, renormalization, continued fractions, corner percolation, and the Truchet tile system. The combinatorial model, called "the plaid model," has a self-similar structure that blends geometry and elementary number theory. The results were discovered through computer experimentation and it seems that the conclusions would be extremely difficult to reach through traditional mathematics. The book includes an extensive computer program that allows readers to explore the materials interactively and each theorem is accompanied by a computer demonstration.

This book is an exploration of philosophical questions about infinity. Graham Oppy examines how the infinite lurks everywhere, both in science and in our ordinary thoughts about the world. He also analyses the many puzzles and paradoxes that follow in the train of the infinite. Even simple notions, such as counting, adding and maximising present serious difficulties. Other topics examined include the nature of space and time, infinities in physical science, infinities in theories of probability and decision, the nature of part/whole relations, mathematical theories of the infinite, and infinite regression and principles of sufficient reason.

Die Kryptologie, eine jahrtausendealte "Geheimwissenschaft," gewinnt zusehends praktische Bedeutung fur den Schutz von Kommunikationswegen, Datenbanken und Software. Neben ihre Nutzung in rechnergestutzten offentlichen Nachrichtensystemen ("public keys") treten mehr und mehr rechnerinterne Anwendungen, wie Zugriffsberechtigungen und der Quellenschutz von Software. - Der erste Teil des Buches behandelt die Geheimschriften und ihren Gebrauch - die Kryptographie. Dabei wird auch auf das aktuelle Thema "Kryptographie und Grundrechte des Burgers" eingegangen. Im zweiten Teil wird das Vorgehen zum unbefugten Entziffern einer Geheimschrift - die Kryptanalyse - besprochen, wobei insbesondere Hinweise zur Beurteilung der Verfahrenssicherheit gegeben werden. Mit der vorliegenden dritten Auflage wurde das Werk auf den neuesten Stand gebracht. - Das Buch setzt nur mathematische Grundkenntnisse voraus. Mit einer Fulle spannender, lustiger und bisweilen anzuglicher Geschichten aus der historischen Kryptologie gewurzt, ist es auch fur Laien reizvoll zu lesen."

The decomposition of the space L2 (G(Q)\G(/A)), where G is a reductive group defined over (Q and /A is the ring of adeles of (Q, is a deep problem at the intersection of number and group theory. Langlands reduced this decomposition to that of the (smaller) spaces of cuspidal automorphic forms for certain subgroups of G. The present book describes this proof in detail. The starting point is the theory of automorphic forms, which can also serve as a first step towards understanding the Arthur-Selberg trace formula. To make the book reasonably self-contained, the authors have also provided essential background to subjects such as automorphic forms, Eisenstein series, Eisenstein pseudo-series (or wave-packets) and their properties. It is thus also an introduction, suitable for graduate students, to the theory of automorphic forms, written using contemporary terminology. It will be welcomed by number theorists, representation theorists, and all whose work involves the Langlands program.

A deep understanding of prime numbers is one of the great challenges in mathematics. In this new edition, fundamental theorems, challenging open problems, and the most recent computational records are presented in a language without secrets. The impressive wealth of material and references will make this book a favorite companion and a source of inspiration to all readers.

Paulo Ribenboim is Professor Emeritus at Queen's University in Canada, Fellow of the Royal Society of Canada, and recipient of the George Polya Award of the Mathematical Association of America. He is the author of 13 books and more than 150 research articles.

From the reviews of the First Edition:

Number Theory and mathematics as a whole will benefit from having such an accessible book exposing advanced material. There is no question that this book will succeed in exciting many new people to the beauty and fascination of prime numbers, and will probably bring more young people to research in these areas. (Andrew Granville, Zentralblatt)"

The theory of integer partitions is a subject of enduring interest. A major research area in its own right, it has found numerous applications, and celebrated results such as the Rogers-Ramanujan identities make it a topic filled with the true romance of mathematics. The aim in this introductory textbook is to provide an accessible and wide ranging introduction to partitions, without requiring anything more of the reader than some familiarity with polynomials and infinite series. Many exercises are included, together with some solutions and helpful hints. The book has a short introduction followed by an initial chapter introducing Euler's famous theorem on partitions with odd parts and partitions with distinct parts. This is followed by chapters titled: Ferrers Graphs, The Rogers-Ramanujan Identities, Generating Functions, Formulas for Partition Functions, Gaussian Polynomials, Durfee Squares, Euler Refined, Plane Partitions, Growing Ferrers Boards, and Musings.

The legacy of Helmut Hasse, consisting of letters, manuscripts and other - pers, is kept at theHandschriftenabteilung of the University Library at Gottin- ] gen.Hassehadanextensivecorrespondence;helikedtoexchangemathematical ideas, results and methods freely with his colleagues. There are more than 8000 documents preserved. Although not all of them are of equal mathematical - terest, searching through this treasure can help us to assess the development of Number Theory through the 1920's and 1930's. Unfortunately, most of the correspondence is preserved on one side only, i.e., the letterssenttoHasse are availablewhereasmanyoftheletterswhichhadbeensentfromhim, oftenha- written, seem to be lost. So we have to interpolate, as far as possible, from the repliestoHasseandfromothercontexts, inorderto?ndoutwhathehadwritten 1 in his outgoing letters. The present article is largely based on the letters and other documents which I have found concerning the Brauer-Hasse-NoetherTheorem in the theory of algebras; this covers the years around 1931. Besides the do- ments from the Hasse and the Brauer legacy in Gottingen, ] I shall also use some letters from Emmy Noether to Richard Brauer which are preserved at the Bryn Mawr College Library (Pennsylvania, USA)."

The theory of integer partitions is a subject of enduring interest. A major research area in its own right, it has found numerous applications, and celebrated results such as the Rogers-Ramanujan identities make it a topic filled with the true romance of mathematics. The aim in this introductory textbook is to provide an accessible and wide ranging introduction to partitions, without requiring anything more of the reader than some familiarity with polynomials and infinite series. Many exercises are included, together with some solutions and helpful hints. The book has a short introduction followed by an initial chapter introducing Euler's famous theorem on partitions with odd parts and partitions with distinct parts. This is followed by chapters titled: Ferrers Graphs, The Rogers-Ramanujan Identities, Generating Functions, Formulas for Partition Functions, Gaussian Polynomials, Durfee Squares, Euler Refined, Plane Partitions, Growing Ferrers Boards, and Musings.

Sir Peter Swinnerton-Dyer's mathematical career encompasses more than 60 years' work of amazing creativity. This volume provides contemporary insight into several subjects in which Sir Peter's influence has been notable, and is dedicated to his 75th birthday. The opening section reviews some of his many remarkable contributions to mathematics and other fields. The remaining contributions come from leading researchers in analytic and arithmetic number theory, and algebraic geometry. The topics treated include: rational points on algebraic varieties, the Hasse principle, Shafarevich-Tate groups of elliptic curves and motives, Zagier's conjectures, descent and zero-cycles, Diophantine approximation, and Abelian and Fano varieties.

Algebraic number theory is a subject which came into being through the attempts of mathematicians to try to prove Fermat's last theorem and which now has a wealth of applications to diophantine equations, cryptography, factoring, primality testing and public-key cryptosystems. This book provides an introduction to the subject suitable for senior undergraduates and beginning graduate students in mathematics. The material is presented in a straightforward, clear and elementary fashion, and the approach is hands on, with an explicit computational flavour. Prerequisites are kept to a minimum, and numerous examples illustrating the material occur throughout the text. References to suggested reading and to the biographies of mathematicians who have contributed to the development of algebraic number theory are given at the end of each chapter. There are over 320 exercises, an extensive index, and helpful location guides to theorems and lemmas in the text.

Algebraic number theory is a subject which came into being through the attempts of mathematicians to try to prove Fermat's last theorem and which now has a wealth of applications to diophantine equations, cryptography, factoring, primality testing and public-key cryptosystems. This book provides an introduction to the subject suitable for senior undergraduates and beginning graduate students in mathematics. The material is presented in a straightforward, clear and elementary fashion, and the approach is hands on, with an explicit computational flavour. Prerequisites are kept to a minimum, and numerous examples illustrating the material occur throughout the text. References to suggested reading and to the biographies of mathematicians who have contributed to the development of algebraic number theory are given at the end of each chapter. There are over 320 exercises, an extensive index, and helpful location guides to theorems and lemmas in the text.

This text is a self-contained study of expander graphs, specifically, their explicit construction. Expander graphs are highly connected but sparse, and while being of interest within combinatorics and graph theory, they can also be applied to computer science and engineering. Only a knowledge of elementary algebra, analysis and combinatorics is required because the authors provide the necessary background from graph theory, number theory, group theory and representation theory. Thus the text can be used as a brief introduction to these subjects and their synthesis in modern mathematics.

Combining concepts of mathematics and computer science, this book is about the sequences of symbols that can be generated by simple models of computation called "finite automata". Suitable for graduate students or advanced undergraduates, it starts from elementary principles and develops the basic theory. The study then progresses to show how these ideas can be applied to solve problems in number theory and physics.

This undergraduate-level introduction describes those mathematical properties of prime numbers that can be deduced with the tools of calculus. Jeffrey Stopple pays special attention to the rich history of the subject and ancient questions on polygonal numbers, perfect numbers and amicable pairs, as well as to the important open problems. The culmination of the book is a brief presentation of the Riemann zeta function, which determines the distribution of prime numbers, and of the significance of the Riemann Hypothesis.

This undergraduate-level introduction describes those mathematical properties of prime numbers that can be deduced with the tools of calculus. Jeffrey Stopple pays special attention to the rich history of the subject and ancient questions on polygonal numbers, perfect numbers and amicable pairs, as well as to the important open problems. The culmination of the book is a brief presentation of the Riemann zeta function, which determines the distribution of prime numbers, and of the significance of the Riemann Hypothesis.

At first glance the prime numbers appear to be distributed in a very irregular way amongst the integers, but it is possible to produce a simple formula that tells (in an approximate but well-defined sense) how many primes can be found that are less than any integer. The prime number theorem tells what this formula is and it is indisputably one of the the great classical theorems of mathematics. This textbook introduces the prime number theorem and is suitable for advanced undergraduates and beginning graduate students. The author deftly shows how analytical tools can be used in number theory to attack a 'real' problem.

This text is a self-contained study of expander graphs, specifically, their explicit construction. Expander graphs are highly connected but sparse, and while being of interest within combinatorics and graph theory, they can also be applied to computer science and engineering. Only a knowledge of elementary algebra, analysis and combinatorics is required because the authors provide the necessary background from graph theory, number theory, group theory and representation theory. Thus the text can be used as a brief introduction to these subjects and their synthesis in modern mathematics.

Alan Baker's 60th birthday in August 1999 offered an ideal opportunity to organize a conference at ETH Zurich with the goal of presenting the state of the art in number theory and geometry. Many of the leaders in the subject were brought together to present an account of research in the last century as well as speculations for possible further research. The papers in this volume cover a broad spectrum of number theory including geometric, algebrao-geometric and analytic aspects. This volume will appeal to number theorists, algebraic geometers, and geometers with a number theoretic background. However, it will also be valuable for mathematicians (in particular research students) who are interested in being informed in the state of number theory at the start of the 21st century and in possible developments for the future.

The discrepancy method has produced the most fruitful line of attack on a pivotal computer science question: What is the computational power of random bits? It has also played a major role in recent developments in complexity theory. This book tells the story of the discrepancy method in a few succinct independent vignettes. The chapters explore such topics as communication complexity, pseudo-randomness, rapidly mixing Markov chains, points on a sphere, derandomization, convex hulls and Voronoi diagrams, linear programming, geometric sampling and VC-dimension theory, minimum spanning trees, circuit complexity, and multidimensional searching. The mathematical treatment is thorough and self-contained, with minimal prerequisites. More information can be found on the book's home page at http://www.cs.princeton.edu/~chazelle/book.html.

The subject of this book is arithmetic algebraic geometry, an area between number theory and algebraic geometry. It is about applying geometric methods to the study of polynomial equations in rational numbers (Diophantine equations). This book represents the first complete and coherent exposition in a single volume, of both the theory and applications of torsors to rational points. Some very recent material is included. It is demonstrated that torsors provide a unified approach to several branches of the theory which were hitherto developing in parallel.

This book provides a comprehensive account of a key, perhaps the most important, theory that forms the basis of Taylor-Wiles proof of Fermat's last theorem. Hida begins with an overview of the theory of automorphic forms on linear algebraic groups and then covers the basic theory and recent results on elliptic modular forms, including a substantial simplification of the Taylor-Wiles proof by Fujiwara and Diamond. He offers a detailed exposition of the representation theory of profinite groups (including deformation theory), as well as the Euler characteristic formulas of Galois cohomology groups. The final chapter presents a proof of a non-abelian class number formula.

This book covers most of the known results on reducibility of polynomials over arbitrary fields, algebraically closed fields and finitely generated fields. Results valid only over finite fields, local fields or the rational field are not covered here, but several theorems on reducibility of polynomials over number fields that are either totally real or complex multiplication fields are included. Some of these results are based on recent work of E. Bombieri and U. Zannier (presented here by Zannier in an appendix). The book also treats other subjects like Ritt's theory of composition of polynomials, and properties of the Mahler measure, and it concludes with a bibliography of over 300 items. This unique work will be a necessary resource for all number theorists and researchers in related fields.