This set of lectures provides a structured introduction to the concept of equidistribution in number theory. This concept is of growing importance in many areas, including cryptography, zeros of L-functions, Heegner points, prime number theory, the theory of quadratic forms, and the arithmetic aspects of quantum chaos.

The volume brings together leading researchers from a range of fields who reveal fascinating links between seemingly disparate areas.

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.

An Introduction to the Theory of Numbers by G. H. Hardy and E. M. Wright is found on the reading list of virtually all elementary number theory courses and is widely regarded as the primary and classic text in elementary number theory. Developed under the guidance of D. R. Heath-Brown, this Sixth Edition of An Introduction to the Theory of Numbers has been extensively revised and updated to guide today's students through the key milestones and developments in number theory.
Updates include a chapter by J. H. Silverman on one of the most important developments in number theory -- modular elliptic curves and their role in the proof of Fermat's Last Theorem -- a foreword by A. Wiles, and comprehensively updated end-of-chapter notes detailing the key developments in number theory. Suggestions for further reading are also included for the more avid reader.
The text retains the style and clarity of previous editions making it highly suitable for undergraduates in mathematics from the first year upwards as well as an essential reference for all number theorists.

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.

Yearning for the Impossible: The Surprising Truth of Mathematics, Second Edition explores the history of mathematics from the perspective of the creative tension between common sense and the "impossible" as the author follows the discovery or invention of new concepts that have marked mathematical progress. The author puts these creations into a broader context involving related "impossibilities" from art, literature, philosophy, and physics. This new edition contains many new exercises and commentaries, clearly discussing a wide range of challenging subjects.

This book presents material suitable for an undergraduate course in elementary number theory from a computational perspective. It seeks to not only introduce students to the standard topics in elementary number theory, such as prime factorization and modular arithmetic, but also to develop their ability to formulate and test precise conjectures from experimental data. Each topic is motivated by a question to be answered, followed by some experimental data, and, finally, the statement and proof of a theorem. There are numerous opportunities throughout the chapters and exercises for the students to engage in (guided) open-ended exploration. At the end of a course using this book, the students will understand how mathematics is developed from asking questions to gathering data to formulating and proving theorems. The mathematical prerequisites for this book are few. Early chapters contain topics such as integer divisibility, modular arithmetic, and applications to cryptography, while later chapters contain more specialized topics, such as Diophantine approximation, number theory of dynamical systems, and number theory with polynomials. Students of all levels will be drawn in by the patterns and relationships of number theory uncovered through data driven exploration.

This book is an exploration of philosophical questions about infinity. Graham Oppy examines how the infinite lurks everywhere, both in science and in our ordinary thoughts about the world. He also analyses the many puzzles and paradoxes that follow in the train of the infinite. Even simple notions, such as counting, adding and maximising present serious difficulties. Other topics examined include the nature of space and time, infinities in physical science, infinities in theories of probability and decision, the nature of part/whole relations, mathematical theories of the infinite, and infinite regression and principles of sufficient reason.

Leibniz Algebras: Structure and Classification is designed to introduce the reader to the theory of Leibniz algebras. Leibniz algebra is the generalization of Lie algebras. These algebras preserve a unique property of Lie algebras that the right multiplication operators are derivations. They first appeared in papers of A.M Blokh in the 1960s, under the name D-algebras, emphasizing their close relationship with derivations. The theory of D-algebras did not get as thorough an examination as it deserved immediately after its introduction. Later, the same algebras were introduced in 1993 by Jean-Louis Loday , who called them Leibniz algebras due to the identity they satisfy. The main motivation for the introduction of Leibniz algebras was to study the periodicity phenomena in algebraic K-theory. Nowadays, the theory of Leibniz algebras is one of the more actively developing areas of modern algebra. Along with (co)homological, structural and classification results on Leibniz algebras, some papers with various applications of the Leibniz algebras also appear now. However, the focus of this book is mainly on the classification problems of Leibniz algebras. Particularly, the authors propose a method of classification of a subclass of Leibniz algebras based on algebraic invariants. The method is applicable in the Lie algebras case as well. Features: Provides a systematic exposition of the theory of Leibniz algebras and recent results on Leibniz algebras Suitable for final year bachelor's students, master's students and PhD students going into research in the structural theory of finite-dimensional algebras, particularly, Lie and Leibniz algebras Covers important and more general parts of the structural theory of Leibniz algebras that are not addressed in other texts

