Harold Davenport was one of the truly great mathematicians of the twentieth century. Based on lectures he gave at the University of Michigan in the early 1960s, this book is concerned with the use of analytic methods in the study of integer solutions to Diophantine equations and Diophantine inequalities. It provides an excellent introduction to a timeless area of number theory that is still as widely researched today as it was when the book originally appeared. The three main themes of the book are Waring's problem and the representation of integers by diagonal forms, the solubility in integers of systems of forms in many variables, and the solubility in integers of diagonal inequalities. For the second edition of the book a comprehensive foreword has been added in which three prominent authorities describe the modern context and recent developments. A thorough bibliography has also been added.

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.

Ramsey theory is the study of the structure of mathematical objects that is preserved under partitions. In its full generality, Ramsey theory is quite powerful, but can quickly become complicated. By limiting the focus of this book to Ramsey theory applied to the set of integers, the authors have produced a gentle, but meaningful, introduction to an important and enticing branch of modern mathematics. Ramsey Theory on the Integers offers students a glimpse into the world of mathematical research and the opportunity for them to begin pondering unsolved problems. For this new edition, several sections have been added and others have been significantly updated. Among the newly introduced topics are: rainbow Ramsey theory, an "inequality" version of Schur's theorem, monochromatic solutions of recurrence relations, Ramsey results involving both sums and products, monochromatic sets avoiding certain differences, Ramsey properties for polynomial progressions, generalizations of the Erdos-Ginzberg-Ziv theorem, and the number of arithmetic progressions under arbitrary colorings. Many new results and proofs have been added, most of which were not known when the first edition was published. Furthermore, the book's tables, exercises, lists of open research problems, and bibliography have all been significantly updated. This innovative book also provides the first cohesive study of Ramsey theory on the integers. It contains perhaps the most substantial account of solved and unsolved problems in this blossoming subject. This breakthrough book will engage students, teachers, and researchers alike.

Introduction to Number Theory covers the essential content of an introductory number theory course including divisibility and prime factorization, congruences, and quadratic reciprocity. The instructor may also choose from a collection of additional topics. Aligning with the trend toward smaller, essential texts in mathematics, the author strives for clarity of exposition. Proof techniques and proofs are presented slowly and clearly. The book employs a versatile approach to the use of algebraic ideas. Instructors who wish to put this material into a broader context may do so, though the author introduces these concepts in a non-essential way. A final chapter discusses algebraic systems (like the Gaussian integers) presuming no previous exposure to abstract algebra. Studying general systems urges students realize unique factorization into primes is a more subtle idea than may at first appear; students will find this chapter interesting, fun and quite accessible. Applications of number theory include several sections on cryptography and other applications to further interest instructors and students alike.

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.

The aim of this book is NOT to cover discrete mathematics in depth. Rather, it discusses a number of selected results and methods, mostly from the areas of combinatorics and graph theory, along with some elementary number theory and combinatorial geometry. The authors develop most topics to the extent that they can describe the discrete mathematics behind an important application of mathematics such as discrete optimization problems, the Law of Large Numbers, cryptography, and coding to name a few. Another feature that is not covered in other discrete mathematics books is the use of ESTIMATES (How many digits does 100! have? or Which is larger: 2100 or 100!?). There are questions posed in the text and problems at the end of each chapter with solutions for many of them at the end of the book. The book is based on a course taught for several years by two of the authors at Yale University.

Matrix Methods: Applied Linear Algebra and Sabermetrics, Fourth Edition, provides a unique and comprehensive balance between the theory and computation of matrices. Rapid changes in technology have made this valuable overview on the application of matrices relevant not just to mathematicians, but to a broad range of other fields. Matrix methods, the essence of linear algebra, can be used to help physical scientists-- chemists, physicists, engineers, statisticians, and economists-- solve real world problems.

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 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 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.

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.

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 volume contains the expanded versions of the lectures given by the authors at the C.I.M.E. instructional conference held in Cetraro, Italy, from July 12 to 19, 1997. The papers collected here are broad surveys of the current research in the arithmetic of elliptic curves, and also contain several new results which cannot be found elsewhere in the literature. Owing to clarity and elegance of exposition, and to the background material explicitly included in the text or quoted in the references, the volume is well suited to research students as well as to senior mathematicians.

Galois theory is a central part of algebra, dealing with symmetries between solutions of algebraic equations in one variable. This collection of papers brings together articles from some of the world's leading experts in this field. Topics center around the Inverse Galois Problem, comprising the full range of methods and approaches in this area, making this an invaluable resource for all those whose research involves Galois theory.

