This book deals with the characterization of extensions of number fields in terms of the decomposition of prime ideals, and with the group-theoretic questions arising from this number-theoretic problem. One special aspect of this question is the equality of Dedekind zeta functions of different number fields. This is an established problem which was solved for abelian extensions by class field theory, but which was only studied in detail in its general form from around 1970. The basis for the new results was a fruitful exchange between number theory and group theory. Some of the outstanidng results are based on the complete classification of all finite simple groups. This book reports on the great progress achieved in this period. It allows access to the new developments in this part of algebraic number theory and contains a unique blend of number theory and group theory. The results appear for the first time in a monograph and they partially extend the published literature.

This book presents the development of Prime Number Theory from its beginnings until the end of the first decade of the XXth century. Special emphasis is given to the work of Cebysev, Dirichlet, Riemann, Vallée-Poussin, Hadamard and Landau. The book presents the principal results with proofs and also gives, mostly in short comments, an overview of the development in the last 80 years. It is, however, not a historical book since it does not give biographical details of the people who have played a role in the development of Prime Number Theory. The book contains a large list of references with more than 1800 items. It can be read by any person with a knowledge of fundamental notions of number theory and complex analysis.

This book contains a compendium of 25 papers published since the 1970s dealing with pi and associated topics of mathematics and computer science. The collection begins with a Foreword by Bruce Berndt. Each contribution is preceded by a brief summary of its content as well as a short key word list indicating how the content relates to others in the collection. The volume includes articles on actual computations of pi, articles on mathematical questions related to pi (e.g., "Is pi normal?"), articles presenting new and often amazing techniques for computing digits of pi (e.g., the "BBP" algorithm for pi, which permits one to compute an arbitrary binary digit of pi without needing to compute any of the digits that came before), papers presenting important fundamental mathematical results relating to pi, and papers presenting new, high-tech techniques for analyzing pi (i.e., new graphical techniques that permit one to visually see if pi and other numbers are "normal"). This volume is a companion to Pi: A Source Book whose third edition released in 2004. The present collection begins with 2 papers from 1976, published by Eugene Salamin and Richard Brent, which describe "quadratically convergent" algorithms for pi and other basic mathematical functions, derived from some mathematical work of Gauss. Bailey and Borwein hold that these two papers constitute the beginning of the modern era of computational mathematics. This time period (1970s) also corresponds with the introduction of high-performance computer systems (supercomputers), which since that time have increased relentlessly in power, by approximately a factor of 100,000,000, advancing roughly at the same rate as Moore's Law of semiconductor technology. This book may be of interest to a wide range of mathematical readers; some articles cover more advanced research questions suitable for active researchers in the field, but several are highly accessible to undergraduate mathematics students.

Srinivasa Ramanujan is, arguably, the greatest mathematician that India has produced. His story is quite unusual: although he had no formal education inmathematics, he taught himself, and managed to produce many important new results. With the support of the English number theorist G. H. Hardy, Ramanujan received a scholarship to go to England and study mathematics. He died very young, at the age of 32, leaving behind three notebooks containing almost 3000 theorems, virtually all without proof. G. H. Hardy and others strongly urged that notebooks be edited and published, and the result is this series of books. This volume dealswith Chapters 1-9 of Book II; each theorem is either proved, or a reference to a proof is given.

Introduction to Number Theory covers the essential content of an introductory number theory course including divisibility and prime factorization, congruences, and quadratic reciprocity. The instructor may also choose from a collection of additional topics. Aligning with the trend toward smaller, essential texts in mathematics, the author strives for clarity of exposition. Proof techniques and proofs are presented slowly and clearly. The book employs a versatile approach to the use of algebraic ideas. Instructors who wish to put this material into a broader context may do so, though the author introduces these concepts in a non-essential way. A final chapter discusses algebraic systems (like the Gaussian integers) presuming no previous exposure to abstract algebra. Studying general systems urges students realize unique factorization into primes is a more subtle idea than may at first appear; students will find this chapter interesting, fun and quite accessible. Applications of number theory include several sections on cryptography and other applications to further interest instructors and students alike.

