This valuable reference addresses the methods leading to contemporary developments in number theory and coding theory, originally presented as lectures at a summer school held at Bilkent University, Ankara, Turkey. With nearly 1500 references, equations, drawings, and tables, Number Theory and Its Applications especially benefits number theorists, coding theorists, algebraists, algebraic geometers, applied mathematicians, information theorists, and upper-level undergraduate and graduate students in these fields.

Linear algebra provides the essential mathematical tools to tackle all the problems in Science. Introduction to Linear Algebra is primarily aimed at students in applied fields (e.g. Computer Science and Engineering), providing them with a concrete, rigorous approach to face and solve various types of problems for the applications of their interest. This book offers a straightforward introduction to linear algebra that requires a minimal mathematical background to read and engage with. Features Presented in a brief, informative and engaging style Suitable for a wide broad range of undergraduates Contains many worked examples and exercises

This book is written for undergraduates who wish to learn some basic results in analytic number theory. It covers topics such as Bertrand's Postulate, the Prime Number Theorem and Dirichlet's Theorem of primes in arithmetic progression.

The materials in this book are based on A Hidebrand's 1991 lectures delivered at the University of Illinois at Urbana-Champaign and the author's course conducted at the National University of Singapore from 2001 to 2008.

Exploring one of the most dynamic areas of mathematics, Advanced Number Theory with Applications covers a wide range of algebraic, analytic, combinatorial, cryptographic, and geometric aspects of number theory. Written by a recognized leader in algebra and number theory, the book includes a page reference for every citing in the bibliography and more than 1,500 entries in the index so that students can easily cross-reference and find the appropriate data.

With numerous examples throughout, the text begins with coverage of algebraic number theory, binary quadratic forms, Diophantine approximation, arithmetic functions, p-adic analysis, Dirichlet characters, density, and primes in arithmetic progression. It then applies these tools to Diophantine equations, before developing elliptic curves and modular forms. The text also presents an overview of Fermat's Last Theorem (FLT) and numerous consequences of the ABC conjecture, including Thue-Siegel-Roth theorem, Hall's conjecture, the Erdos-Mollin--Walsh conjecture, and the Granville-Langevin Conjecture. In the appendix, the author reviews sieve methods, such as Eratothesenes', Selberg's, Linnik's, and Bombieri's sieves. He also discusses recent results on gaps between primes and the use of sieves in factoring.

By focusing on salient techniques in number theory, this textbook provides the most up-to-date and comprehensive material for a second course in this field. It prepares students for future study at the graduate level."

Number theory is an important research field of mathematics. In mathematical competitions, problems of elementary number theory occur frequently. These problems use little knowledge and have many variations. They are flexible and diverse. In this book, the author introduces some basic concepts and methods in elementary number theory via problems in mathematical competitions. Readers are encouraged to try to solve the problems by themselves before they read the given solutions of examples. Only in this way can they truly appreciate the tricks of problem-solving.

This is a first-ever textbook written in English about the theory of modular forms and Jacobi forms of several variables. It contains the classical theory as well as a new theory on Jacobi forms over Cayley numbers developed by the author from 1990 to 2000. Applications to the classical Euler sums are of special interest to those who are eager to evaluate double Euler sums or more general multiple zeta values. The celebrated sum formula proved by Granville in 1997 is generalized to a more general form here.

This book presents a graduate student-level introduction to the classical theory of modular forms and computations involving modular forms, including modular functions and the theory of Hecke operators. It also includes applications of modular forms to such diverse subjects as the theory of quadratic forms, the proof of Fermat's last theorem and the approximation of pi. It provides a balanced overview of both the theoretical and computational sides of the subject, allowing a variety of courses to be taught from it.

Bruhat-Tits theory that suffices for the main applications. Part III treats modern topics that have become important in current research. Part IV provides a few sample applications of the theory. The appendices contain further details on the topic of integral models.

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.

This book presents the Riemann Hypothesis, connected problems, and a taste of the body of theory developed towards its solution. It is targeted at the educated non-expert. Almost all the material is accessible to any senior mathematics student, and much is accessible to anyone with some university mathematics.

The appendices include a selection of original papers. This collection is not very large and encompasses only the most important milestones in the evolution of theory connected to the Riemann Hypothesis. The appendices also include some authoritative expository papers. These are the "expert witnesses whose insight into this field is both invaluable and irreplaceable.

This is a book about prime numbers, congruences, secret messages, and elliptic curves that you can read cover to cover. It grew out of undergr- uate courses that the author taught at Harvard, UC San Diego, and the University of Washington. The systematic study of number theory was initiated around 300B. C. when Euclid proved that there are in?nitely many prime numbers, and also cleverly deduced the fundamental theorem of arithmetic, which asserts that every positive integer factors uniquely as a product of primes. Over a thousand years later (around 972A. D. ) Arab mathematicians formulated the congruent number problem that asks for a way to decide whether or not a given positive integer n is the area of a right triangle, all three of whose sides are rational numbers. Then another thousand years later (in 1976), Di?e and Hellman introduced the ?rst ever public-key cryptosystem, which enabled two people to communicate secretely over a public communications channel with no predetermined secret; this invention and the ones that followed it revolutionized the world of digital communication. In the 1980s and 1990s, elliptic curves revolutionized number theory, providing striking new insights into the congruent number problem, primality testing, publ- key cryptography, attacks on public-key systems, and playing a central role in Andrew Wiles' resolution of Fermat's Last Theorem.

