This book is an introduction to the algorithmic aspects of number theory and its applications to cryptography, with special emphasis on the RSA cryptosys-tem. It covers many of the familiar topics of elementary number theory, all with an algorithmic twist. The text also includes many interesting historical notes.

This volume contains the proceedings of the Arizona Winter School 2016, which was held from March 12-16, 2016, at The University of Arizona, Tucson, AZ. In the last decade or so, analytic methods have had great success in answering questions in arithmetic geometry and number theory. The School provided a unique opportunity to introduce graduate students to analytic methods in arithmetic geometry. The book contains four articles. Alina C. Cojocaru's article introduces sieving techniques to study the group structure of points of the reduction of an elliptic curve modulo a rational prime via its division fields. Harald A. Helfgott's article provides an introduction to the study of growth in groups of Lie type, with $\mathrm{SL}_2(\mathbb{F}_q)$ and some of its subgroups as the key examples. The article by Etienne Fouvry, Emmanuel Kowalski, Philippe Michel, and Will Sawin describes how a systematic use of the deep methods from $\ell$-adic cohomology pioneered by Grothendieck and Deligne and further developed by Katz and Laumon help make progress on various classical questions from analytic number theory. The last article, by Andrew V. Sutherland, introduces Sato-Tate groups and explores their relationship with Galois representations, motivic $L$-functions, and Mumford-Tate groups.

This volume aims at collecting survey papers which give broad and enlightening perspectives of various aspects of number theory.Kitaoka's paper is a continuation of his earlier paper published in the last proceedings and pushes the research forward. Browning's paper introduces a new direction of research on analytic number theory - quantitative theory of some surfaces and Bruedern et al's paper details state-of-the-art affairs of additive number theory. There are two papers on modular forms - Kohnen's paper describes generalized modular forms (GMF) which has some applications in conformal field theory, while Liu's paper is very useful for readers who want to have a quick introduction to Maass forms and some analytic-number-theoretic problems related to them. Matsumoto et al's paper gives a very thorough survey on functional relations of root system zeta-functions, Hoshi-Miyake's paper is a continuation of Miyake's long and fruitful research on generic polynomials and gives rise to related Diophantine problems, and Jia's paper surveys some dynamical aspects of a special arithmetic function connected with the distribution of prime numbers. There are two papers of collections of problems by Shparlinski on exponential and character sums and Schinzel on polynomials which will serve as an aid for finding suitable research problems. Yamamura's paper is a complete bibliography on determinant expressions for a certain class number and will be useful to researchers.Thus the book gives a good-balance of classical and modern aspects in number theory and will be useful to researchers including enthusiastic graduate students.

Noncommutative Geometry and Cayley-smooth Orders explains the theory of Cayley-smooth orders in central simple algebras over function fields of varieties. In particular, the book describes the etale local structure of such orders as well as their central singularities and finite dimensional representations. After an introduction to partial desingularizations of commutative singularities from noncommutative algebras, the book presents the invariant theoretic description of orders and their centers. It proceeds to introduce etale topology and its use in noncommutative algebra as well as to collect the necessary material on representations of quivers. The subsequent chapters explain the etale local structure of a Cayley-smooth order in a semisimple representation, classify the associated central singularity to smooth equivalence, describe the nullcone of these marked quiver representations, and relate them to the study of all isomorphism classes of n-dimensional representations of a Cayley-smooth order. The final chapters study Quillen-smooth algebras via their finite dimensional representations. Noncommutative Geometry and Cayley-smooth Orders provides a gentle introduction to one of mathematics' and physics' hottest topics.

A remarkable interplay exists between the fields of elliptic functions and orthogonal polynomials. In the first monograph to explore their connections, Elliptic Polynomials combines these two areas of study, leading to an interesting development of some basic aspects of each. It presents new material about various classes of polynomials and about the odd Jacobi elliptic functions and their inverses. The term elliptic polynomials refers to the polynomials generated by odd elliptic integrals and elliptic functions. In studying these, the authors consider such things as orthogonality and the construction of weight functions and measures, finding structure constants and interesting inequalities, and deriving useful formulas and evaluations. Although some of the material may be familiar, it establishes a new mathematical field that intersects with classical subjects at many points. Its wealth of information on important properties of polynomials and clear, accessible presentation make Elliptic Polynomials valuable to those in real and complex analysis, number theory, and combinatorics, and will undoubtedly generate further research.

