This graduate-level textbook provides an elementary exposition of the theory of automorphic representations and L-functions for the general linear group in an adelic setting. Definitions are kept to a minimum and repeated when reintroduced so that the book is accessible from any entry point, and with no prior knowledge of representation theory. The book includes concrete examples of global and local representations of GL(n), and presents their associated L-functions. In Volume 1, the theory is developed from first principles for GL(1), then carefully extended to GL(2) with complete detailed proofs of key theorems. Several proofs are presented for the first time, including Jacquet's simple and elegant proof of the tensor product theorem. In Volume 2, the higher rank situation of GL(n) is given a detailed treatment. Containing numerous exercises by Xander Faber, this book will motivate students and researchers to begin working in this fertile field of research.

This book deals with the development of Diophantine problems starting with Thue's path breaking result and culminating in Roth's theorem with applications. It discusses classical results including Hermite-Lindemann-Weierstrass theorem, Gelfond-Schneider theorem, Schmidt's subspace theorem and more. It also includes two theorems of Ramachandra which are not widely known and other interesting results derived on the values of Weierstrass elliptic function. Given the constantly growing number of applications of linear forms in logarithms, it is becoming increasingly important for any student wanting to work in this area to know the proofs of Baker's original results. This book presents Baker's original results in a format suitable for graduate students, with a focus on presenting the content in an accessible and simple manner. Each student-friendly chapter concludes with selected problems in the form of "Exercises" and interesting information presented as "Notes," intended to spark readers' curiosity.

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.

This book gathers together selected contributions presented at the 3rd Moroccan Andalusian Meeting on Algebras and their Applications, held in Chefchaouen, Morocco, April 12-14, 2018, and which reflects the mathematical collaboration between south European and north African countries, mainly France, Spain, Morocco, Tunisia and Senegal. The book is divided in three parts and features contributions from the following fields: algebraic and analytic methods in associative and non-associative structures; homological and categorical methods in algebra; and history of mathematics. Covering topics such as rings and algebras, representation theory, number theory, operator algebras, category theory, group theory and information theory, it opens up new avenues of study for graduate students and young researchers. The findings presented also appeal to anyone interested in the fields of algebra and mathematical analysis.

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.

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.

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.

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.

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.

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.

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.

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.

How do you remember more and forget less? How can you earn more and become more creative just by moving house? And how do you pack a car boot most efficiently? This is your shortcut to the art of the shortcut. Mathematics is full of better ways of thinking, and with over 2,000 years of knowledge to draw on, Oxford mathematician Marcus du Sautoy interrogates his passion for shortcuts in this fresh and fascinating guide. After all, shortcuts have enabled so much of human progress, whether in constructing the first cities around the Euphrates 5,000 years ago, using calculus to determine the scale of the universe or in writing today's algorithms that help us find a new life partner. As well as looking at the most useful shortcuts in history - such as measuring the circumference of the earth in 240 BC to diagrams that illustrate how modern GPS works - Marcus also looks at how you can use shortcuts in investing or how to learn a musical instrument to memory techniques. He talks to, among many, the writer Robert MacFarlane, cellist Natalie Clein and the psychologist Suzie Orbach, asking whether shortcuts are always the best idea and, if so, when they use them. With engaging puzzles and conundrums throughout to illustrate the shortcut's ability to find solutions with speed, Thinking Better offers many clever strategies for daily complex problems.

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.

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

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.

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.

In 1963 a schoolboy browsing in his local library stumbled across the world's greatest mathematical problem: Fermat's Last Theorem, a puzzle that every child can understand but which has baffled mathematicians for over 300 years. Aged just ten, Andrew Wiles dreamed that he would crack it. Wiles's lifelong obsession with a seemingly simple challenge set by a long-dead Frenchman is an emotional tale of sacrifice and extraordinary determination. In the end, Wiles was forced to work in secrecy and isolation for seven years, harnessing all the power of modern maths to achieve his childhood dream. Many before him had tried and failed, including a 18-century philanderer who was killed in a duel. An 18-century Frenchwoman made a major breakthrough in solving the riddle, but she had to attend maths lectures at the Ecole Polytechnique disguised as a man since women were forbidden entry to the school. A remarkable story of human endeavour and intellectual brilliance over three centuries, Fermat's Last Theorem will fascinate both specialist and general readers.

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.

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.

This highly readable book aims to ease the many challenges of starting undergraduate research. It accomplishes this by presenting a diverse series of self-contained, accessible articles which include specific open problems and prepare the reader to tackle them with ample background material and references. Each article also contains a carefully selected bibliography for further reading. The content spans the breadth of mathematics, including many topics that are not normally addressed by the undergraduate curriculum (such as matroid theory, mathematical biology, and operations research), yet have few enough prerequisites that the interested student can start exploring them under the guidance of a faculty member. Whether trying to start an undergraduate thesis, embarking on a summer REU, or preparing for graduate school, this book is appropriate for a variety of students and the faculty who guide them.

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.