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

Originally published in 1994, The Incommensurability Thesis is a critical study of the Incommensurability Thesis of Thomas Kuhn and Paul Feyerabend. The book examines the theory that different scientific theories may be incommensurable because of conceptual variance. The book presents a critique of the thesis and examines and discusses the arguments for the theory, acknowledging and debating the opposing views of other theorists. The book provides a comprehensive and detailed discussion of the incommensurability thesis.

Presents easy to understand proofs of some of the most difficult results about polynomials demonstrated by means of applications.

Based on talks from the 2015 and 2016 Combinatorial and Additive Number Theory (CANT) workshops at the City University of New York, these proceedings offer 19 peer-reviewed and edited papers on current topics in number theory. Held every year since 2003, the workshop series surveys state-of-the-art open problems in combinatorial and additive number theory and related parts of mathematics. Sumsets, partitions, convex polytopes and discrete geometry, Ramsey theory, primality testing, and cryptography are among the topics featured in this volume. Each contribution is dedicated to a specific topic that reflects the latest results by experts in the field. Researchers and graduate students interested in the current progress in number theory will find this selection of articles relevant and compelling.

Algebraic Operads: An Algorithmic Companion presents a systematic treatment of Groebner bases in several contexts. The book builds up to the theory of Groebner bases for operads due to the second author and Khoroshkin as well as various applications of the corresponding diamond lemmas in algebra. The authors present a variety of topics including: noncommutative Groebner bases and their applications to the construction of universal enveloping algebras; Groebner bases for shuffle algebras which can be used to solve questions about combinatorics of permutations; and operadic Groebner bases, important for applications to algebraic topology, and homological and homotopical algebra. The last chapters of the book combine classical commutative Groebner bases with operadic ones to approach some classification problems for operads. Throughout the book, both the mathematical theory and computational methods are emphasized and numerous algorithms, examples, and exercises are provided to clarify and illustrate the concrete meaning of abstract theory.

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.

A Classical Introduction to Cryptography: Applications for Communications Security introduces fundamentals of information and communication security by providing appropriate mathematical concepts to prove or break the security of cryptographic schemes.

This advanced-level textbook covers conventional cryptographic primitives and cryptanalysis of these primitives; basic algebra and number theory for cryptologists; public key cryptography and cryptanalysis of these schemes; and other cryptographic protocols, e.g. secret sharing, zero-knowledge proofs and undeniable signature schemes.

A Classical Introduction to Cryptography: Applications for Communications Security is designed for upper-level undergraduate and graduate-level students in computer science. This book is also suitable for researchers and practitioners in industry. A separate exercise/solution booklet is available as well, please go to www.springeronline.com under author: Vaudenay for additional details on how to purchase this booklet.

The book presents the theory of multiple trigonometric sums constructed by the authors. Following a unified approach, the authors obtain estimates for these sums similar to the classical I. M. VinogradovAs estimates and use them to solve several problems in analytic number theory. They investigate trigonometric integrals, which are often encountered in physics, mathematical statistics, and analysis, and in addition they present purely arithmetic results concerning the solvability of equations in integers.

The volume is devoted to the interaction of modern scientific computation and classical number theory. The contributions, ranging from effective finiteness results to efficient algorithms in elementary, analytical and algebraic number theory, provide a broad view of the methods and results encountered in the new and rapidly developing area of computational number theory. Topics covered include finite fields, quadratic forms, number fields, modular forms, elliptic curves and diophantine equations. In addition, two new number theoretical software packages, KANT and SIMATH, are described in detail with emphasis on algorithms in algebraic number theory.

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.

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.

The aim of the Expositions is to present new and important developments in pure and applied mathematics. Well established in the community over more than two decades, the series offers a large library of mathematical works, including several important classics. The volumes supply thorough and detailed expositions of the methods and ideas essential to the topics in question. In addition, they convey their relationships to other parts of mathematics. The series is addressed to advanced readers interested in a thorough study of the subject. Editorial Board Lev Birbrair, Universidade Federal do Ceara, Fortaleza, Brasil Walter D. Neumann, Columbia University, New York, USA Markus J. Pflaum, University of Colorado, Boulder, USA Dierk Schleicher, Jacobs University, Bremen, Germany Katrin Wendland, University of Freiburg, Germany Honorary Editor Victor P. Maslov, Russian Academy of Sciences, Moscow, Russia Titles in planning include Yuri A. Bahturin, Identical Relations in Lie Algebras (2019) Yakov G. Berkovich, Lev G. Kazarin, and Emmanuel M. Zhmud', Characters of Finite Groups, Volume 2 (2019) Jorge Herbert Soares de Lira, Variational Problems for Hypersurfaces in Riemannian Manifolds (2019) Volker Mayer, Mariusz Urbanski, and Anna Zdunik, Random and Conformal Dynamical Systems (2021) Ioannis Diamantis, Bostjan Gabrovsek, Sofia Lambropoulou, and Maciej Mroczkowski, Knot Theory of Lens Spaces (2021)