The first thing you will find out about this book is that it is fun to read. It is meant for the browser, as well as for the student and for the specialist wanting to know about the area. The footnotes give an historical background to the text, in addition to providing deeper applications of the concept that is being cited. This allows the browser to look more deeply into the history or to pursue a given sideline. Those who are only marginally interested in the area will be able to read the text, pick up information easily, and be entertained at the same time by the historical and philosophical digressions. It is rich in structure and motivation in its concentration upon quadratic orders. This is not a book that is primarily about tables, although there are 80 pages of appendices that contain extensive tabular material (class numbers of real and complex quadratic fields up to 104; class group structures; fundamental units of real quadratic fields; and more!). This book is primarily a reference book and graduate student text with more than 200 exercises and a great deal of hints! The motivation for the text is best given by a quote from the Preface of Quadratics: "There can be no stronger motivation in mathematical inquiry than the search for truth and beauty. It is this author's long-standing conviction that number theory has the best of both of these worlds. In particular, algebraic and computational number theory have reached a stage where the current state of affairs richly deserves a proper elucidation. It is this author's goal to attempt to shine the best possible light on the subject."

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.

Sums of Squares of Integers covers topics in combinatorial number theory as they relate to counting representations of integers as sums of a certain number of squares. The book introduces a stimulating area of number theory where research continues to proliferate. It is a book of "firsts" - namely it is the first book to combine Liouville's elementary methods with the analytic methods of modular functions to study the representation of integers as sums of squares. It is the first book to tell how to compute the number of representations of an integer n as the sum of s squares of integers for any s and n. It is also the first book to give a proof of Szemeredi's theorem, and is the first number theory book to discuss how the modern theory of modular forms complements and clarifies the classical fundamental results about sums of squares. The book presents several existing, yet still interesting and instructive, examples of modular forms. Two chapters develop useful properties of the Bernoulli numbers and illustrate arithmetic progressions, proving the theorems of van der Waerden, Roth, and Szemeredi. The book also explains applications of the theory to three problems that lie outside of number theory in the areas of cryptanalysis, microwave radiation, and diamond cutting. The text is complemented by the inclusion of over one hundred exercises to test the reader's understanding.

While its roots reach back to the third century, diophantine analysis continues to be an extremely active and powerful area of number theory. Many diophantine problems have simple formulations, they can be extremely difficult to attack, and many open problems and conjectures remain. Diophantine Analysis examines the theory of diophantine approximations and the theory of diophantine equations, with emphasis on interactions between these subjects. Beginning with the basic principles, the author develops his treatment around the theory of continued fractions and examines the classic theory, including some of its applications. He also explores modern topics rarely addressed in other texts, including the abc conjecture, the polynomial Pell equation, and the irrationality of the zeta function and touches on topics and applications related to discrete mathematics, such as factoring methods for large integers. Setting the stage for tackling the field's many open problems and conjectures, Diophantine Analysis is an ideal introduction to the fundamentals of this venerable but still dynamic field. A detailed appendix supplies the necessary background material, more than 200 exercises reinforce the concepts, and engaging historical notes bring the subject to life.

This edited review book on Godunov methods contains 97 articles, all of which were presented at the international conference on Godunov Methods: Theory and Applications, held at Oxford, in October 1999, to commemorate the 70th birthday of the Russian mathematician Sergei K. Godunov. The central theme of this book is numerical methods for hyperbolic conservation laws following Godunov's key ideas contained in his celebrated paper of 1959. Hyperbolic conservation laws play a central role in mathematical modelling in several distinct disciplines of science and technology. Application areas include compressible, single (and multiple) fluid dynamics, shock waves, meteorology, elasticity, magnetohydrodynamics, relativity, and many others. The successes in the design and application of new and improved numerical methods of the Godunov type for hyperbolic conservation laws in the last twenty years have made a dramatic impact in these application areas. The 97 papers cover a very wide range of topics, such as design and analysis of numerical schemes, applications to compressible and incompressible fluid dynamics, multi-phase flows, combustion problems, astrophysics, environmental fluid dynamics, and detonation waves. This book will be a reference book on the subject of numerical methods for hyperbolic partial differential equations for many years to come. All contributions are self-contained but do contain a review element. There is a key paper by Peter Sweby in which a general overview of Godunov methods is given. This contribution is particularly suitable for beginners on the subject. This book is unique: it contains virtually everything concerned with Godunov-type methods for conservation laws. As such it will be of particular interest to academics (applied mathematicians, numerical analysts, engineers, environmental scientists, physicists, and astrophysicists) involved in research on numerical methods for partial differential equations; scientists and engineers concerned with new numerical methods and applications to scientific and engineering problems e.g., mechanical engineers, aeronautical engineers, meteorologists; and academics involved in teaching numerical methods for partial differential equations at the postgraduate level.

