This basic introduction to number theory is ideal for those with no previous knowledge of the subject. The main topics of divisibility, congruences, and the distribution of prime numbers are covered. Of particular interest is the inclusion of a proof for one of the most famous results in mathematics, the prime number theorem. With many examples and exercises, and only requiring knowledge of a little calculus and algebra, this book will suit individuals with imagination and interest in following a mathematical argument to its conclusion.

This collection consists of papers delivered at an international conference by the most eminent specialists in the domains of number theory, algebra, and analysis. The papers are devoted to actual problems in these domains of mathematics. In addition, short communications presented by participants in the conference are included.

Through its engaging and unusual problems, this book demonstrates methods of reasoning necessary for learning number theory. Every technique is followed by problems (as well as detailed hints and solutions) that apply theorems immediately, so readers can solve a variety of abstract problems in a systematic, creative manner. New solutions often require the ingenious use of earlier mathematical concepts - not the memorization of formulas and facts. Questions also often permit experimental numeric validation or visual interpretation to encourage the combined use of deductive and intuitive thinking. The first chapter starts with simple topics like even and odd numbers, divisibility, and prime numbers and helps the reader to solve quite complex, Olympiad-type problems right away. It also covers properties of the perfect, amicable, and figurate numbers and introduces congruence. The next chapter begins with the Euclidean algorithm, explores the representations of integer numbers in different bases, and examines continued fractions, quadratic irrationalities, and the Lagrange Theorem. The last section of Chapter Two is an exploration of different methods of proofs. The third chapter is dedicated to solving Diophantine linear and nonlinear equations and includes different methods of solving Fermat’s (Pell’s) equations. It also covers Fermat’s factorization techniques and methods of solving challenging problems involving exponent and factorials. Chapter Four reviews the Pythagorean triple and quadruple and emphasizes their connection with geometry, trigonometry, algebraic geometry, and stereographic projection. A special case of Waring’s problem as a representation of a number by the sum of the squares or cubes of other numbers is covered, as well as quadratic residuals, Legendre and Jacobi symbols, and interesting word problems related to the properties of numbers. Appendices provide a historic overview of number theory and its main developments from the ancient cultures in Greece, Babylon, and Egypt to the modern day. Drawing from cases collected by an accomplished female mathematician, Methods in Solving Number Theory Problems is designed as a self-study guide or supplementary textbook for a one-semester course in introductory number theory. It can also be used to prepare for mathematical Olympiads. Elementary algebra, arithmetic and some calculus knowledge are the only prerequisites. Number theory gives precise proofs and theorems of an irreproachable rigor and sharpens analytical thinking, which makes this book perfect for anyone looking to build their mathematical confidence.

This basic introduction to number theory is ideal for those with no previous knowledge of the subject. The main topics of divisibility, congruences, and the distribution of prime numbers are covered. Of particular interest is the inclusion of a proof for one of the most famous results in mathematics, the prime number theorem. With many examples and exercises, and only requiring knowledge of a little calculus and algebra, this book will suit individuals with imagination and interest in following a mathematical argument to its conclusion.

Elementary Number Theory, Seventh Edition, is written for the one-semester undergraduate number theory course taken by math majors, secondary education majors, and computer science students. This contemporary text provides a simple account of classical number theory, set against a historical background that shows the subject's evolution from antiquity to recent research. Written in David Burton’s engaging style, Elementary Number Theory reveals the attraction that has drawn leading mathematicians and amateurs alike to number theory over the course of history.

Eduard Wirsing was an outstanding number theorist. In his research he made significant contributions to various subfields of number theory and also collaborated with other eminent scientists (e.g., with the Fields Medalist Alan Baker as well as Don Zagier). This commemorative volume includes numerous papers on current research in number theory by well-known experts, as well as some personal recollections by companions of Wirsing. The topics covered in this volume include arithmetical functions, continued fractions, elementary proofs of the prime number theorem, friable integers, the Goldbach problem, Dirichlet series, Euler products, and more. There is something for every interested reader.

This book provides an introduction and overview of number theory based on the distribution and properties of primes. This unique approach provides both a firm background in the standard material as well as an overview of the whole discipline. All the essential topics are covered: fundamental theorem of arithmetic, theory of congruences, quadratic reciprocity, arithmetic functions, and the distribution of primes. Analytic number theory and algebraic number theory both receive a solid introductory treatment. The book’s user-friendly style, historical context, and wide range of exercises make it ideal for self study and classroom use.

This book is intended to provide graduate students and researchers in graph theory with an overview of the elementary methods of graph Ramsey theory. It is especially targeted towards graduate students in extremal graph theory, graph Ramsey theory, and related fields, as the included contents allow the text to be used in seminars. It is structured in thirteen chapters which are application-focused and largely independent, enabling readers to target specific topics and information to focus their study. The first chapter includes a true beginner’s overview of elementary examples in graph Ramsey theory mainly using combinatorial methods. The following chapters progress through topics including the probabilistic methods, algebraic construction, regularity method, but that's not all. Many related interesting topics are also included in this book, such as the disproof for a conjecture of Borsuk on geometry, intersecting hypergraphs, Turán numbers and communication channels, etc.

Quadratic Number Theory is an introduction to algebraic number theory for readers with a moderate knowledge of elementary number theory and some familiarity with the terminology of abstract algebra. By restricting attention to questions about squares the author achieves the dual goals of making the presentation accessible to undergraduates and reflecting the historical roots of the subject. The representation of integers by quadratic forms is emphasized throughout the text. Lehman introduces an innovative notation for ideals of a quadratic domain that greatly facilitates computation and he uses this to particular effect. The text has an unusual focus on actual computation. This focus, and this notation, serve the author's historical purpose as well; ideals can be seen as number-like objects, as Kummer and Dedekind conceived of them. The notation can be adapted to quadratic forms and provides insight into the connection between quadratic forms and ideals. The computation of class groups and continued fraction representations are featured—the author's notation makes these computations particularly illuminating. Quadratic Number Theory, with its exceptionally clear prose, hundreds of exercises, and historical motivation, would make an excellent textbook for a second undergraduate course in number theory. The clarity of the exposition would also make it a terrific choice for independent reading. It will be exceptionally useful as a fruitful launching pad for undergraduate research projects in algebraic number theory.

At first glance the prime numbers appear to be distributed in a very irregular way amongst the integers, but it is possible to produce a simple formula that tells us (in an approximate but well defined sense) how many primes we can expect to find that are less than any integer we might choose. The prime number theorem tells us what this formula is and it is indisputably one of the great classical theorems of mathematics. This textbook gives an introduction to the prime number theorem suitable for advanced undergraduates and beginning graduate students. The author's aim is to show the reader how the tools of analysis can be used in number theory to attack a 'real' problem, and it is based on his own experiences of teaching this material.