Building on the tradition of an outstanding series of conferences at the University of Illinois at Urbana-Champaign, the organizers attracted an international group of scholars to open the new Millennium with a conference that reviewed the current state of number theory research and pointed to future directions in the field. The conference was the largest general number theory conference in recent history, featuring a total of 159 talks, with the plenary lectures given by George Andrews, Jean Bourgain, Kevin Ford, Ron Graham, Andrew Granville, Roger Heath-Brown, Christopher Hooley, Winnie Li, Kumar Murty, Mel Nathanson, Ken Ono, Carl Pomerance, Bjorn Poonen, Wolfgang Schmidt, Chris Skinner, K. Soundararajan, Robert Tijdeman, Robert Vaughan, and Hugh Williams. The Proceedings Volumes of the conference review some of the major number theory achievements of this century and to chart some of the directions in which the subject will be heading during the new century. These volumes will serve as a useful reference to researchers in the area and an introduction to topics of current interest in number theory for a general audience in mathematics.

Automatic sequences are sequences over a finite alphabet generated by a finite-state machine. This book presents a novel viewpoint on automatic sequences, and more generally on combinatorics on words, by introducing a decision method through which many new results in combinatorics and number theory can be automatically proved or disproved with little or no human intervention. This approach to proving theorems is extremely powerful, allowing long and error-prone case-based arguments to be replaced by simple computations. Readers will learn how to phrase their desired results in first-order logic, using free software to automate the computation process. Results that normally require multipage proofs can emerge in milliseconds, allowing users to engage with mathematical questions that would otherwise be difficult to solve. With more than 150 exercises included, this text is an ideal resource for researchers, graduate students, and advanced undergraduates studying combinatorics, sequences, and number theory.

This carefully prepared manuscript presents elimination theory in weighted projective spaces over arbitrary noetherian commutative base rings. Elimination theory is a classical topic in commutative algebra and algebraic geometry, and it has become of renewed importance recently in the context of applied and computational algebra. This monograph provides a valuable complement to sparse elimination theory in that it presents in careful detail the algebraic difficulties from working over general base rings. This is essential for applications in arithmetic geometry and many other places. Necessary tools concerning monoids of weights, generic polynomials and regular sequences are treated independently in the first part of the book. Many supplements added to each chapter provide extra details and insightful examples. Necessary tools concerning monoids of weights, generic polynomials and regular sequences are treated independently in the first part of the book. Many supplements added to each chapter provide extra details and insightful examples.

This book introduces algebraic number theory through the problem of generalizing 'unique prime factorization' from ordinary integers to more general domains. Solving polynomial equations in integers leads naturally to these domains, but unique prime factorization may be lost in the process. To restore it, we need Dedekind's concept of ideals. However, one still needs the supporting concepts of algebraic number field and algebraic integer, and the supporting theory of rings, vector spaces, and modules. It was left to Emmy Noether to encapsulate the properties of rings that make unique prime factorization possible, in what we now call Dedekind rings. The book develops the theory of these concepts, following their history, motivating each conceptual step by pointing to its origins, and focusing on the goal of unique prime factorization with a minimum of distraction or prerequisites. This makes a self-contained easy-to-read book, short enough for a one-semester course.

Devised in the 19th century, Gauss and Jacobi Sums are classical formulas that form the basis for contemporary research in many of today's sciences. This book offers readers a solid grounding on the origin of these abstract, general theories. Though the main focus is on Gauss and Jacobi, the book does explore other relevant formulas, including Cauchy.

Understanding maths has never been easier. Combining bold, elegant graphics with easy-to-understand text, Simply Maths is the perfect introduction to the subject for those who are short of time but hungry for knowledge. Covering more than 90 key mathematical concepts from prime numbers and fractions to quadratic equations and probability experiments, each pared-back, single-page entry explains the concept more clearly than ever before. Organized by major themes - number theory and systems; calculations; geometry; algebra; graphs; ratio and proportion; measurement; probability and statistics; and calculus - entries explain the essentials of each key mathematical theory with simple clarity and for ease of understanding. Whether you are studying maths at school or college, or simply want a jargon-free overview of the subject, this indispensable guide is packed with everything you need to understand the basics quickly and easily.