The aim of this book is to provide an introduction to quadratic forms that builds from basics up to the most recent results. Professor Kitaoka is well known for his work in this area, and in this book he covers many aspects of the subject, including lattice theory, Siegel's formula, and some results involving tensor products of positive definite quadratic forms. The reader is required to have only a knowledge of algebraic number fields, making this book ideal for graduate students and researchers wishing for an insight into quadratic forms.

Intermediate in level between an advanced textbook and a monograph, this book covers both the classical and representation theoretic views of automorphic forms in a style which is accessible to graduate students entering the field. The treatment is based on complete proofs, which reveal the uniqueness principles underlying the basic constructions. The book features extensive foundational material on the representation theory of GL(1) and GL(2) over local fields, the theory of automorphic representations, L-functions and advanced topics such as the Langlands conjectures, the Weil representation, the Rankin-Selberg method and the triple L-function, examining this subject matter from many different and complementary viewpoints. Researchers as well as students will find this a valuable guide to a notoriously difficult subject.

Beginning with a brief introduction to algorithms and diophantine equations, this volume provides a coherent modern account of the methods used to find all the solutions to certain diophantine equations, particularly those developed for use on a computer. The study is divided into three parts, emphasizing approaches with a wide range of applications. The first section considers basic techniques including local methods, sieving, descent arguments and the LLL algorithm. The second section explores problems that can be solved using Baker's theory of linear forms in logarithms. The final section looks at problems associated with curves, focusing on rational and integral points on elliptic curves. Each chapter concludes with a useful set of exercises. A detailed bibliography is included. This book will appeal to graduate students and research workers interested in solving diophantine equations using computational methods.

This book develops the theory of partitions. Simply put, the partitions of a number are the ways of writing that number as sums of positive integers. For example, the five partitions of 4 are 4: 3+1, 2+2, 2+1+1, and 1+1+1+1. Surprisingly, such a simple matter requires some deep mathematics for its study. This book considers the many theoretical aspects of this subject, which have in turn recently found applications to statistical mechanics, computer science and other branches of mathematics. With minimal prerequisites, this book is suitable for students as well as researchers in combinatorics, analysis, and number theory.

This is the first of two volumes providing an introduction to modern developments in the representation theory of finite groups and associative algebras, which have transformed the subject into a study of categories of modules. Thus, Dr. Benson's unique perspective in this book incorporates homological algebra and the theory of representations of finite-dimensional algebras. This volume is primarily concerned with the exposition of the necessary background material, and the heart of the discussion is a lengthy introduction to the (Auslander-Reiten) representation theory of finite dimensional algebras, in which the techniques of quivers with relations and almost-split sequences are discussed in some detail.

Now the most used texbook for introductory cryptography courses in both mathematics and computer science, the Third Edition builds upon previous editions by offering several new sections, topics, and exercises. The authors present the core principles of modern cryptography, with emphasis on formal definitions, rigorous proofs of security.

From the reviews: ..". The author succeeded in an excellent way to describe the various points of view under which Class Field Theory can be seen. ... In any case the author succeeded to write a very readable book on these difficult themes." "Monatshefte fuer Mathematik, 1994"
..". Number theory is not easy and quite technical at several places, as the author is able to show in his technically good exposition. The amount of difficult material well exposed gives a survey of quite a lot of good solid classical number theory... Conclusion: for people not already familiar with this field this book is not so easy to read, but for the specialist in number theory this is a useful description of (classical) algebraic number theory." "Medelingen van het" "wiskundig genootschap, 1995"

This is Volume 2 of a two-volume book that provides a self-contained introduction to the theory and application of automorphic forms, using examples to illustrate several critical analytical concepts surrounding and supporting the theory of automorphic forms. The two-volume book treats three instances, starting with some small unimodular examples, followed by adelic GL2, and finally GLn. Volume 2 features critical results, which are proven carefully and in detail, including automorphic Green's functions, metrics and topologies on natural function spaces, unbounded operators, vector-valued integrals, vector-valued holomorphic functions, and asymptotics. Volume 1 features discrete decomposition of cuspforms, meromorphic continuation of Eisenstein series, spectral decomposition of pseudo-Eisenstein series, and automorphic Plancherel theorem. With numerous proofs and extensive examples, this classroom-tested introductory text is meant for a second-year or advanced graduate course in automorphic forms, and also as a resource for researchers working in automorphic forms, analytic number theory, and related fields.

This volume presents an authoritative, up-to-date review of analytic number theory. It contains outstanding contributions from leading international figures in this field. Core topics discussed include the theory of zeta functions, spectral theory of automorphic forms, classical problems in additive number theory such as the Goldbach conjecture, and diophantine approximations and equations. This will be a valuable book for graduates and researchers working in number theory.