This book provides a good introduction to the classical elementary number theory and the modern algorithmic number theory, and their applications in computing and information technology, including computer systems design, cryptography and network security. In this second edition proofs of many theorems have been provided, further additions and corrections were made.

This volume contains a collection of papers in Analytic and Elementary Number Theory in memory of Professor Paul Erd s, one of the greatest mathematicians of this century. Written by many leading researchers, the papers deal with the most recent advances in a wide variety of topics, including arithmetical functions, prime numbers, the Riemann zeta function, probabilistic number theory, properties of integer sequences, modular forms, partitions, and q-series. Audience: Researchers and students of number theory, analysis, combinatorics and modular forms will find this volume to be stimulating.

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.

Algebra is abstract mathematics - let us make no bones about it - yet it is also applied mathematics in its best and purest form. It is not abstraction for its own sake, but abstraction for the sake of efficiency, power and insight. Algebra emerged from the struggle to solve concrete, physical problems in geometry, and succeeded after 2000 years of failure by other forms of mathematics. It did this by exposing the mathematical structure of geometry, and by providing the tools to analyse it. This is typical of the way algebra is applied; it is the best and purest form of application because it reveals the simplest and most universal mathematical structures. The present book aims to foster a proper appreciation of algebra by showing abstraction at work on concrete problems, the classical problems of construction by straightedge and compass. These problems originated in the time of Euclid, when geometry and number theory were paramount, and were not solved until th the 19 century, with the advent of abstract algebra. As we now know, alge bra brings about a unification of geometry, number theory and indeed most branches of mathematics. This is not really surprising when one has a historical understanding of the subject, which I also hope to impart."

This book covers the development of reciprocity laws, starting from conjectures of Euler and discussing the contributions of Legendre, Gauss, Dirichlet, Jacobi, and Eisenstein. Readers knowledgeable in basic algebraic number theory and Galois theory will find detailed discussions of the reciprocity laws for quadratic, cubic, quartic, sextic and octic residues, rational reciprocity laws, and Eisensteins reciprocity law. An extensive bibliography will be of interest to readers interested in the history of reciprocity laws or in the current research in this area.

This book arose from a course of lectures given by the first author during the winter term 1977/1978 at the University of Munster (West Germany). The course was primarily addressed to future high school teachers of mathematics; it was not meant as a systematic introduction to number theory but rather as a historically motivated invitation to the subject, designed to interest the audience in number-theoretical questions and developments. This is also the objective of this book, which is certainly not meant to replace any of the existing excellent texts in number theory. Our selection of topics and examples tries to show how, in the historical development, the investigation of obvious or natural questions has led to more and more comprehensive and profound theories, how again and again, surprising connections between seemingly unrelated problems were discovered, and how the introduction of new methods and concepts led to the solution of hitherto unassailable questions. All this means that we do not present the student with polished proofs (which in turn are the fruit of a long historical development); rather, we try to show how these theorems are the necessary consequences of natural questions. Two examples might illustrate our objectives."

The theory of algebraic function fields over finite fields has its origins in number theory. However, after Goppas discovery of algebraic geometry codes around 1980, many applications of function fields were found in different areas of mathematics and information theory. This book presents survey articles on some of these new developments. The topics focus on material which has not yet been presented in other books or survey articles.

A principal ingredient in the proof of the Moonshine Theorem, connecting the Monster group to modular forms, is the infinite dimensional Lie algebra of physical states of a chiral string on an orbifold of a 26 dimensional torus, called the Monster Lie algebra. It is a Borcherds-Kac-Moody Lie algebra with Lorentzian root lattice; and has an associated automorphic form having a product expansion describing its structure. Lie superalgebras are generalizations of Lie algebras, useful for depicting supersymmetry the symmetry relating fermions and bosons. Most known examples of Lie superalgebras with a related automorphic form such as the Fake Monster Lie algebra whose reflection group is given by the Leech lattice arise from (super)string theory and can be derived from lattice vertex algebras. The No-Ghost Theorem from dual resonance theory and a conjecture of Berger-Li-Sarnak on the eigenvalues of the hyperbolic Laplacian provide strong evidence that they are of rank at most 26.

The aim of this book is to give the reader the tools to understand the ongoing classification and construction project of this class of Lie superalgebras and is ideal for a graduate course. The necessary background is given within chapters or in appendices. "

The Local Langlands Conjecture for GL(2) contributes an unprecedented text to the so-called Langlands theory. It is an ambitious research program of already 40 years and gives a complete and self-contained proof of the Langlands conjecture in the case n=2. It is aimed at graduate students and at researchers in related fields. It presupposes no special knowledge beyond the beginnings of the representation theory of finite groups and the structure theory of local fields.