Now in its second edition, this volume provides a uniquely detailed study of $P$-adic differential equations. Assuming only a graduate-level background in number theory, the text builds the theory from first principles all the way to the frontiers of current research, highlighting analogies and links with the classical theory of ordinary differential equations. The author includes many original results which play a key role in the study of $P$-adic geometry, crystalline cohomology, $P$-adic Hodge theory, perfectoid spaces, and algorithms for L-functions of arithmetic varieties. This updated edition contains five new chapters, which revisit the theory of convergence of solutions of $P$-adic differential equations from a more global viewpoint, introducing the Berkovich analytification of the projective line, defining convergence polygons as functions on the projective line, and deriving a global index theorem in terms of the Laplacian of the convergence polygon.

First published in 1975, this classic book gives a systematic account of transcendental number theory, that is, the theory of those numbers that cannot be expressed as the roots of algebraic equations having rational coefficients. Their study has developed into a fertile and extensive theory, which continues to see rapid progress today. Expositions are presented of theories relating to linear forms in the logarithms of algebraic numbers, of Schmidt's generalization of the Thue-Siegel-Roth theorem, of Shidlovsky's work on Siegel's E-functions and of Sprindzuk's solution to the Mahler conjecture. This edition includes an introduction written by David Masser describing Baker's achievement, surveying the content of each chapter and explaining the main argument of Baker's method in broad strokes. A new afterword lists recent developments related to Baker's work.

This exploration of the relation between periods and transcendental numbers brings Baker's theory of linear forms in logarithms into its most general framework, the theory of 1-motives. Written by leading experts in the field, it contains original results and finalises the theory of linear relations of 1-periods, answering long-standing questions in transcendence theory. It provides a complete exposition of the new theory for researchers, but also serves as an introduction to transcendence for graduate students and newcomers. It begins with foundational material, including a review of the theory of commutative algebraic groups and the analytic subgroup theorem as well as the basics of singular homology and de Rham cohomology. Part II addresses periods of 1-motives, linking back to classical examples like the transcendence of , before the authors turn to periods of algebraic varieties in Part III. Finally, Part IV aims at a dimension formula for the space of periods of a 1-motive in terms of its data.

The challenge of dividing an asset fairly, from cakes to more important properties, is of great practical importance in many situations. Since the famous Polish school of mathematicians (Steinhaus, Banach, and Knaster) introduced and described algorithms for the fair division problem in the 1940s, the concept has been widely popularized.

This book gathers into one readable and inclusive source a comprehensive discussion of the state of the art in cake-cutting problems for both the novice and the professional. It offers a complete treatment of all cake-cutting algorithms under all the considered definitions of "fair" and presents them in a coherent, reader-friendly manner. Robertson and Webb have brought this elegant problem to life for both the bright high school student and the professional researcher.

The research of Jonathan Borwein has had a profound impact on optimization, functional analysis, operations research, mathematical programming, number theory, and experimental mathematics. Having authored more than a dozen books and more than 300 publications, Jonathan Borwein is one of the most productive Canadian mathematicians ever. His research spans pure, applied, and computational mathematics as well as high performance computing, and continues to have an enormous impact: MathSciNet lists more than 2500 citations by more than 1250 authors, and Borwein is one of the 250 most cited mathematicians of the period 1980-1999. He has served the Canadian Mathematics Community through his presidency (2000-02) as well as his 15 years of editing the CMS book series. Jonathan Borwein's vision and initiative have been crucial in initiating and developing several institutions that provide support for researchers with a wide range of scientific interests. A few notable examples include the Centre for Experimental and Constructive Mathematics and the IRMACS Centre at Simon Fraser University, the Dalhousie Distributed Research Institute at Dalhousie University, the Western Canada Research Grid, and the Centre for Computer Assisted Research Mathematics and its Applications, University of Newcastle. The workshops that were held over the years in Dr. Borwein's honor attracted high-caliber scientists from a wide range of mathematical fields. This present volume is an outgrowth of the workshop on 'Computational and Analytical Mathematics' held in May 2011 in celebration of Dr. Borwein's 60th Birthday. The collection contains various state-of-the-art research manuscripts and surveys presenting contributions that have risen from the conference, and is an excellent opportunity to survey state-of-the-art research and discuss promising research directions and approaches.

