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.

Eugene Charles Catalan made his famous conjecture - that 8 and 9 are the only two consecutive perfect powers of natural numbers - in 1844 in a letter to the editor of Crelle's mathematical journal. One hundred and fifty-eight years later, Preda Mihailescu proved it.

Catalan's Conjecture presents this spectacular result in a way that is accessible to the advanced undergraduate. The author dissects both Mihailescu's proof and the earlier work it made use of, taking great care to select streamlined and transparent versions of the arguments and to keep the text self-contained. Only in the proof of Thaine's theorem is a little class field theory used; it is hoped that this application will motivate the interested reader to study the theory further.

Beautifully clear and concise, this book will appeal not only to specialists in number theory but to anyone interested in seeing the application of the ideas of algebraic number theory to a famous mathematical problem."

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.

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.

In this volume the author further develops his philosophy of quantum interpolation between the real numbers and the p-adic numbers. The p-adic numbers contain the p-adic integers Zp which are the inverse limit of the finite rings Z/pn. This gives rise to a tree, and probability measures w on Zp correspond to Markov chains on this tree. From the tree structure one obtains special basis for the Hilbert space L2(Zp, w). The real analogue of the p-adic integers is the interval -1,1], and a probability measure w on it gives rise to a special basis for L2( -1,1], w) - the orthogonal polynomials, and to a Markov chain on "finite approximations" of -1,1]. For special (gamma and beta) measures there is a "quantum" or "q-analogue" Markov chain, and a special basis, that within certain limits yield the real and the p-adic theories. This idea can be generalized variously. In representation theory, it is the quantum general linear group GLn(q)that interpolates between the p-adic group GLn(Zp), and between its real (and complex) analogue -the orthogonal On (and unitary Un )groups. There is a similar quantum interpolation between the real and p-adic Fourier transform and between the real and p-adic (local unramified part of) Tate thesis, and Weil explicit sums.

Alan Baker's 60th birthday in August 1999 offered an ideal opportunity to organize a conference at ETH Zurich with the goal of presenting the state of the art in number theory and geometry. Many of the leaders in the subject were brought together to present an account of research in the last century as well as speculations for possible further research. The papers in this volume cover a broad spectrum of number theory including geometric, algebrao-geometric and analytic aspects. This volume will appeal to number theorists, algebraic geometers, and geometers with a number theoretic background. However, it will also be valuable for mathematicians (in particular research students) who are interested in being informed in the state of number theory at the start of the 21st century and in possible developments for the future.