Theta functions were studied extensively by Ramanujan. This book provides a systematic development of Ramanujan's results and extends them to a general theory. The author's treatment of the subject is comprehensive, providing a detailed study of theta functions and modular forms for levels up to 12. Aimed at advanced undergraduates, graduate students, and researchers, the organization, user-friendly presentation, and rich source of examples, lends this book to serve as a useful reference, a pedagogical tool, and a stimulus for further research. Topics, especially those discussed in the second half of the book, have been the subject of much recent research; many of which are appearing in book form for the first time. Further results are summarized in the numerous exercises at the end of each chapter.

This book presents state-of-the-art research and survey articles that highlight work done within the Priority Program SPP 1489 "Algorithmic and Experimental Methods in Algebra, Geometry and Number Theory", which was established and generously supported by the German Research Foundation (DFG) from 2010 to 2016. The goal of the program was to substantially advance algorithmic and experimental methods in the aforementioned disciplines, to combine the different methods where necessary, and to apply them to central questions in theory and practice. Of particular concern was the further development of freely available open source computer algebra systems and their interaction in order to create powerful new computational tools that transcend the boundaries of the individual disciplines involved. The book covers a broad range of topics addressing the design and theoretical foundations, implementation and the successful application of algebraic algorithms in order to solve mathematical research problems. It offers a valuable resource for all researchers, from graduate students through established experts, who are interested in the computational aspects of algebra, geometry, and/or number theory.

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.

Adrien-Marie Legendre (1752-1833), one of the great French mathematicians active in the Revolutionary period, made important contributions to number theory, statistics, mathematical analysis and algebra. He taught at the Ecole Militaire, where he was a colleague of Laplace, and made his name with a paper on the trajectory of projectiles which won a prize of the Berlin Academy in 1782, and brought him to the attention of Lagrange. In 1794 he published Elements de geometrie, which remained a textbook for over 100 years. The first edition of his Essai sur la theorie des nombres was published in 1798, and the much improved second edition, which is offered here, in 1808. In it Legendre had taken account of criticism by Gauss of the mathematical proofs in the first edition, though he was bitter at the manner in which his younger rival had claimed credit for some of his solutions.

Exploring the Riemann Zeta Function: 190 years from Riemann's Birth presents a collection of chapters contributed by eminent experts devoted to the Riemann Zeta Function, its generalizations, and their various applications to several scientific disciplines, including Analytic Number Theory, Harmonic Analysis, Complex Analysis, Probability Theory, and related subjects. The book focuses on both old and new results towards the solution of long-standing problems as well as it features some key historical remarks. The purpose of this volume is to present in a unified way broad and deep areas of research in a self-contained manner. It will be particularly useful for graduate courses and seminars as well as it will make an excellent reference tool for graduate students and researchers in Mathematics, Mathematical Physics, Engineering and Cryptography.

In recent times, group theory has found wider applications in various fields of algebra and mathematics in general. But in order to apply this or that result, you need to know about it, and such results are often diffuse and difficult to locate, necessitating that readers construct an extended search through multiple monographs, articles, and papers. Such readers must wade through the morass of concepts and auxiliary statements that are needed to understand the desired results, while it is initially unclear which of them are really needed and which ones can be dispensed with. A further difficulty that one may encounter might be concerned with the form or language in which a given result is presented. For example, if someone knows the basics of group theory, but does not know the theory of representations, and a group theoretical result is formulated in the language of representation theory, then that person is faced with the problem of translating this result into the language with which they are familiar, etc. Infinite Groups: A Roadmap to Some Classical Areas seeks to overcome this challenge. The book covers a broad swath of the theory of infinite groups, without giving proofs, but with all the concepts and auxiliary results necessary for understanding such results. In other words, this book is an extended directory, or a guide, to some of the more established areas of infinite groups. Features An excellent resource for a subject formerly lacking an accessible and in-depth reference Suitable for graduate students, PhD students, and researchers working in group theory Introduces the reader to the most important methods, ideas, approaches, and constructions in infinite group theory.