The area of computational cryptography is dedicated to the development of effective methods in algorithmic number theory that improve implementation of cryptosystems or further their cryptanalysis. This book is a tribute to Arjen K. Lenstra, one of the key contributors to the field, on the occasion of his 65th birthday, covering his best-known scientific achievements in the field. Students and security engineers will appreciate this no-nonsense introduction to the hard mathematical problems used in cryptography and on which cybersecurity is built, as well as the overview of recent advances on how to solve these problems from both theoretical and practical applied perspectives. Beginning with polynomials, the book moves on to the celebrated Lenstra-Lenstra-Lovasz lattice reduction algorithm, and then progresses to integer factorization and the impact of these methods to the selection of strong cryptographic keys for usage in widely used standards.

The classical circle method of Hardy and Littlewood is one of the most effective methods of additive number theory. Two examples are its success with Waring's problem and Goldbach's conjecture. In this book, Wang offers instances of generalizations of important results on diophantine equations and inequalities over rational fields to algebraic number fields. The book also contains an account of Siegel's generalized circle method and its applications to Waring's problem and additive equations and an account of Schmidt's method on diophantine equations and inequalities in several variables in algebraic number fields.

Robert Langlands formulated his celebrated conjectures, initiating the Langlands Program, at the age of 31, profoundly changing the landscape of mathematics. Langlands, recipient of the Abel Prize, is famous for his insight in discovering links among seemingly dissimilar objects, leading to astounding results. This book is uniquely designed to serve a wide range of mathematicians and advanced students, showcasing Langlands' unique creativity and guiding readers through the areas of Langlands' work that are generally regarded as technical and difficult to penetrate. Part 1 features non-technical personal reflections, including Langlands' own words describing how and why he was led to formulate his conjectures. Part 2 includes survey articles of Langlands' early work that led to his conjectures, and centers on his principle of functoriality and foundational work on the Eisenstein series, and is accessible to mathematicians from other fields. Part 3 describes some of Langlands' contributions to mathematical physics.

Searching for small gaps between consecutive primes is one way to approach the twin primes conjecture, one of the most celebrated unsolved problems in number theory. This book documents the remarkable developments of recent decades, whereby an upper bound on the known gap length between infinite numbers of consecutive primes has been reduced to a tractable finite size. The text is both introductory and complete: the detailed way in which results are proved is fully set out and plenty of background material is included. The reader journeys from selected historical theorems to the latest best result, exploring the contributions of a vast array of mathematicians, including Bombieri, Goldston, Motohashi, Pintz, Yildirim, Zhang, Maynard, Tao and Polymath8. The book is supported by a linked and freely-available package of computer programs. The material is suitable for graduate students and of interest to any mathematician curious about recent breakthroughs in the field.

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.

Developed from the author s popular graduate-level course, Computational Number Theory presents a complete treatment of number-theoretic algorithms. Avoiding advanced algebra, this self-contained text is designed for advanced undergraduate and beginning graduate students in engineering. It is also suitable for researchers new to the field and practitioners of cryptography in industry.

Requiring no prior experience with number theory or sophisticated algebraic tools, the book covers many computational aspects of number theory and highlights important and interesting engineering applications. It first builds the foundation of computational number theory by covering the arithmetic of integers and polynomials at a very basic level. It then discusses elliptic curves, primality testing, algorithms for integer factorization, computing discrete logarithms, and methods for sparse linear systems. The text also shows how number-theoretic tools are used in cryptography and cryptanalysis. A dedicated chapter on the application of number theory in public-key cryptography incorporates recent developments in pairing-based cryptography.

With an emphasis on implementation issues, the book uses the freely available number-theory calculator GP/PARI to demonstrate complex arithmetic computations. The text includes numerous examples and exercises throughout and omits lengthy proofs, making the material accessible to students and practitioners.

This book is a conference proceedings based on the 1996 Durham Symposium on "Galois representations in arithmetic algebraic geometry". The title was interpreted loosely and the symposium covered recent developments on the interface between algebraic number theory and arithmetic algebraic geometry. The book reflects this and contains a mixture of articles. Some are expositions of subjects that have received substantial recent attention: Erez on geometric trends in Galois module theory; Mazur on rational points on curves and varieties; Moonen on Shimura varieties in mixed characteristics; Rubin and Scholl on the work of Kato on the Birch-Swinnerton-Dyer conjecture; and Schneider on rigid geometry. Some are research papers by: Coleman and Mazur, Goncharov, Gross, Serre.