This problem-solving book is an introduction to the study of Diophantine equations, a class of equations in which only integer solutions are allowed. The presentation features some classical Diophantine equations, including linear, Pythagorean, and some higher degree equations, as well as exponential Diophantine equations. Many of the selected exercises and problems are original or are presented with original solutions. An Introduction to Diophantine Equations: A Problem-Based Approach is intended for undergraduates, advanced high school students and teachers, mathematical contest participants - including Olympiad and Putnam competitors - as well as readers interested in essential mathematics. The work uniquely presents unconventional and non-routine examples, ideas, and techniques.

Pencils of Cubics and Algebraic Curves in the Real Projective Plane thoroughly examines the combinatorial configurations of n generic points in RP(2). Especially how it is the data describing the mutual position of each point with respect to lines and conics passing through others. The first section in this book answers questions such as, can one count the combinatorial configurations up to the action of the symmetric group? How are they pairwise connected via almost generic configurations? These questions are addressed using rational cubics and pencils of cubics for n = 6 and 7. The book's second section deals with configurations of eight points in the convex position. Both the combinatorial configurations and combinatorial pencils are classified up to the action of the dihedral group D8. Finally, the third section contains plentiful applications and results around Hilbert's sixteenth problem. The author meticulously wrote this book based upon years of research devoted to the topic. The book is particularly useful for researchers and graduate students interested in topology, algebraic geometry and combinatorics. Features: Examines how the shape of pencils depends on the corresponding configurations of points Includes topology of real algebraic curves Contains numerous applications and results around Hilbert's sixteenth problem About the Author: Severine Fiedler-le Touze has published several papers on this topic and has been invited to present at many conferences. She holds a Ph.D. from University Rennes1 and was a post-doc at the Mathematical Sciences Research Institute in Berkeley, California.

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.

The aim of the book is to give a smooth analytic continuation from basic subjects including linear algebra, group theory, Hilbert space theory, etc. to number theory. With plenty of practical examples and worked-out exercises, and the scope ranging from these basic subjects made applicable to number-theoretic settings to advanced number theory, this book can then be read without tears. It will be of immense help to the reader to acquire basic sound skills in number theory and its applications.Number theory used to be described as the queen of mathematics, that is, there is no practical use. However, with the development of computers and the security of internet communications, the importance of number theory has been exponentially increasing daily. The raison d'etre of the present book in this situation is that it is extremely reader-friendly while keeping the rigor of serious mathematics and in-depth analysis of practical applications to various subjects including control theory and pseudo-random number generation. The use of operators is prevailing rather abundantly in anticipation of applications to electrical engineering, allowing the reader to master these skills without much difficulty. It also delivers a very smooth bridging between elementary subjects including linear algebra and group theory (and algebraic number theory) for the reader to be well-versed in an efficient and effortless way. One of the main features of the book is that it gives several different approaches to the same topic, helping the reader to gain deeper insight and comprehension. Even just browsing through the materials would be beneficial to the reader.

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 volume is the result of the author's many-years of research in this field. These results were presented in the author's two books, Introduction to the Algorithmic Measurement Theory (Moscow, Soviet Radio, 1977), and Codes of the Golden Proportion (Moscow, Radio and Communications, 1984), which had not been translated into English and are therefore not known to English-speaking audience. This volume sets forth new informational and arithmetical fundamentals of computer and measurement systems based on Fibonacci p-codes and codes of the golden p-proportions, and also on Bergman's system and 'golden' ternary mirror-symmetrical arithmetic. The book presents some new historical hypotheses concerning the origin of the Egyptian calendar and the Babylonian numeral system with base 60 (dodecahedral hypothesis), as well as about the origin of the Mayan's calendar and their numeral system with base 20 (icosahedral hypothesis). The book is intended for the college and university level. The book will also be of interest to all researchers, who use the golden ratio and Fibonacci numbers in their subject areas, and to all readers who are interested to the history of mathematics.

The Whole Truth About Whole Numbers is an introduction to the field of Number Theory for students in non-math and non-science majors who have studied at least two years of high school algebra. Rather than giving brief introductions to a wide variety of topics, this book provides an in-depth introduction to the field of Number Theory. The topics covered are many of those included in an introductory Number Theory course for mathematics majors, but the presentation is carefully tailored to meet the needs of elementary education, liberal arts, and other non-mathematical majors. The text covers logic and proofs, as well as major concepts in Number Theory, and contains an abundance of worked examples and exercises to both clearly illustrate concepts and evaluate the students' mastery of the material.

Based on the author's course for first-year graduate students this well-written text explains how the tools of algebraic geometry and of number theory can be applied to a study of curves. The book starts by introducing the essential background material and includes 600 exercises.

Paul Turan, one of the greatest Hungarian mathematicians, was born 100 years ago, on August 18, 1910. To celebrate this occasion the Hungarian Academy of Sciences, the Alfred Renyi Institute of Mathematics, the Janos Bolyai Mathematical Society and the Mathematical Institute of Eoetvoes Lorand University organized an international conference devoted to Paul Turan's main areas of interest: number theory, selected branches of analysis, and selected branches of combinatorics. The conference was held in Budapest, August 22-26, 2011. Some of the invited lectures reviewed different aspects of Paul Turan's work and influence. Most of the lectures allowed participants to report about their own work in the above mentioned areas of mathematics.