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.

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.

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.

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

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.

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

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

Special functions, which include the trigonometric functions, have been used for centuries. Their role in the solution of differential equations was exploited by Newton and Leibniz, and the subject of special functions has been in continuous development ever since. In just the past thirty years several new special functions and applications have been discovered. This treatise presents an overview of the area of special functions, focusing primarily on the hypergeometric functions and the associated hypergeometric series. It includes both important historical results and recent developments and shows how these arise from several areas of mathematics and mathematical physics. Particular emphasis is placed on formulas that can be used in computation. The book begins with a thorough treatment of the gamma and beta functions that are essential to understanding hypergeometric functions. Later chapters discuss Bessel functions, orthogonal polynomials and transformations, the Selberg integral and its applications, spherical harmonics, q-series, partitions, and Bailey chains. This clear, authoritative work will be a lasting reference for students and researchers in number theory, algebra, combinatorics, differential equations, applied mathematics, mathematical computing, and mathematical physics.

These lecture notes treat polynomial identity rings from both the combinatorial and structural points of view. The greater part of recent research in polynomial identity rings is about combinatorial questions, and the combinatorial part of the lecture notes gives an up-to-date account of recent research. On the other hand, the main structural results have been known for some time, and the emphasis there is on a presentation accessible to newcomers to the subject.

Intermediate in level between an advanced textbook and a monograph, this book covers both the classical and representation theoretic views of automorphic forms in a style which is accessible to graduate students entering the field. The treatment is based on complete proofs, which reveal the uniqueness principles underlying the basic constructions. The book features extensive foundational material on the representation theory of GL(1) and GL(2) over local fields, the theory of automorphic representations, L-functions and advanced topics such as the Langlands conjectures, the Weil representation, the Rankin-Selberg method and the triple L-function, examining this subject matter from many different and complementary viewpoints. Researchers as well as students will find this a valuable guide to a notoriously difficult subject.

Beginning with a brief introduction to algorithms and diophantine equations, this volume provides a coherent modern account of the methods used to find all the solutions to certain diophantine equations, particularly those developed for use on a computer. The study is divided into three parts, emphasizing approaches with a wide range of applications. The first section considers basic techniques including local methods, sieving, descent arguments and the LLL algorithm. The second section explores problems that can be solved using Baker's theory of linear forms in logarithms. The final section looks at problems associated with curves, focusing on rational and integral points on elliptic curves. Each chapter concludes with a useful set of exercises. A detailed bibliography is included. This book will appeal to graduate students and research workers interested in solving diophantine equations using computational methods.

Beginning with a brief introduction to algorithms and diophantine equations, this volume provides a coherent modern account of the methods used to find all the solutions to certain diophantine equations, particularly those developed for use on a computer. The study is divided into three parts, emphasizing approaches with a wide range of applications. The first section considers basic techniques including local methods, sieving, descent arguments and the LLL algorithm. The second section explores problems that can be solved using Baker's theory of linear forms in logarithms. The final section looks at problems associated with curves, focusing on rational and integral points on elliptic curves. Each chapter concludes with a useful set of exercises. A detailed bibliography is included. This book will appeal to graduate students and research workers interested in solving diophantine equations using computational methods.

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 develops the theory of partitions. Simply put, the partitions of a number are the ways of writing that number as sums of positive integers. For example, the five partitions of 4 are 4: 3+1, 2+2, 2+1+1, and 1+1+1+1. Surprisingly, such a simple matter requires some deep mathematics for its study. This book considers the many theoretical aspects of this subject, which have in turn recently found applications to statistical mechanics, computer science and other branches of mathematics. With minimal prerequisites, this book is suitable for students as well as researchers in combinatorics, analysis, and number theory.

This is the first of two volumes providing an introduction to modern developments in the representation theory of finite groups and associative algebras, which have transformed the subject into a study of categories of modules. Thus, Dr. Benson's unique perspective in this book incorporates homological algebra and the theory of representations of finite-dimensional algebras. This volume is primarily concerned with the exposition of the necessary background material, and the heart of the discussion is a lengthy introduction to the (Auslander-Reiten) representation theory of finite dimensional algebras, in which the techniques of quivers with relations and almost-split sequences are discussed in some detail.

This book, now in its 2nd edition, is devoted to the arithmetical theory of Siegel modular forms and their L-functions. The central object are L-functions of classical Siegel modular forms whose special values are studied using the Rankin-Selberg method and the action of certain differential operators on modular forms which have nice arithmetical properties.

A new method of p-adic interpolation of these critical values is presented. An important class of p-adic L-functions treated in the present book are p-adic L-functions of Siegel modular forms having logarithmic growth. The given construction of these p-adic L-functions uses precise algebraic properties of the arithmetical Shimura differential operator.

The book will be very useful for postgraduate students and for non-experts looking for a quick approach to a rapidly developing domain of algebraic number theory. This new edition is substantially revised to account for the new explanations that have emerged in the past 10 years of the main formulas for special L-values in terms of arithmetical theory of nearly holomorphic modular forms.

The sixth Algorithmic Number Theory Symposium was held at the University of Vermont, in Burlington, from 13-18 June 2004. The organization was a joint e?ort of number theorists from around the world. There were four invited talks at ANTS VI, by Dan Bernstein of the Univ- sity of Illinois at Chicago, Kiran Kedlaya of MIT, Alice Silverberg of Ohio State University, and Mark Watkins of Pennsylvania State University. Thirty cont- buted talks were presented, and a poster session was held. This volume contains the written versions of the contributed talks and three of the four invited talks. (Not included is the talk by Dan Bernstein.) ANTS in Burlington is the sixth in a series that began with ANTS I in 1994 at Cornell University, Ithaca, New York, USA and continued at UniversiteB- deaux I, Bordeaux, France (1996), Reed College, Portland, Oregon, USA (1998), the University of Leiden, Leiden, The Netherlands (2000), and the University of Sydney, Sydney, Australia (2002). The proceedings have been published as volumes 877, 1122, 1423, 1838, and 2369 of Springer-Verlag's Lecture Notes in Computer Science series. The organizers of the 2004 ANTS conference express their special gratitude and thanks to John Cannon and Joe Buhler for invaluable behind-the-scenes advice."

This volume presents an authoritative, up-to-date review of analytic number theory. It contains outstanding contributions from leading international figures in this field. Core topics discussed include the theory of zeta functions, spectral theory of automorphic forms, classical problems in additive number theory such as the Goldbach conjecture, and diophantine approximations and equations. This will be a valuable book for graduates and researchers working in number theory.