Ce travail en deux volumes donne la preuve de la stabilisation de la formule des trace tordue. Stabiliser la formule des traces tordue est la methode la plus puissante connue actuellement pour comprendre l'action naturelle du groupe des points adeliques d'un groupe reductif, tordue par un automorphisme, sur les formes automorphes de carre integrable de ce groupe. Cette comprehension se fait en reduisant le probleme, suivant les idees de Langlands, a des groupes plus petits munis d'un certain nombre de donnees auxiliaires; c'est ce que l'on appelle les donnees endoscopiques. L'analogue non tordu a ete resolu par J. Arthur et dans ce livre on suit la strategie de celui-ci. Publier ce travail sous forme de livre permet de le rendre le plus complet possible. Les auteurs ont repris la theorie de l'endoscopie tordue developpee par R. Kottwitz et D. Shelstad et par J.-P. Labesse. Ils donnent tous les arguments des demonstrations meme si nombre d'entre eux se trouvent deja dans les travaux d'Arthur concernant le cas de la formule des traces non tordue. Ce travail permet de rendre inconditionnelle la classification que J. Arthur a donnee des formes automorphes de carre integrable pour les groupes classiques quasi-deployes, c'etait pour les auteurs une des principales motivations pour l'ecrire. Cette premiere partie comprend les chapitres preparatoires (I-V).

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.

The legacy of Helmut Hasse, consisting of letters, manuscripts and other - pers, is kept at theHandschriftenabteilung of the University Library at Gottin- ] gen.Hassehadanextensivecorrespondence;helikedtoexchangemathematical ideas, results and methods freely with his colleagues. There are more than 8000 documents preserved. Although not all of them are of equal mathematical - terest, searching through this treasure can help us to assess the development of Number Theory through the 1920's and 1930's. Unfortunately, most of the correspondence is preserved on one side only, i.e., the letterssenttoHasse are availablewhereasmanyoftheletterswhichhadbeensentfromhim, oftenha- written, seem to be lost. So we have to interpolate, as far as possible, from the repliestoHasseandfromothercontexts, inorderto?ndoutwhathehadwritten 1 in his outgoing letters. The present article is largely based on the letters and other documents which I have found concerning the Brauer-Hasse-NoetherTheorem in the theory of algebras; this covers the years around 1931. Besides the do- ments from the Hasse and the Brauer legacy in Gottingen, ] I shall also use some letters from Emmy Noether to Richard Brauer which are preserved at the Bryn Mawr College Library (Pennsylvania, USA)."

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

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.

A complete, self-contained introduction to a powerful and resurging mathematical discipline … Combinatorial Geometry presents and explains with complete proofs some of the most important results and methods of this relatively young mathematical discipline, started by Minkowski, Fejes Tóth, Rogers, and Erd???s. Nearly half the results presented in this book were discovered over the past twenty years, and most have never before appeared in any monograph. Combinatorial Geometry will be of particular interest to mathematicians, computer scientists, physicists, and materials scientists interested in computational geometry, robotics, scene analysis, and computer-aided design. It is also a superb textbook, complete with end-of-chapter problems and hints to their solutions that help students clarify their understanding and test their mastery of the material. Topics covered include:

• Geometric number theory
• Packing and covering with congruent convex disks
• Extremal graph and hypergraph theory
• Distribution of distances among finitely many points
• Epsilon-nets and Vapnik—Chervonenkis dimension
• Geometric graph theory
• Geometric discrepancy theory
• And much more

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.

Combinatorics and Number Theory of Counting Sequences is an introduction to the theory of finite set partitions and to the enumeration of cycle decompositions of permutations. The presentation prioritizes elementary enumerative proofs. Therefore, parts of the book are designed so that even those high school students and teachers who are interested in combinatorics can have the benefit of them. Still, the book collects vast, up-to-date information for many counting sequences (especially, related to set partitions and permutations), so it is a must-have piece for those mathematicians who do research on enumerative combinatorics. In addition, the book contains number theoretical results on counting sequences of set partitions and permutations, so number theorists who would like to see nice applications of their area of interest in combinatorics will enjoy the book, too. Features The Outlook sections at the end of each chapter guide the reader towards topics not covered in the book, and many of the Outlook items point towards new research problems. An extensive bibliography and tables at the end make the book usable as a standard reference. Citations to results which were scattered in the literature now become easy, because huge parts of the book (especially in parts II and III) appear in book form for the first time.