This text aims to bridge the gap between non-mathematical popular treatments and the distinctly mathematical publications that non- mathematicians find so difficult to penetrate. The author provides understandable derivations or explanations of many key concepts, such as Kolmogrov-Sinai entropy, dimensions, Fourier analysis, and Lyapunov exponents. Only basic algebra, trigonometry, geometry and statistics are assumed as background. The author focuses on the most important topics, very much with the general scientist in mind.

This volume contains articles related to the work of the Simons Collaboration "Arithmetic Geometry, Number Theory, and Computation." The papers present mathematical results and algorithms necessary for the development of large-scale databases like the L-functions and Modular Forms Database (LMFDB). The authors aim to develop systematic tools for analyzing Diophantine properties of curves, surfaces, and abelian varieties over number fields and finite fields. The articles also explore examples important for future research. Specific topics include algebraic varieties over finite fields the Chabauty-Coleman method modular forms rational points on curves of small genus S-unit equations and integral points.

"Numerical Semigroups" is the first monograph devoted exclusively to the development of the theory of numerical semigroups. This concise, self-contained text is accessible to first year graduate students, giving the full background needed for readers unfamiliar with the topic. Researchers will find the tools presented useful in producing examples and counterexamples in other fields such as algebraic geometry, number theory, and linear programming.

"Introduction to Modern Number Theory" surveys from a unified point of view both the modern state and the trends of continuing development of various branches of number theory. Motivated by elementary problems, the central ideas of modern theories are exposed. Some topics covered include non-Abelian generalizations of class field theory, recursive computability and Diophantine equations, zeta- and L-functions.

This substantially revised and expanded new edition contains several new sections, such as Wiles' proof of Fermat's Last Theorem, and relevant techniques coming from a synthesis of various theories. Moreover, the authors have added a part dedicated to arithmetical cohomology and noncommutative geometry, a report on point counts on varieties with many rational points, the recent polynomial time algorithm for primality testing, and some others subjects.

From the reviews of the 2nd edition:

" For my part, I come to praise this fine volume. This book is a highly instructive read the quality, knowledge, and expertise of the authors shines through. The present volume is almost startlingly up-to-date ..." (A. van der Poorten, Gazette, Australian Math. Soc. 34 (1), 2007)"

This book explores various properties of quasimodular forms, especially their connections with Jacobi-like forms and automorphic pseudodifferential operators. The material that is essential to the subject is presented in sufficient detail, including necessary background on pseudodifferential operators, Lie algebras, etc., to make it accessible also to non-specialists. The book also covers a sufficiently broad range of illustrations of how the main themes of the book have occurred in various parts of mathematics to make it attractive to a wider audience. The book is intended for researchers and graduate students in number theory.

This book contains a complete detailed description of two classes of special numbers closely related to classical problems of the Theory of Primes. There is also extensive discussions of applied issues related to Cryptography.In Mathematics, a Mersenne number (named after Marin Mersenne, who studied them in the early 17-th century) is a number of the form Mn = 2n - 1 for positive integer n.In Mathematics, a Fermat number (named after Pierre de Fermat who first studied them) is a positive integer of the form Fn = 2k+ 1, k=2n, where n is a non-negative integer.Mersenne and Fermat numbers have many other interesting properties. Long and rich history, many arithmetic connections (with perfect numbers, with construction of regular polygons etc.), numerous modern applications, long list of open problems allow us to provide a broad perspective of the Theory of these two classes of special numbers, that can be useful and interesting for both professionals and the general audience.

This unique volume presents a fruitful and beautiful mathematical world hidden in Caianiello's neuronic equations, which describe the instantaneous behavior of a model of a brain or thinking machine. The detailed analysis from a viewpoint of "dynamical systems", even in a single neuron case, enables us to obtain amazingly good rational approximations to the Hecke-Mahler series with two variables. Some interesting numerical applications of our rational approximations are also discussed.This book is fundamentally self-contained and many topics required in it are explained from the beginning. Each chapter contains a number of instructive and mostly original exercises at various levels.