The theory of sets of multiples, a subject which lies at the intersection of analytic and probabilistic number theory, has seen much development since the publication of Sequences by Halberstam and Roth nearly thirty years ago. The area is rich in problems, many of them still unsolved or arising from current work. The author sets out to give a coherent, essentially self-contained account of the existing theory and at the same time to bring the reader to the frontiers of research. One of the fascinations of the theory is the variety of methods applicable to it, which include Fourier analysis, group theory, high and ultra-low moments, probability and elementary inequalities, as well as several branches of number theory. This Tract is the first devoted to the subject, and will be of value to research workers or graduate students in number theory.

Perfect and amicable numbers, as well as a majority of classes of special numbers, have a long and rich history connected with the names of many famous mathematicians. This book gives a complete presentation of the theory of two classes of special numbers (perfect numbers and amicable numbers) and gives much of their properties, facts and theorems with full proofs of them, as well as their numerous analogue and generalizations.

This book is the English translation of Baumgart's thesis on the early proofs of the quadratic reciprocity law ("UEber das quadratische Reciprocitatsgesetz. Eine vergleichende Darstellung der Beweise"), first published in 1885. It is divided into two parts. The first part presents a very brief history of the development of number theory up to Legendre, as well as detailed descriptions of several early proofs of the quadratic reciprocity law. The second part highlights Baumgart's comparisons of the principles behind these proofs. A current list of all known proofs of the quadratic reciprocity law, with complete references, is provided in the appendix. This book will appeal to all readers interested in elementary number theory and the history of number theory.

Klaus Roth's pioneering research in the field of number theory has led to important and substantial breakthroughs in many areas, including sieve theory, diophantine approximation, and irregularities of distribution. His work on the Thue-Siegel-Roth Theorem earned him a Fields Medal in 1958 - the first British mathematician to receive the honour. Analytic Number Theory: Essays in Honour of Klaus Roth comprises 32 essays from close colleagues and leading experts in those fields in which he has worked, and provides a great insight into the historical development of the subject matter and the importance of Roth's contributions to number theory and beyond. His influence is also discussed in relation to more recent mathematical advances. Extensive lists of references make this a valuable source for research mathematicians in many areas, an introductory overview of the subject for beginning research students, and a fitting long-awaited tribute to a great mathematician.

This is an account of the proceedings of a very successful symposium of Transcendental Number Theory held in Durham in 1986. Most of the leading international specialists were present and the lectures reflected the great advances that have taken place in this area. Indeed, the evolution of transcendence into a fertile theory with numerous and widespread applications has been one of the most exciting developments of modern mathematics. The papers cover all the main branches of the subject, and include not only definitive research but valuable survey articles. The work as a whole is an important contribution to mathematics and will be of considerable influence in the further direction of transcendence theory as well as an authoritative account of its current state.

This book is summarizing the results of the workshop "Uniform Distribution and Quasi-Monte Carlo Methods" of the RICAM Special Semester on "Applications of Algebra and Number Theory" in October 2013. The survey articles in this book focus on number theoretic point constructions, uniform distribution theory, and quasi-Monte Carlo methods. As deterministic versions of the Monte Carlo method, quasi-Monte Carlo rules enjoy increasing popularity, with many fruitful applications in mathematical practice, as for example in finance, computer graphics, and biology. The goal of this book is to give an overview of recent developments in uniform distribution theory, quasi-Monte Carlo methods, and their applications, presented by leading experts in these vivid fields of research.