In his first book, Philosophy of Arithmetic, Edmund Husserl provides a carefully worked out account of number as a categorial or formal feature of the objective world, and of arithmetic as a symbolic technique for mastering the infinite field of numbers for knowledge. It is a realist account of numbers and number relations that interweaves them into the basic structure of the universe and into our knowledge of reality. It provides an answer to the question of how arithmetic applies to reality, and gives an account of how, in general, formalized systems of symbols work in providing access to the world. The "appendices" to this book provide some of Husserl's subsequent discussions of how formalisms work, involving David Hilbert's program of completeness for arithmetic. "Completeness" is integrated into Husserl's own problematic of the "imaginary," and allows him to move beyond the analysis of "representations" in his understanding of the logic of mathematics.
Husserl's work here provides an alternative model of what "conceptual analysis" should be - minus the "linguistic turn," but inclusive of language and linguistic meaning. In the process, he provides case after case of "Phenomenological Analysis" - fortunately unencumbered by that title - of the convincing type that made Husserl's life and thought a fountainhead of much of the most important philosophical work of the twentieth Century in Europe. Many Husserlian themes to be developed at length in later writings first emerge here: Abstraction, internal time consciousness, polythetic acts, acts of higher order ('founded' acts), Gestalt qualities and their role in knowledge, formalization (as opposed to generalization), essence analysis, and so forth.
This volume is a window on a period of rich and illuminating philosophical activity that has been rendered generally inaccessible by the supposed "revolution" attributed to "Analytic Philosophy" so-called. Careful exposition and critique is given to every serious alternative account of number and number relations available at the time. Husserl's extensive and trenchant criticisms of Gottlob Frege's theory of number and arithmetic reach far beyond those most commonly referred to in the literature on their views.

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

The 13 chapters of this book centre around the proof of Theorem 1 of Faltings' paper "Diophantine approximation on abelian varieties," Ann. Math.133 (1991) and together give an approach to the proof that is accessible to Ph.D-level students in number theory and algebraic geometry. Each chapter is based on an instructional lecture given by its author ata special conference for graduate students, on the topic of Faltings' paper.

Algebraic number theory is a subject which came into being through the attempts of mathematicians to try to prove Fermat's last theorem and which now has a wealth of applications to diophantine equations, cryptography, factoring, primality testing and public-key cryptosystems. This book provides an introduction to the subject suitable for senior undergraduates and beginning graduate students in mathematics. The material is presented in a straightforward, clear and elementary fashion, and the approach is hands on, with an explicit computational flavour. Prerequisites are kept to a minimum, and numerous examples illustrating the material occur throughout the text. References to suggested reading and to the biographies of mathematicians who have contributed to the development of algebraic number theory are given at the end of each chapter. There are over 320 exercises, an extensive index, and helpful location guides to theorems and lemmas in the text.

This book constitutes the refereed proceedings of the International Conference on Automated Reasoning with Analytic Tableaux and Related Methods, TABLEAUX 2003, held in Rome, Italy in September 2003. The 20 revised full papers presented were carefully reviewed and selected for inclusion in the book. All current issues surrounding the mechanization of logical reasoning with tableaux and similar methods are addressed in the context of a broad variety of logic calculi.

Since their discovery hundreds of years ago, people have been fascinated by the wondrous properties of Fibonacci numbers. Being of mathematical significance in their own right, Fibonacci numbers have had an impact on areas like art and architecture, and their traces can be found in nature and even the behavior of the stock market. Starting with the basic properties of Fibonacci numbers, the present book explores their relevance in number theory, the theory of continued fractions, geometry and approximation theory. Rather than giving a complete account of the subject, a few chosen examples are treated exhaustively. They not only reveal the bearing of Fibonacci numbers on mathematics, but also provide very readable marvels of mathematical reasoning. This book is the translation of the 6th Russian edition (the first edition appeared in the early fifties and became a standard source of information on the subject).

The C.I.M.E. session in Diophantine Approximation, held in Cetraro (Italy) June 28 - July 6, 2000 focused on height theory, linear independence and transcendence in group varieties, Baker's method, approximations to algebraic numbers and applications to polynomial-exponential diophantine equations and to diophantine theory of linear recurrences. Very fine lectures by D. Masser, Y. Nesterenko, H.-P. Schlickewei, W.M. Schmidt and M. Walsschmidt have resulted giving a good overview of these topics, and describing central results, both classical and recent, emphasizing the new methods and ideas of the proofs rather than the details. They are addressed to a wide audience and do not require any prior specific knowledge.