In this tract, Professor Moreno develops the theory of algebraic curves over finite fields, their zeta and L-functions, and, for the first time, the theory of algebraic geometric Goppa codes on algebraic curves. Among the applications considered are: the problem of counting the number of solutions of equations over finite fields; Bombieri's proof of the Reimann hypothesis for function fields, with consequences for the estimation of exponential sums in one variable; Goppa's theory of error-correcting codes constructed from linear systems on algebraic curves; there is also a new proof of the TsfasmanSHVladutSHZink theorem. The prerequisites needed to follow this book are few, and it can be used for graduate courses for mathematics students. Electrical engineers who need to understand the modern developments in the theory of error-correcting codes will also benefit from studying this work.

The book is based on lecture notes of a course 'from elementary number theory to an introduction to matrix theory' given at the Technion to gifted high school students. It is problem based, and covers topics in undergraduate mathematics that can be introduced in high school through solving challenging problems. These topics include Number theory, Set Theory, Group Theory, Matrix Theory, and applications to cryptography and search engines.

Peter Giblin describes, in the context of an introduction to the theory of numbers, some of the more elementary methods for factorization and primality testing; that is, methods independent of a knowledge of other areas of mathematics. Indeed everything is developed from scratch so the mathematical prerequisites are minimal. An essential feature of the book is the large number of computer programs (written in Pascal) and a wealth of computational exercises and projects, in addition to more usual theory exercises. The theoretical development includes continued fractions and quadratic residues, directed always towards the two fundamental problems of primality testing and factorization. There is time, all the same, to include a number of topics and projects of a purely "recreational" nature.

Topological dynamics and ergodic theory usually have been treated independently. H. Furstenberg, instead, develops the common ground between them by applying the modern theory of dynamical systems to combinatories and number theory. Originally published in 1981. The Princeton Legacy Library uses the latest print-on-demand technology to again make available previously out-of-print books from the distinguished backlist of Princeton University Press. These editions preserve the original texts of these important books while presenting them in durable paperback and hardcover editions. The goal of the Princeton Legacy Library is to vastly increase access to the rich scholarly heritage found in the thousands of books published by Princeton University Press since its founding in 1905.

This book is a comprehensive and systematic account of the theory of p-adic and classical modular forms and the theory of the special values of arithmetic L-functions and p-adic L-functions. The approach is basically algebraic, and the treatment is elementary. No deep knowledge from algebraic geometry and representation theory is required. The author's main tool in dealing with these problems is taken from cohomology theory over Riemann surfaces, which is also explained in detail in the book. He also gives a concise but thorough treatment of analytic continuation and functional equation. Graduate students wishing to know more about L-functions will find this a unique introduction to this fascinating branch of mathematics.

This book originates from graduate courses given in Cambridge and London. It provides a brisk, thorough treatment of the foundations of algebraic number theory, and builds on that to introduce more advanced ideas. Throughout, the authors emphasise the systematic development of techniques for the explicit calculation of the basic invariants, such as rings of integers, class groups, and units. Moreover they combine, at each stage of development, theory with explicit computations and applications, and provide motivation in terms of classical number-theoretic problems. A number of special topics are included that can be treated at this level but can usually only be found in research monographs or original papers, for instance: module theory of Dedekind domains; tame and wild ramifications; Gauss series and Gauss periods; binary quadratic forms; and Brauer relations. This is the only textbook at this level which combines clean, modern algebraic techniques together with a substantial arithmetic content. It will be indispensable for all practising and would-be algebraic number theorists.

The study of special cases of elliptic curves goes back to Diophantos and Fermat, and today it is still one of the liveliest centers of research in number theory. This book, addressed to beginning graduate students, introduces basic theory from a contemporary viewpoint but with an eye to the historical background. The central portion deals with curves over the rationals: the Mordell-Wei finite basis theorem, points of finite order (Nagell-Lutz), etc. The treatment is structured by the local-global standpoint and culminates in the description of the Tate-Shafarevich group as the obstruction to a Hasse principle. In an introductory section the Hasse principle for conics is discussed. The book closes with sections on the theory over finite fields (the "Riemann hypothesis for function fields") and recently developed uses of elliptic curves for factoring large integers. Prerequisites are kept to a minimum; an acquaintance with the fundamentals of Galois theory is assumed, but no knowledge either of algebraic number theory or algebraic geometry is needed. The p-adic numbers are introduced from scratch. Many examples and exercises are included for the reader, and those new to elliptic curves, whether they are graduate students or specialists from other fields, will find this a valuable introduction.