Number theory is one of the oldest and most appealing areas of mathematics. Computation has always played a role in number theory, a role which has increased dramatically in the last 20 or 30 years, both because of the advent of modern computers, and because of the discovery of surprising and powerful algorithms. As a consequence, algorithmic number theory has gradually emerged as an important and distinct field with connections to computer science and cryptography as well as other areas of mathematics. This text provides a comprehensive introduction to algorithmic number theory for beginning graduate students, written by the leading experts in the field. It includes several articles that cover the essential topics in this area, and in addition, there are contributions pointing in broader directions, including cryptography, computational class field theory, zeta functions and L-series, discrete logarithm algorithms, and quantum computing.

If numbers were objects, how could there be human knowledge of number? Numbers are not physical objects: must we conclude that we have a mysterious power of perceiving the abstract realm? Or should we instead conclude that numbers are fictions? This book argues that numbers are not objects: they are magnitude properties. Properties are not fictions and we certainly have scientific knowledge of them. Much is already known about magnitude properties such as inertial mass and electric charge, and much continues to be discovered. The book says the same is true of numbers. In the theory of magnitudes, the categorial distinction between quantity and individual is of central importance, for magnitudes are properties of quantities, not properties of individuals. Quantity entails divisibility, so the logic of quantity needs mereology, the a priori logic of part and whole. The three species of quantity are pluralities, continua and series, and the book presents three variants of mereology, one for each species of quantity. Given Euclid's axioms of equality, it is possible without the use of set theory to deduce the axioms of the natural, real and ordinal numbers from the respective mereologies of pluralities, continua and series. Knowledge and the Philosophy of Number carries out these deductions, arriving at a metaphysics of number that makes room for our a priori knowledge of mathematical reality.

The decomposition of the space L2(G(Q)\G(A)), where G is a reductive group defined over Q and A is the ring of adeles of Q, is a deep problem at the intersection of number and group theory. Langlands reduced this decomposition to that of the (smaller) spaces of cuspidal automorphic forms for certain subgroups of G. This book describes this proof in detail. The starting point is the theory of automorphic forms, which can also serve as a first step towards understanding the Arthur-Selberg trace formula. To make the book reasonably self-contained, the authors also provide essential background in subjects such as: automorphic forms; Eisenstein series; Eisenstein pseudo-series, and their properties. It is thus also an introduction, suitable for graduate students, to the theory of automorphic forms, the first written using contemporary terminology. It will be welcomed by number theorists, representation theorists and all whose work involves the Langlands program.

The book is aimed at people working in number theory or at least interested in this part of mathematics. It presents the development of the theory of algebraic numbers up to the year 1950 and contains a rather complete bibliography of that period. The reader will get information about results obtained before 1950. It is hoped that this may be helpful in preventing rediscoveries of old results, and might also inspire the reader to look at the work done earlier, which may hide some ideas which could be applied in contemporary research.

This proceedings volume contains articles related to the research presented at the 2017 Simons Symposium on p-adic Hodge theory. This symposium was focused on recent developments in p-adic Hodge theory, especially those concerning integral questions and their connections to notions in algebraic topology. This volume features original research articles as well as articles that contain new research and survey some of these recent developments. It is the first of three volumes dedicated to p-adic Hodge theory.

This book presents the mathematical background underlying security modeling in the context of next-generation cryptography. By introducing new mathematical results in order to strengthen information security, while simultaneously presenting fresh insights and developing the respective areas of mathematics, it is the first-ever book to focus on areas that have not yet been fully exploited for cryptographic applications such as representation theory and mathematical physics, among others. Recent advances in cryptanalysis, brought about in particular by quantum computation and physical attacks on cryptographic devices, such as side-channel analysis or power analysis, have revealed the growing security risks for state-of-the-art cryptographic schemes. To address these risks, high-performance, next-generation cryptosystems must be studied, which requires the further development of the mathematical background of modern cryptography. More specifically, in order to avoid the security risks posed by adversaries with advanced attack capabilities, cryptosystems must be upgraded, which in turn relies on a wide range of mathematical theories. This book is suitable for use in an advanced graduate course in mathematical cryptography, while also offering a valuable reference guide for experts.