This volume contains edited versions of 11 contributions given by main speakers at the NATO Advanced Study Institute on lReal and Complex Dynamical Systems in Hiller0d, Denmark, June 20th - July 2nd, 1993. The vision of the institute was to illustrate the interplay between two important fields of Mathematics: Real Dynamical Systems and Complex Dynamical Systems. The interaction between these two fields has been growing over the years. Problems in Real Dynamical Systems have recently been solved using complex tools in the real or by extension to the complex. In return, problems in Complex Dynamical Systems have been settled using results from Real Dynamical Systems. The programme of the institute was to examine the state of the art of central parts of both Real and Complex Dynamical Systems, to reinforce contact between the two aspects of the theory and to make recent progress in each accessible to a larger group of mathematicians.

Solutions of equations in integers is the central problem of number theory and is the focus of this book. The amount of material is suitable for a one-semester course. The author has tried to avoid the ad hoc proofs in favor of unifying ideas that work in many situations. There are exercises at the end of almost every section, so that each new idea or proof receives immediate reinforcement.

This book grew out of our lectures given in the Oberseminar on 'Cod ing Theory and Number Theory' at the Mathematics Institute of the Wiirzburg University in the Summer Semester, 2001. The coding the ory combines mathematical elegance and some engineering problems to an unusual degree. The major advantage of studying coding theory is the beauty of this particular combination of mathematics and engineering. In this book we wish to introduce some practical problems to the math ematician and to address these as an essential part of the development of modern number theory. The book consists of five chapters and an appendix. Chapter 1 may mostly be dropped from an introductory course of linear codes. In Chap ter 2 we discuss some relations between the number of solutions of a diagonal equation over finite fields and the weight distribution of cyclic codes. Chapter 3 begins by reviewing some basic facts from elliptic curves over finite fields and modular forms, and shows that the weight distribution of the Melas codes is represented by means of the trace of the Hecke operators acting on the space of cusp forms. Chapter 4 is a systematic study of the algebraic-geometric codes. For a long time, the study of algebraic curves over finite fields was the province of pure mathematicians. In the period 1977 - 1982, V. D. Goppa discovered an amazing connection between the theory of algebraic curves over fi nite fields and the theory of q-ary codes."