From the reviews: "The 2nd (slightly enlarged) edition of the van Lint's book is a short, concise, mathematically rigorous introduction to the subject. Basic notions and ideas are clearly presented from the mathematician's point of view and illustrated on various special classes of codes...This nice book is a must for every mathematician wishing to introduce himself to the algebraic theory of coding." European Mathematical Society Newsletter, 1993 "Despite the existence of so many other books on coding theory, this present volume will continue to hold its place as one of the standard texts...." The Mathematical Gazette, 1993

The book provides an introduction to modern abstract algebra and its applications. It covers all major topics of classical theory of numbers, groups, rings, fields and finite dimensional algebras. The book also provides interesting and important modern applications in such subjects as Cryptography, Coding Theory, Computer Science and Physics. In particular, it considers algorithm RSA, secret sharing algorithms, Diffie-Hellman Scheme and ElGamal cryptosystem based on discrete logarithm problem. It also presents Buchberger's algorithm which is one of the important algorithms for constructing Groebner basis. Key Features: Covers all major topics of classical theory of modern abstract algebra such as groups, rings and fields and their applications. In addition it provides the introduction to the number theory, theory of finite fields, finite dimensional algebras and their applications. Provides interesting and important modern applications in such subjects as Cryptography, Coding Theory, Computer Science and Physics. Presents numerous examples illustrating the theory and applications. It is also filled with a number of exercises of various difficulty. Describes in detail the construction of the Cayley-Dickson construction for finite dimensional algebras, in particular, algebras of quaternions and octonions and gives their applications in the number theory and computer graphics.

From Zero to Infinity is a combination of number lore, number history, and sparkling descriptions of the simply stated, but exceedingly difficult problems posed by the most ordinary numbers that first appeared in 1955, and has been kept in print continuously ever since. With the fifth edition, this classic has been updated to report on advances in number theory over the last 50 years, including the proof of Fermat's Last Theorem. Deceptively simple in style and structure, it is a book to which the reader will return again and again, gaining greater understanding and satisfaction with each reading.

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.

From Polynomials to Sums of Squares describes a journey through the foothills of algebra and number theory based around the central theme of factorization. The book begins by providing basic knowledge of rational polynomials, then gradually introduces other integral domains, and eventually arrives at sums of squares of integers. The text is complemented with illustrations that feature specific examples. Other than familiarity with complex numbers and some elementary number theory, very little mathematical prerequisites are needed. The accompanying disk enables readers to explore the subject further by removing the tedium of doing calculations by hand. Throughout the text there are practical activities involving the computer.

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.

Describes the development and extension of fundamental idea of Edouard Lucas, a French mathematician and mathematical recreationist, that is still used today in the verification of the largest primes.

This volume presents an exhaustive treatment of computation and algorithms for finite fields. Topics covered include polynomial factorization, finding irreducible and primitive polynomials, distribution of these primitive polynomials and of primitive points on elliptic curves, constructing bases of various types, and new applications of finite fields to other areas of mathematics. For completeness, also included are two special chapters on some recent advances and applications of the theory of congruences (optimal coefficients, congruential pseudo-random number generators, modular arithmetic etc.), and computational number theory (primality testing, factoring integers, computing in algebraic number theory, etc). The problems considered here have many applications in computer science, coding theory, cryptography, number theory and discrete mathematics. The level of discussion presupposes only a knowledge of the basic facts on finite fields, and the book can be recommended as supplementary graduate text. For researchers and students interested in computational and algorithmic problems in finite fields.

This book presents a collection of carefully refereed research articles and lecture notes stemming from the Conference "Automorphic Forms and L-Functions", held at the University of Heidelberg in 2016. The theory of automorphic forms and their associated L-functions is one of the central research areas in modern number theory, linking number theory, arithmetic geometry, representation theory, and complex analysis in many profound ways. The 19 papers cover a wide range of topics within the scope of the conference, including automorphic L-functions and their special values, p-adic modular forms, Eisenstein series, Borcherds products, automorphic periods, and many more.

Point-counting results for sets in real Euclidean space have found remarkable applications to diophantine geometry, enabling significant progress on the Andre-Oort and Zilber-Pink conjectures. The results combine ideas close to transcendence theory with the strong tameness properties of sets that are definable in an o-minimal structure, and thus the material treated connects ideas in model theory, transcendence theory, and arithmetic. This book describes the counting results and their applications along with their model-theoretic and transcendence connections. Core results are presented in detail to demonstrate the flexibility of the method, while wider developments are described in order to illustrate the breadth of the diophantine conjectures and to highlight key arithmetical ingredients. The underlying ideas are elementary and most of the book can be read with only a basic familiarity with number theory and complex algebraic geometry. It serves as an introduction for postgraduate students and researchers to the main ideas, results, problems, and themes of current research in this area.

A series of three symposia took place on the topic of trace formulas, each with an accompanying proceedings volume. The present volume is the third and final in this series and focuses on relative trace formulas in relation to special values of L-functions, integral representations, arithmetic cycles, theta correspondence and branching laws. The first volume focused on Arthur's trace formula, and the second volume focused on methods from algebraic geometry and representation theory. The three proceedings volumes have provided a snapshot of some of the current research, in the hope of stimulating further research on these topics. The collegial format of the symposia allowed a homogeneous set of experts to isolate key difficulties going forward and to collectively assess the feasibility of diverse approaches.

A selection of the most accessible survey papers from the Millennial Conference on Number Theory. Presented and compiled by a group of international experts, these papers provide a current view of the state of the art and an outlook into the future of number theory research. This book serves as an inspiration to graduate students and as a reference for research mathematicians.

This volume consists of the English translations of the letters exchanged between Emil Artin to Helmut Hasse written from 1921 until 1958. The letters are accompanied by extensive comments explaining the mathematical background and giving the information needed for understanding these letters. Most letters deal with class field theory and shed a light on the birth of one of its most profound results: Artin's reciprocity law.