This volume is an outgrowth of the LMS Durham Symposium on L-functions, held in July 1989. The symposium consisted of several short courses, aimed at presenting rigorous but non-technical expositions of the latest research areas, and a number of individual lectures on specific topics. The contributors are all outstanding figures in the area of algebraic number theory and this volume will be of lasting value to students and researchers working in the area.

This book is a self-contained account of the one- and two-dimensional van der Corput method and its use in estimating exponential sums. These arise in many problems in analytic number theory. It is the first cohesive account of much of this material and will be welcomed by graduates and professionals in analytic number theory. The authors show how the method can be applied to problems such as upper bounds for the Riemann-Zeta function. the Dirichlet divisor problem, the distribution of square free numbers, and the Piatetski-Shapiro prime number theorem.

Originally published in 1934 in the Cambridge Tracts, this volume presents the theory of the distribution of the prime numbers in the series of natural numbers. The major part of the book is devoted to the analytical theory founded on the zeta-function of Riemann. Despite being out of print for a long time, this Tract still remains unsurpassed as an introduction to the field, combining an economy of detail with a clarity of exposition which eases the novice into this area.

This text for advanced undergraduates and graduate students surveys the use of Fibonacci and Lucas numbers in areas relevant to operational research, statistics, and computational mathematics. It also covers geometric topics related to the ancient principle known as the Golden Section, plus Meta-Fibonacci numbers and Platonic solids. 1989 edition.

In this volume, originally published in 1990, are included papers presented at two meetings; one a workshop on Number Theory and Cryptography, and the other, the annual meeting of the Australian Mathematical Society. Questions in number theory are of military and commercial importance for the security of communication, as they are related to codes and code-breaking. Papers in the volume range from problems in pure mathematics whose study has been intensified by this connection, through interesting theoretical and combinatorial problems which arise in the implementation, to practical questions that come from banking and telecommunications. The contributors are prominent within their field. The whole volume will be an attractive purchase for all number theorists, 'pure' or 'applied'.

This volume contains selected contributions from a very successful meeting on Number Theory and Dynamical Systems held at the University of York in 1987. There are close and surprising connections between number theory and dynamical systems. One emerged last century from the study of the stability of the solar system where problems of small divisors associated with the near resonance of planetary frequencies arose. Previously the question of the stability of the solar system was answered in more general terms by the celebrated KAM theorem, in which the relationship between near resonance (and so Diophantine approximation) and stability is of central importance. Other examples of the connections involve the work of Szemeredi and Furstenberg, and Sprindzuk. As well as containing results on the relationship between number theory and dynamical systems, the book also includes some more speculative and exploratory work which should stimulate interest in different approaches to old problems.

In this, one of the first books to appear in English on the theory of numbers, the eminent mathematician Hermann Weyl explores fundamental concepts in arithmetic. The book begins with the definitions and properties of algebraic fields, which are relied upon throughout. The theory of divisibility is then discussed, from an axiomatic viewpoint, rather than by the use of ideals. There follows an introduction to "p"-adic numbers and their uses, which are so important in modern number theory, and the book culminates with an extensive examination of algebraic number fields.

Weyl's own modest hope, that the work "will be of some use," has more than been fulfilled, for the book's clarity, succinctness, and importance rank it as a masterpiece of mathematical exposition.

Written by a noted expert on logic and set theory, this study of basic number systems explores natural numbers, integers, rational numbers, real numbers, and complex numbers. Geared toward undergraduate and beginning graduate students, it requires minimal mathematical training. Several helpful appendixes supplement the text. The author is Professor of Mathematics at Queens College in New York.

Algebraic number theory is one of the most refined creations in mathematics. It has been developed by some of the leading mathematicians of this and previous centuries. The primary goal of this book is to present the essential elements of algebraic number theory, including the theory of normal extensions up through a glimpse of class field theory. Following the example set for us by Kronecker, Weber, Hilbert and Artin, algebraic functions are handled here on an equal footing with algebraic numbers. This is done on the one hand to demonstrate the analogy between number fields and function fields, which is especially clear in the case where the ground field is a finite field.On the other hand, in this way one obtains an introduction to the theory of 'higher congruences' as an important element of 'arithmetic geometry'. Early chapters discuss topics in elementary number theory, such as Minkowski's geometry of numbers, public-key cryptography and a short proof of the Prime Number Theorem, following Newman and Zagier. Next, some of the tools of algebraic number theory are introduced, such as ideals, discriminants and valuations. These results are then applied to obtain results about function fields, including a proof of the Riemann-Roch Theorem and, as an application of cyclotomic fields, a proof of the first case of Fermat's Last Theorem.There are a detailed exposition of the theory of Hecke $L$-series, following Tate, and explicit applications to number theory, such as the Generalized Riemann Hypothesis. Chapter 9 brings together the earlier material through the study of quadratic number fields. Finally, Chapter 10 gives an introduction to class field theory. The book attempts as much as possible to give simple proofs. It can be used by a beginner in algebraic number theory who wishes to see some of the true power and depth of the subject. The book is suitable for two one-semester courses, with the first four chapters serving to develop the basic material. Chapters 6 through 9 could be used on their own as a second semester course.