Despite its seemingly deterministic nature, the study of whole numbers, especially prime numbers, has many interactions with probability theory, the theory of random processes and events. This surprising connection was first discovered around 1920, but in recent years the links have become much deeper and better understood. Aimed at beginning graduate students, this textbook is the first to explain some of the most modern parts of the story. Such topics include the Chebychev bias, universality of the Riemann zeta function, exponential sums and the bewitching shapes known as Kloosterman paths. Emphasis is given throughout to probabilistic ideas in the arguments, not just the final statements, and the focus is on key examples over technicalities. The book develops probabilistic number theory from scratch, with short appendices summarizing the most important background results from number theory, analysis and probability, making it a readable and incisive introduction to this beautiful area of mathematics.

A fascinating journey into the mind-bending world of prime numbers
Cicadas of the genus Magicicada appear once every 7, 13, or 17 years. Is it just a coincidence that these are all prime numbers? How do twin primes differ from cousin primes, and what on earth (or in the mind of a mathematician) could be sexy about prime numbers? What did Albert Wilansky find so fascinating about his brother-in-law's phone number?
Mathematicians have been asking questions about prime numbers for more than twenty-five centuries, and every answer seems to generate a new rash of questions. In Prime Numbers: The Most Mysterious Figures in Math, you'll meet the world's most gifted mathematicians, from Pythagoras and Euclid to Fermat, Gauss, and Erd?o?s, and you'll discover a host of unique insights and inventive conjectures that have both enlarged our understanding and deepened the mystique of prime numbers. This comprehensive, A-to-Z guide covers everything you ever wanted to know--and much more that you never suspected--about prime numbers, including:
* The unproven Riemann hypothesis and the power of the zeta function
* The ""Primes is in P"" algorithm
* The sieve of Eratosthenes of Cyrene
* Fermat and Fibonacci numbers
* The Great Internet Mersenne Prime Search
* And much, much more

This book provides the latest competing research results on non-commutative harmonic analysis on homogeneous spaces with many applications. It also includes the most recent developments on other areas of mathematics including algebra and geometry. Lie group representation theory and harmonic analysis on Lie groups and on their homogeneous spaces form a significant and important area of mathematical research. These areas are interrelated with various other mathematical fields such as number theory, algebraic geometry, differential geometry, operator algebra, partial differential equations and mathematical physics. Keeping up with the fast development of this exciting area of research, Ali Baklouti (University of Sfax) and Takaaki Nomura (Kyushu University) launched a series of seminars on the topic, the first of which took place on November 2009 in Kerkennah Islands, the second in Sousse on December 2011, and the third in Hammamet on December 2013. The last seminar, which took place December 18th to 23rd 2015 in Monastir, Tunisia, has promoted further research in all the fields where the main focus was in the area of Analysis, algebra and geometry and on topics of joint collaboration of many teams in several corners. Many experts from both countries have been involved.

A Thorough Presentation of the Theory of Algebraic Numbers and Functions Built on a presentation of algebraic foundations Topics in (algebraic) number theory are presented in a systematic, unified and often in a original manner. Many of the topics covered are not contained in books or in accessible surveys.

This book presents several results on elliptic functions and Pi, using Jacobi's triple product identity as a tool to show suprising connections between different topics within number theory such as theta functions, Eisenstein series, the Dedekind delta function, and Ramanujan's work on Pi. The included exercises make it ideal for both classroom use and self-study.

In 1875, Elwin Bruno Christoffel introduced a special class of words on a binary alphabet linked to continued fractions which would go onto be known as Christoffel words. Some years later, Andrey Markoff published his famous theory, the now called Markoff theory. It characterized certain quadratic forms and certain real numbers by extremal inequalities. Both classes are constructed using certain natural numbers - known as Markoff numbers - and they are characterized by a certain Diophantine equality. More basically, they are constructed using certain words - essentially the Christoffel words. The link between Christoffel words and the theory of Markoff was noted by Ferdinand Frobenius in 1913, but has been neglected in recent times. Motivated by this overlooked connection, this book looks to expand on the relationship between these two areas. Part 1 focuses on the classical theory of Markoff, while Part II explores the more advanced and recent results of the theory of Christoffel words.