G. H. Hardy (1877-1947) ranks among the great mathematicians of the twentieth century. He did essential research in number theory and analysis, held professorships at Cambridge and Oxford, wrote important textbooks as well as the classic A Mathematician's Apology, and famously collaborated with J. E. Littlewood and Srinivasa Ramanujan. Hardy was a colorful character with remarkable expository skills. This book is a feast of G. H. Hardy's writing. There are selections of his mathematical papers, his book reviews, his tributes to departed colleagues. Some articles are serious, whereas others display a wry sense of humor. And there are recollections by those who knew Hardy, along with biographical and mathematical pieces written explicitly for this collection. Fans of Hardy should find much here to like. And for those unfamiliar with his work, The G. H. Hardy Reader provides an introduction to this extraordinary individual.

Gorenstein homological algebra is an important area of mathematics, with applications in commutative and noncommutative algebra, model category theory, representation theory, and algebraic geometry. While in classical homological algebra the existence of the projective, injective, and flat resolutions over arbitrary rings are well known, things are a little different when it comes to Gorenstein homological algebra. The main open problems in this area deal with the existence of the Gorenstein injective, Gorenstein projective, and Gorenstein flat resolutions. Gorenstein Homological Algebra is especially suitable for graduate students interested in homological algebra and its applications.

This is the second of a two-volume series on sampling theory. The mathematical foundations were laid in the first volume, and this book surveys the many applications of sampling theory both within mathematics and in other areas of science. Many of the topics covered here are not found in other books, and all are given an up to date treatment bringing the reader's knowledge up to research level. This book consists of ten chapters, written by ten different teams of authors, and the contents range over a wide variety of topics including combinatorial analysis, number theory, neural networks, derivative sampling, wavelets, stochastic signals, random fields, and abstract harmonic analysis. There is a comprehensive, up to date bibliography.

This book emphasizes the role of symmetry and presents as many viewpoints as possible of an important phenomenon - the functional equation of the associated zeta-function. It starts from the basics before warping into the space of new interest; from the ground state to the excited state. For example, the celebrated Gauss quadratic reciprocity law is proved in four independent ways, which are in some way or other dependent on the functional equation. The proofs rest on finite fields, representation theory of nilpotent groups, reciprocity law for the Dedekind sums, and the translation formula for the theta-series, respectively. Likewise, for example, the Euler function is treated in several different places.One of the important principles of learning is to work with the material many times. This book presents many worked-out examples and exercises to enhance the reader's comprehension on the topics covered in an in-depth manner. This is done in a different setting each time such that the reader will always be challenged. For the keen reader, even browsing the text alone, without solving the exercises, will yield some knowledge and enjoyment.

Computers have stretched the limits of what is possible in mathematics. More: they have given rise to new fields of mathematical study; the analysis of new and traditional algorithms, the creation of new paradigms for implementing computational methods, the viewing of old techniques from a concrete algorithmic vantage point, to name but a few. Computational Algebra and Number Theory lies at the lively intersection of computer science and mathematics. It highlights the surprising width and depth of the field through examples drawn from current activity, ranging from category theory, graph theory and combinatorics, to more classical computational areas, such as group theory and number theory. Many of the papers in the book provide a survey of their topic, as well as a description of present research. Throughout the variety of mathematical and computational fields represented, the emphasis is placed on the common principles and the methods employed. Audience: Students, experts, and those performing current research in any of the topics mentioned above.

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.

Foreword by Stephen L Adler (Institute for Advanced Study, USA) Illustrations by Peggy Adler The term Phyllotaxis refers to the patterns on plants formed by the arrangement of repeated biological units. In nearly all cases, the Fibonacci Numbers and the Golden Ratio occur in these arrangements. This topic has long fascinated scientists. Over a period of more than two decades, Irving Adler wrote a number of papers that construct a rigorously derived mathematical model for Phyllotaxis, which are major and enduring contributions to the field. These papers are collected in this reprint volume to enable their access to a wider readership.

From the reviews: "This is a very interesting book containing material for a comprehensive study of the cyclid homological theory of algebras, cyclic sets and S1-spaces. Lie algebras and algebraic K-theory and an introduction to Connes'work and recent results on the Novikov conjecture. The book requires a knowledge of homological algebra and Lie algebra theory as well as basic technics coming from algebraic topology. The bibliographic comments at the end of each chapter offer good suggestions for further reading and research. The book can be strongly recommended to anybody interested in noncommutative geometry, contemporary algebraic topology and related topics." European Mathematical Society Newsletter

In this second edition the authors have added a chapter 13 on MacLane (co)homology.