A cipher is a scheme for creating coded messages for the secure exchange of information. Throughout history, many different coding schemes have been devised. One of the oldest and simplest mathematical systems was used by Julius Caesar. This is where ""Mathematical Ciphers"" begins. Building on that simple system, Young moves on to more complicated schemes, ultimately ending with the RSA cipher, which is used to provide security for the Internet. This book is structured differently from most mathematics texts. It does not begin with a mathematical topic, but rather with a cipher. The mathematics is developed as it is needed; the applications motivate the mathematics. As is typical in mathematics textbooks, most chapters end with exercises. Many of these problems are similar to solved examples and are designed to assist the reader in mastering the basic material.A few of the exercises are one-of-a-kind, intended to challenge the interested reader. Implementing encryption schemes is considerably easier with the use of the computer. For all the ciphers introduced in this book, JavaScript programs are available from the Web. In addition to developing various encryption schemes, this book also introduces the reader to number theory. Here, the study of integers and their properties is placed in the exciting and modern context of cryptology. ""Mathematical Ciphers"" can be used as a textbook for an introductory course in mathematics for all majors. The only prerequisite is high school mathematics.

The papers in this volume, which were presented at the 1985 Australian Mathematical Society convention, survey recent work in Diophantine analysis. The contributors are leading mathematicians in the world, and their articles are state of the art accounts, many of which include open problems pointing the way to further research. The contributions will be of general interest to number theorists and of particular interest to workers in transcendence theory, Diophantine approximation and exponential sums.

Based upon the renowned author's Cambridge lectures, the text simplifies the complexities of the basic elements of number theory and stimulates the reader to pursue further study.

Diophantine equations over number fields have formed one of the most important and fruitful areas of mathematics throughout civilisation. In recent years increasing interest has been aroused in the analogous area of equations over function fields. However, although considerable progress has been made by previous authors, none has attempted the central problem of providing methods for the actual solution of such equations. The latter is the purpose and achievement of this volume: algorithms are provided for the complete resolution of various families of equations, such as those of Thue, hyperelliptic and genus one type. The results are achieved by means of an original fundamental inequality, first announced by the author in 1982. Several specific examples are included as illustrations of the general method and as a testimony to its efficiency. Furthermore, bounds are obtained on the solutions which improve on those obtained previously by other means. Extending the equality to a different setting, namely that of positive characteristic, enables the various families of equations to be resolved in that circumstance. Finally, by applying the inequality in a different manner, simple bounds are determined on their solutions in rational functions of the general superelliptic equation. This book represents a self-contained account of a new approach to the subject, and one which plainly has not reached the full extent of its application. It also provides a more direct on the problems than any previous book. Little expert knowledge is required to follow the theory presented, and it will appeal to professional mathematicians, research students and the enthusiastic undergraduate.

This 1st volume in the series History of the Theory of Numbers presents the material related to the subjects of divisibility and primality. This series is the work of a distinguished mathematician who taught at the University of Chicago for 4 decades and is celebrated for his many contributions to number theory and group theory. 1919 edition.

Discrete mathematics and theoretical computer science are closely linked research areas with strong impacts on applications and various other scientific disciplines. Both fields deeply cross fertilize each other. One of the persons who particularly contributed to building bridges between these and many other areas is Laszlo Lovasz, a scholar whose outstanding scientific work has defined and shaped many research directions in the last 40 years. A number of friends and colleagues, all top authorities in their fields of expertise and all invited plenary speakers at one of two conferences in August 2008 in Hungary, both celebrating Lovasz's 60th birthday, have contributed their latest research papers to this volume. This collection of articles offers an excellent view on the state of combinatorics and related topics and will be of interest for experienced specialists as well as young researchers.