This is an elementary introduction to the representation theory of real and complex matrix groups. The text is written for students in mathematics and physics who have a good knowledge of differential/integral calculus and linear algebra and are familiar with basic facts from algebra, number theory and complex analysis. The goal is to present the fundamental concepts of representation theory, to describe the connection between them, and to explain some of their background. The focus is on groups which are of particular interest for applications in physics and number theory (e.g. Gell-Mann's eightfold way and theta functions, automorphic forms). The reader finds a large variety of examples which are presented in detail and from different points of view.

This book grew out of three series of lectures given at the summer school on "Modular Forms and their Applications" at the Sophus Lie Conference Center in Nordfjordeid in June 2004. The first series treats the classical one-variable theory of elliptic modular forms. The second series presents the theory of Hilbert modular forms in two variables and Hilbert modular surfaces. The third series gives an introduction to Siegel modular forms and discusses a conjecture by Harder. It also contains Harder's original manuscript with the conjecture.

Each part treats a number of beautiful applications.

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 graduate text, based on years of teaching experience, is intended for first or second year graduate students in pure mathematics. The main goal of the text is to show how the computer can be used as a tool for research in number theory through numerical experimentation. The book contains many examples of experiments in binary quadratic forms, zeta functions of varieties over finite fields, elementary class field theory, elliptic units, modular forms, along with exercises and selected solutions. Sample programs are written in GP, the scripting language for the computational package PARI, and are available for download from the author's website.

This book presents a historical overview of number theory. It examines texts that span some thirty-six centuries of arithmetical work, from an Old Babylonian tablet to Legendre's Essai sur la Theorie des Nombres, written in 1798. Coverage employs a historical approach in the analysis of problems and evolving methods of number theory and their significance within mathematics. The book also takes the reader into the workshops of four major authors of modern number theory: Fermat, Euler, Lagrange and Legendre and presents a detailed and critical examination of their work.

In Single Digits, Marc Chamberland takes readers on a fascinating exploration of small numbers, from one to nine, looking at their history, applications, and connections to various areas of mathematics, including number theory, geometry, chaos theory, numerical analysis, and mathematical physics. For instance, why do eight perfect card shuffles leave a standard deck of cards unchanged? And, are there really "six degrees of separation" between all pairs of people? Chamberland explores these questions and covers vast numerical territory, such as illustrating the ways that the number three connects to chaos theory, the number of guards needed to protect an art gallery, problematic election results and so much more. The book's short sections can be read independently and digested in bite-sized chunks--especially good for learning about the Ham Sandwich Theorem and the Pizza Theorem. Appealing to high school and college students, professional mathematicians, and those mesmerized by patterns, this book shows that single digits offer a plethora of possibilities that readers can count on.

An update of the most accessible introductory number theory text available, Fundamental Number Theory with Applications, Second Edition presents a mathematically rigorous yet easy-to-follow treatment of the fundamentals and applications of the subject. The substantial amount of reorganizing makes this edition clearer and more elementary in its coverage. New to the Second Edition * Removal of all advanced material to be even more accessible in scope * New fundamental material, including partition theory, generating functions, and combinatorial number theory * Expanded coverage of random number generation, Diophantine analysis, and additive number theory * More applications to cryptography, primality testing, and factoring * An appendix on the recently discovered unconditional deterministic polynomial-time algorithm for primality testing Taking a truly elementary approach to number theory, this text supplies the essential material for a first course on the subject. Placed in highlighted boxes to reduce distraction from the main text, nearly 70 biographies focus on major contributors to the field. The presentation of over 1,300 entries in the index maximizes cross-referencing so students can find data with ease.

Explore the main algebraic structures and number systems that play a central role across the field of mathematics

Algebra and number theory are two powerful branches of modern mathematics at the forefront of current mathematical research, and each plays an increasingly significant role in different branches of mathematics, from geometry and topology to computing and communications. Based on the authors' extensive experience within the field, "Algebra and Number Theory" has an innovative approach that integrates three disciplines--linear algebra, abstract algebra, and number theory--into one comprehensive and fluid presentation, facilitating a deeper understanding of the topic and improving readers' retention of the main concepts.

The book begins with an introduction to the elements of set theory. Next, the authors discuss matrices, determinants, and elements of field theory, including preliminary information related to integers and complex numbers. Subsequent chapters explore key ideas relating to linear algebra such as vector spaces, linear mapping, and bilinear forms. The book explores the development of the main ideas of algebraic structures and concludes with applications of algebraic ideas to number theory.

Interesting applications are provided throughout to demonstrate the relevance of the discussed concepts. In addition, chapter exercises allow readers to test their comprehension of the presented material.

"Algebra and Number Theory" is an excellent book for courses on linear algebra, abstract algebra, and number theory at the upper-undergraduate level. It is also a valuable reference for researchers working in different fields of mathematics, computer science, and engineering as well as for individuals preparing for a career in mathematics education.

The amount of mathematics invented for number-theoretic reasons is impressive. It includes much of complex analysis, the re-foundation of algebraic geometry on commutative algebra, group cohomology, homological algebra, and the theory of motives. Zeta and L-functions sit at the meeting point of all these theories and have played a profound role in shaping the evolution of number theory. This book presents a big picture of zeta and L-functions and the complex theories surrounding them, combining standard material with results and perspectives that are not made explicit elsewhere in the literature. Particular attention is paid to the development of the ideas surrounding zeta and L-functions, using quotes from original sources and comments throughout the book, pointing the reader towards the relevant history. Based on an advanced course given at Jussieu in 2013, it is an ideal introduction for graduate students and researchers to this fascinating story.

This book constitutes the refereed proceedings of the 5th International Workshop on Ant Colony Optimization and Swarm Intelligence, ANTS 2006, held in Brussels, Belgium, in September 2006.

The 27 revised full papers, 23 revised short papers, and 12 extended abstracts presented were carefully reviewed and selected from 115 submissions. The papers are devoted to theoretical and foundational aspects of ant algorithms, evolutionary optimization, ant colony optimization, and swarm intelligence and deal with a broad variety of optimization applications in networking, operations research, multiagent systems, robot systems, networking, etc.

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 challenging problem book by renowned US Olympiad coaches, mathematics teachers, and researchers develops a multitude of problem-solving skills needed to excel in mathematical contests and in mathematical research in number theory. Offering inspiration and intellectual delight, the problems throughout the book encourage students to express their ideas in writing to explain how they conceive problems, what conjectures they make, and what conclusions they reach. Applying specific techniques and strategies, readers will acquire a solid understanding of the fundamental concepts and ideas of number theory.

This book covers most of the known results on reducibility of polynomials over arbitrary fields, algebraically closed fields and finitely generated fields. Results valid only over finite fields, local fields or the rational field are not covered here, but several theorems on reducibility of polynomials over number fields that are either totally real or complex multiplication fields are included. Some of these results are based on recent work of E. Bombieri and U. Zannier (presented here by Zannier in an appendix). The book also treats other subjects like Ritt's theory of composition of polynomials, and properties of the Mahler measure, and it concludes with a bibliography of over 300 items. This unique work will be a necessary resource for all number theorists and researchers in related fields.

Hex: The Full Story is for anyone - hobbyist, professional, student, teacher - who enjoys board games, game theory, discrete math, computing, or history. hex was discovered twice, in 1942 by Piet Hein and again in 1949 by John F. nash. How did this happen? Who created the puzzle for Hein's Danish newspaper column? How are Martin Gardner, David Gale, Claude Shannon, and Claude Berge involved? What is the secret to playing Hex well? The answers are inside... Features New documents on Hein's creation of Hex, the complete set of Danish puzzles, and the identity of their composer Chapters on Gale's game Bridg-it, the game Rex, computer Hex, open Hex problems, and more Dozens of new puzzles and solutions Study guide for Hex players Supplemenetary text for a course in game theory, discrete math, computer science, or science history

This book constitutes the refereed proceedings of the 7th International Algorithmic Number Theory Symposium, ANTS 2006, held in Berlin, July 2006. The book presents 37 revised full papers together with 4 invited papers selected for inclusion. The papers are organized in topical sections on algebraic number theory, analytic and elementary number theory, lattices, curves and varieties over fields of characteristic zero, curves over finite fields and applications, and discrete logarithms.

The theme of this book is the study of the distribution of integer powers modulo a prime number. It provides numerous new, sometimes quite unexpected, links between number theory and computer science as well as to other areas of mathematics. Possible applications include (but are not limited to) complexity theory, random number generation, cryptography, and coding theory. The main method discussed is based on bounds of exponential sums. Accordingly, the book contains many estimates of such sums, including new estimates of classical Gaussian sums. It also contains many open questions and proposals for further research.

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.

This volume contains the proceedings of the 7th International Seminar on - lational Methods in Computer Science (RelMiCS 7) and the 2nd International Workshop onApplications ofKleeneAlgebra.Thecommonmeetingtookplacein Bad Malente (near Kiel), Germany, from May May 12-17,2003.Its purpose was to bring together researchers from various subdisciplines of Computer Science, Mathematics and related ?elds who use the calculi of relations and/or Kleene algebra as methodological and conceptual tools in their work. This meeting is the joint continuation of two di?erent series of meetings. Previous RelMiCS seminars were held in Schloss Dagstuhl (Germany) in J- uary 1994, Parati (Brazil) in July 1995, Hammamet (Tunisia) in January 1997, Warsaw (Poland) in September 1998, Quebec (Canada) in January 2000, and Oisterwijk (The Netherlands) in October 2001. The ?rst workshop on appli- tions of Kleene algebra was also held in Schloss Dagstuhl in February 2001. To join these two events in a common meeting was mainly motivated by the s- stantialcommoninterestsandoverlapofthetwocommunities.Wehopethatthis leads to fruitful interactions and opens new and interesting research directions