Every positive integer m has a product representation of the form where v, k and the ni are positive integers, and each Ei = +/- I. A value can be given for v which is uniform in the m. A representation can be computed so that no ni exceeds a certain fixed power of 2m, and the number k of terms needed does not exceed a fixed power of log 2m. Consider next the collection of finite probability spaces whose associated measures assume only rational values. Let hex) be a real-valued function which measures the information in an event, depending only upon the probability x with which that event occurs. Assuming hex) to be non negative, and to satisfy certain standard properties, it must have the form -A(x log x + (I - x) 10g(I -x". Except for a renormalization this is the well-known function of Shannon. What do these results have in common? They both apply the theory of arithmetic functions. The two widest classes of arithmetic functions are the real-valued additive and the complex-valued multiplicative functions. Beginning in the thirties of this century, the work of Erdos, Kac, Kubilius, Turan and others gave a discipline to the study of the general value distribution of arithmetic func tions by the introduction of ideas, methods and results from the theory of Probability. I gave an account of the resulting extensive and still developing branch of Number Theory in volumes 239/240 of this series, under the title Probabilistic Number Theory.

The exposition of the classical theory of algebraic numbers is clear and thorough, and there is a large number of exercises as well as worked out numerical examples. A careful study of this book will provide a solid background to the learning of more recent topics.

On the one hand, this monograph serves as a self-contained introduction to Nevanlinna's theory of value distribution because the authors only assume the reader is familiar with the basics of complex analysis. On the other hand, the monograph also serves as a valuable reference for the research specialist because the authors present, for the first time in book form, the most modern and refined versions of the Second Main Theorem with precise error terms, in both the geometric and logarithmic derivative based approaches. A unique feature of the monograph is its "number-theoretic digressions." These special sections assume no background in number theory and explore the exciting interconnections between Nevanlinna theory and the theory of Diophantine approximation.

This book is designed for a computationally intensive graduate course based around a collection of classical unsolved extremal problems for polynomials. These problems, all of which lend themselves to extensivecomputational exploration, live at the interface of analysis, combinatorics and number theory so the techniques involved are diverse.A main computational tool used is the LLL algorithm for finding small vectors in a lattice.Many exercises and open research problems are included. Indeed one aim of the book is to tempt the able reader into the rich possibilities for research in this area.Peter Borwein is Professor of Mathematics at Simon Fraser University and the Associate Director of the Centre for Experimental and Constructive Mathematics. He is also the recipient of the Mathematical Association of America's Chauvenet Prize and the Merten M. Hasse Prize for expositorywriting in mathematics.

The goal of this book is to present local class field theory from the cohomo logical point of view, following the method inaugurated by Hochschild and developed by Artin-Tate. This theory is about extensions-primarily abelian-of "local" (i.e., complete for a discrete valuation) fields with finite residue field. For example, such fields are obtained by completing an algebraic number field; that is one of the aspects of "localisation." The chapters are grouped in "parts." There are three preliminary parts: the first two on the general theory of local fields, the third on group coho mology. Local class field theory, strictly speaking, does not appear until the fourth part. Here is a more precise outline of the contents of these four parts: The first contains basic definitions and results on discrete valuation rings, Dedekind domains (which are their "globalisation") and the completion process. The prerequisite for this part is a knowledge of elementary notions of algebra and topology, which may be found for instance in Bourbaki. The second part is concerned with ramification phenomena (different, discriminant, ramification groups, Artin representation). Just as in the first part, no assumptions are made here about the residue fields. It is in this setting that the "norm" map is studied; I have expressed the results in terms of "additive polynomials" and of "multiplicative polynomials," since using the language of algebraic geometry would have led me too far astray."

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 book surveys the current state of the "small" sieve methods developed by Brun, Selberg and later workers. The book is suitable for university graduates making their first acquaintance with the subject, leading them towards the frontiers of modern research and unsolved problems in the subject area.

John Wallis (1616-1703) was the most influential English mathematician prior to Newton. He published his most famous work, Arithmetica Infinitorum, in Latin in 1656. This book studied the quadrature of curves and systematised the analysis of Descartes and Cavelieri. Upon publication, this text immediately became the standard book on the subject and was frequently referred to by subsequent writers. This will be the first English translation of this text ever to be published.

The Riemann zeta function is one of the most studied objects in mathematics, and is of fundamental importance. In this book, based on his own research, Professor Motohashi shows that the function is closely bound with automorphic forms and that many results from there can be woven with techniques and ideas from analytic number theory to yield new insights into, and views of, the zeta function itself. The story starts with an elementary but unabridged treatment of the spectral resolution of the non-Euclidean Laplacian and the trace formulas. This is achieved by the use of standard tools from analysis rather than any heavy machinery, forging a substantial aid for beginners in spectral theory as well. These ideas are then utilized to unveil an image of the zeta-function, first perceived by the author, revealing it to be the main gem of a necklace composed of all automorphic L-functions. In this book, readers will find a detailed account of one of the most fascinating stories in the development of number theory, namely the fusion of two main fields in mathematics that were previously studied separately.

In this stimulating book, aimed at researchers both established and budding, Peter Elliott demonstrates a method and a motivating philosophy that combine to cohere a large part of analytic number theory, including the hitherto nebulous study of arithmetic functions. Besides its application, the book also illustrates a way of thinking mathematically: historical background is woven into the narrative, variant proofs illustrate obstructions, false steps and the development of insight, in a manner reminiscent of Euler. It is shown how to formulate theorems as well as how to construct their proofs. Elementary notions from functional analysis, Fourier analysis, functional equations and stability in mechanics are controlled by a geometric view and synthesized to provide an arithmetical analogue of classical harmonic analysis that is powerful enough to establish arithmetic propositions until now beyond reach. Connections with other branches of analysis are illustrated by over 250 exercises, structured in chains about individual topics.

One of the most remarkable and beautiful theorems in coding theory is Gleason's 1970 theorem about the weight enumerators of self-dual codes and their connections with invariant theory, which has inspired hundreds of papers about generalizations and applications of this theorem to different types of codes. This self-contained book develops a new theory which is powerful enough to include all the earlier generalizations.

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.

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.

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.

From September 13 to 17 in 1999, the First China-Japan Seminar on Number Theory was held in Beijing, China, which was organized by the Institute of Mathematics, Academia Sinica jointly with Department of Mathematics, Peking University. TE: m Japanese Professors and eighteen Chinese Professors attended this seminar. Professor Yuan Wang was the chairman, and Professor Chengbiao Pan was the vice-chairman. This seminar was planned and prepared by Professor Shigeru Kanemitsu and the first-named editor. Talks covered various research fields including analytic number theory, algebraic number theory, modular forms and transcendental number theory. The Great Wall and acrobatics impressed Japanese visitors. From November 29 to December 3 in 1999, an annual conference on analytic number theory was held in Kyoto, Japan, as one of the conferences supported by Research Institute of Mathematical Sciences (RIMS), Kyoto University. The organizer was the second-named editor. About one hundred Japanese scholars and some foreign visitors com ing from China, France, Germany and India attended this conference. Talks covered many branches in number theory. The scenery in Kyoto, Arashiyama Mountain and Katsura River impressed foreign visitors. An informal report of this conference was published as the volume 1160 of Surikaiseki Kenkyusho Kokyuroku (June 2000), published by RIMS, Ky oto University. The present book is the Proceedings of these two conferences, which records mainly some recent progress in number theory in China and Japan and reflects the academic exchanging between China and Japan."

Automorphic forms are an important complex analytic tool in number theory and modern arithmetic geometry. They played for example a vital role in Andrew Wiles's proof of Fermat's Last Theorem. This text provides a concise introduction to the world of automorphic forms using two approaches: the classic elementary theory and the modern point of view of adeles and representation theory. The reader will learn the important aims and results of the theory by focussing on its essential aspects and restricting it to the 'base field' of rational numbers. Students interested for example in arithmetic geometry or number theory will find that this book provides an optimal and easily accessible introduction into this topic.

The first coherent exposition of the theory of binary quadratic forms was given by Gauss in the Disqnisitiones Arithmeticae. During the nine teenth century, as the theory of ideals and the rudiments of algebraic number theory were developed, it became clear that this theory of bi nary quadratic forms, so elementary and computationally explicit, was indeed just a special case of a much more elega, nt and abstract theory which, unfortunately, is not computationally explicit. In recent years the original theory has been laid aside. Gauss's proofs, which involved brute force computations that can be done in what is essentially a two dimensional vector space, have been dropped in favor of n-dimensional arguments which prove the general theorems of algebraic number the ory. In consequence, this elegant, yet pleasantly simple, theory has been neglected even as some of its results have become extremely useful in certain computations. I find this neglect unfortunate, because binary quadratic forms have two distinct attractions. First, the subject involves explicit computa tion and many of the computer programs can be quite simple. The use of computers in experimenting with examples is both meaningful and enjoyable; one can actually discover interesting results by com puting examples, noticing patterns in the "data," and then proving that the patterns result from the conclusion of some provable theorem."

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

"Number Theory in Science and Communication" is a well-known introduction for non-mathematicians to this fascinating and useful branch of applied mathematics . It stresses intuitive understanding rather than abstract theory and highlights important concepts such as continued fractions, the golden ratio, quadratic residues and Chinese remainders, trapdoor functions, pseudo primes and primitive elements. Their applications to problems in the real world are one of the main themes of the book. This revised fifth edition is augmented by recent advances in coding theory, permutations and derangements and a chapter in quantum cryptography.

From reviews of earlier editions -

"I continue to find Schroeder's] Number Theory a goldmine of valuable information. It is a marvelous book, in touch with the most recent applications of number theory and written with great clarity and humor.' Philip Morrison (Scientific American)

"A light-hearted and readable volume with a wide range of applications to which the author has been a productive contributor - useful mathematics outside the formalities of theorem and proof." Martin Gardner

From July 31 through August 3,1997, the Pennsylvania State University hosted the Topics in Number Theory Conference. The conference was organized by Ken Ono and myself. By writing the preface, I am afforded the opportunity to express my gratitude to Ken for beng the inspiring and driving force behind the whole conference. Without his energy, enthusiasm and skill the entire event would never have occurred. We are extremely grateful to the sponsors of the conference: The National Sci ence Foundation, The Penn State Conference Center and the Penn State Depart ment of Mathematics. The object in this conference was to provide a variety of presentations giving a current picture of recent, significant work in number theory. There were eight plenary lectures: H. Darmon (McGill University), "Non-vanishing of L-functions and their derivatives modulo p. " A. Granville (University of Georgia), "Mean values of multiplicative functions. " C. Pomerance (University of Georgia), "Recent results in primality testing. " C. Skinner (Princeton University), "Deformations of Galois representations. " R. Stanley (Massachusetts Institute of Technology), "Some interesting hyperplane arrangements. " F. Rodriguez Villegas (Princeton University), "Modular Mahler measures. " T. Wooley (University of Michigan), "Diophantine problems in many variables: The role of additive number theory. " D. Zeilberger (Temple University), "Reverse engineering in combinatorics and number theory. " The papers in this volume provide an accurate picture of many of the topics presented at the conference including contributions from four of the plenary lectures."

The method of exponential sums is a general method enabling the solution of a wide range of problems in the theory of numbers and its applications. This volume presents an exposition of the fundamentals of the theory with the help of examples which show how exponential sums arise and how they are applied in problems of number theory and its applications. The material is divided into three chapters which embrace the classical results of Gauss, and the methods of Weyl, Mordell and Vinogradov; the traditional applications of exponential sums to the distribution of fractional parts, the estimation of the Riemann zeta function; and the theory of congruences and Diophantine equations. Some new applications of exponential sums are also included. It is assumed that the reader has a knowledge of the fundamentals of mathematical analysis and of elementary number theory.

This collection of survey and research articles brings together topics at the forefront of the theory of L-functions and Galois representations. Highlighting important progress in areas such as the local Langlands programme, automorphic forms and Selmer groups, this timely volume treats some of the most exciting recent developments in the field. Included are survey articles from Khare on Serre's conjecture, Yafaev on the Andre-Oort conjecture, Emerton on his theory of Jacquet functors, Venjakob on non-commutative Iwasawa theory and Vigneras on mod p representations of GL(2) over p-adic fields. There are also research articles by: Boeckle, Buzzard, Cornut and Vatsal, Diamond, Hida, Kurihara and R. Pollack, Kisin, Nekovar, and Bertolini, Darmon and Dasgupta. Presenting the very latest research on L-functions and Galois representations, this volume is indispensable for researchers in algebraic number theory.