Welcome to diophantine analysis - an area of number theory in which we attempt to discover hidden treasures and truths within the jungle of numbers by exploring rational numbers. Diophantine analysis comprises two different but interconnected domains - diophantine approximation and diophantine equations. This highly readable book brings to life the fundamental ideas and theorems from diophantine approximation, geometry of numbers, diophantine geometry and $p$-adic analysis. Through an engaging style, readers participate in a journey through these areas of number theory. Each mathematical theme is presented in a self-contained manner and is motivated by very basic notions. The reader becomes an active participant in the explorations, as each module includes a sequence of numbered questions to be answered and statements to be verified. Many hints and remarks are provided to be freely used and enjoyed.Each module then closes with a Big Picture Question that invites the reader to step back from all the technical details and take a panoramic view of how the ideas at hand fit into the larger mathematical landscape. This book enlists the reader to build intuition, develop ideas and prove results in a very user-friendly and enjoyable environment. Little background is required and a familiarity with number theory is not expected. All that is needed for most of the material is an understanding of calculus and basic linear algebra together with the desire and ability to prove theorems. The minimal background requirement combined with the author's fresh approach and engaging style make this book enjoyable and accessible to second-year undergraduates, and even advanced high school students. The author's refreshing new spin on more traditional discovery approaches makes this book appealing to any mathematician and/or fan of number theory.

A symbol for what is not there, an emptiness that increases any number it's added to, an inexhaustible and indispensable paradox. As we enter the year 2000, zero is once again making its presence felt. Nothing itself, it makes possible a myriad of calculations. Indeed, without zero mathematics as we know it would not exist. And without mathematics our understanding of the universe would be vastly impoverished. But where did this nothing, this hollow circle, come from? Who created it? And what, exactly, does it mean?

Robert Kaplan's The Nothing That Is: A Natural History of Zero begins as a mystery story, taking us back to Sumerian times, and then to Greece and India, piecing together the way the idea of a symbol for nothing evolved. Kaplan shows us just how handicapped our ancestors were in trying to figure large sums without the aid of the zero. (Try multiplying CLXIV by XXIV). Remarkably, even the Greeks, mathematically brilliant as they were, didn't have a zero--or did they? We follow the trail to the East where, a millennium or two ago, Indian mathematicians took another crucial step. By treating zero for the first time like any other number, instead of a unique symbol, they allowed huge new leaps forward in computation, and also in our understanding of how mathematics itself works.

In the Middle Ages, this mathematical knowledge swept across western Europe via Arab traders. At first it was called "dangerous Saracen magic" and considered the Devil's work, but it wasn't long before merchants and bankers saw how handy this magic was, and used it to develop tools like double-entry bookkeeping. Zero quickly became an essential part of increasingly sophisticated equations, and with the invention of calculus, one could say it was a linchpin of the scientific revolution. And now even deeper layers of this thing that is nothing are coming to light: our computers speak only in zeros and ones, and modern mathematics shows that zero alone can be made to generate everything.

Robert Kaplan serves up all this history with immense zest and humor; his writing is full of anecdotes and asides, and quotations from Shakespeare to Wallace Stevens extend the book's context far beyond the scope of scientific specialists. For Kaplan, the history of zero is a lens for looking not only into the evolution of mathematics but into very nature of human thought. He points out how the history of mathematics is a process of recursive abstraction: how once a symbol is created to represent an idea, that symbol itself gives rise to new operations that in turn lead to new ideas. The beauty of mathematics is that even though we invent it, we seem to be discovering something that already exists.

The joy of that discovery shines from Kaplan's pages, as he ranges from Archimedes to Einstein, making fascinating connections between mathematical insights from every age and culture. A tour de force of science history, The Nothing That Is takes us through the hollow circle that leads to infinity.

Famous mathematical constants include the ratio of circular circumference to diameter, = 3.14 ..., and the natural logarithm base, e = 2.718 .... Students and professionals can often name a few others, but there are many more buried in the literature and awaiting discovery. How do such constants arise, and why are they important? Here the author renews the search he began in his book Mathematical Constants, adding another 133 essays that broaden the landscape. Topics include the minimality of soap film surfaces, prime numbers, elliptic curves and modular forms, Poisson-Voronoi tessellations, random triangles, Brownian motion, uncertainty inequalities, Prandtl-Blasius flow (from fluid dynamics), Lyapunov exponents, knots and tangles, continued fractions, Galton-Watson trees, electrical capacitance (from potential theory), Zermelo's navigation problem, and the optimal control of a pendulum. Unsolved problems appear virtually everywhere as well. This volume continues an outstanding scholarly attempt to bring together all significant mathematical constants in one place.