This textbook illuminates the field of discrete mathematics with examples, theory, and applications of the discrete volume of a polytope. The authors have weaved a unifying thread through basic yet deep ideas in discrete geometry, combinatorics, and number theory. We encounter here a friendly invitation to the field of "counting integer points in polytopes," and its various connections to elementary finite Fourier analysis, generating functions, the Frobenius coin-exchange problem, solid angles, magic squares, Dedekind sums, computational geometry, and more. With 250 exercises and open problems, the reader feels like an active participant.

A book on any mathematical subject beyond the textbook level is of little value unless it contains new ideas and new perspectives. It helps to include new results, provided that they give the reader new insights and are presented along with known old results in a clear exposition. It is with this philosophy that the author writes this volume. The two subjects, Dirichlet series and modular forms, are traditional subjects, but here they are treated in both orthodox and unorthodox ways. Regardless of the unorthodox treatment, the author has made the book accessible to those who are not familiar with such topics by including plenty of expository material.

Includes up-to-date material on recent developments and topics of significant interest, such as elliptic functions and the new primality test

Selects material from both the algebraic and analytic disciplines, presenting several different proofs of a single result to illustrate the differing viewpoints and give good insight

An Introduction to Mathematical Cryptography provides an introduction to public key cryptography and underlying mathematics that is required for the subject. Each of the eight chapters expands on a specific area of mathematical cryptography and provides an extensive list of exercises.

It is a suitable text for advanced students in pure and applied mathematics and computer science, or the book may be used as a self-study. This book also provides a self-contained treatment of mathematical cryptography for the reader with limited mathematical background.

This book reflects the progress made in the forty years since the appearance of Abraham Robinson 's revolutionary book Nonstandard Analysis in the foundations of mathematics and logic, number theory, statistics and probability, in ordinary, partial and stochastic differential equations and in education. The contributions are clear and essentially self-contained.

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"

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: Random matrices, Zeta functions, Dynamical systems.

The companion volume is subtitled: On Conformal Field Theories, Discrete Groups and Renormalization and will be published in 2006 (Springer, 3-540-30307-3).

. . . if one wants to make progress in mathematics one should study the masters not the pupils. N. H. Abel Heeke was certainly one of the masters, and in fact, the study of Heeke L series and Heeke operators has permanently embedded his name in the fabric of number theory. It is a rare occurrence when a master writes a basic book, and Heeke's Lectures on the Theory of Algebraic Numbers has become a classic. To quote another master, Andre Weil: "To improve upon Heeke, in a treatment along classical lines of the theory of algebraic numbers, would be a futile and impossible task. " We have tried to remain as close as possible to the original text in pre serving Heeke's rich, informal style of exposition. In a very few instances we have substituted modern terminology for Heeke's, e. g., "torsion free group" for "pure group. " One problem for a student is the lack of exercises in the book. However, given the large number of texts available in algebraic number theory, this is not a serious drawback. In particular we recommend Number Fields by D. A. Marcus (Springer-Verlag) as a particularly rich source. We would like to thank James M. Vaughn Jr. and the Vaughn Foundation Fund for their encouragement and generous support of Jay R. Goldman without which this translation would never have appeared. Minneapolis George U. Brauer July 1981 Jay R."

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.

A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number theory, including recent algorithms for computing class groups and units, as well as elliptic curve computations, while the last three chapters survey factoring and primality testing methods, including a detailed description of the number field sieve algorithm. The whole is rounded off with a description of available computer packages and some useful tables, backed by numerous exercises. Written by an authority in the field, and one with great practical and teaching experience, this is certain to become the standard and indispensable reference on the subject.

Proceedings of the NATO Advanced Study Institute, Banff Centre, Canada, April 27-May 5, 1988

The book treats four mathematical concepts which play a fundamental role in many different areas of mathematics: symbolic sums, recurrence (difference) equations, generating functions, and asymptotic estimates. Their key features, in isolation or in combination, their mastery by paper and pencil or by computer programs, and their applications to problems in pure mathematics or to "real world problems" (e.g. the analysis of algorithms) are studied. The book is intended as an algorithmic supplement to the bestselling "Concrete Mathematics" by Graham, Knuth and Patashnik.

The problems are systematically arranged to reveal the evolution of concepts and ideas of the subject

Includes various levels of problems - some are easy and straightforward, while others are more challenging

All problems are elegantly solved

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.

Discovered at the turn of the 20th century, p-adic numbers are frequently used by mathematicians and physicists. This text is a self-contained presentation of basic p-adic analysis with a focus on analytic topics. It offers many features rarely treated in introductory p-adic texts such as topological models of p-adic spaces inside Euclidian space, a special case of Hazewinkel 's functional equation lemma, and a treatment of analytic elements.

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