This book explains clearly and in detail the basic concepts and methods of calculations of the elementary theory of numbers. It consists of 7 chapters illustrated by numerous examples and exercises. Answers together with some hints to the exercises are given at the end of the book. It may be used as a textbook for undergraduate students.

Since the publication of the first edition of this work, considerable progress has been made in many of the questions examined. This edition has been updated and enlarged, and the bibliography has been revised.The variety of topics covered here includes divisibility, diophantine equations, prime numbers (especially Mersenne and Fermat primes), the basic arithmetic functions, congruences, the quadratic reciprocity law, expansion of real numbers into decimal fractions, decomposition of integers into sums of powers, some other problems of the additive theory of numbers and the theory of Gaussian integers.

Written in a lively, engaging style by the author of popular mathematics books, this volume features nearly 1,000 imaginative exercises and problems. Some solutions included. 1978 edition.

This book is intended to serve as a one-semester introductory course in number theory. Throughout the book a historical perspective has been adopted and emphasis is given to some of the subject's applied aspects; in particular the field of cryptography is highlighted. At the heart of the book are the major number theoretic accomplishments of Euclid, Fermat, Gauss, Legendre, and Euler, and to fully illustrate the properties of numbers and concepts developed in the text, a wealth of exercises have been included. It is assumed that the reader will have 'pencil in hand' and ready access to a calculator or computer. For students new to number theory, whatever their background, this is a stimulating and entertaining introduction to the subject.

This second edition updates the well-regarded 2001 publication with new short sections on topics like Catalan numbers and their relationship to Pascal's triangle and Mersenne numbers, Pollard rho factorization method, Hoggatt-Hensell identity. Koshy has added a new chapter on continued fractions. The unique features of the first edition like news of recent discoveries, biographical sketches of mathematicians, and applications--like the use of congruence in scheduling of a round-robin tournament--are being refreshed with current information. More challenging exercises are included both in the textbook and in the instructor's manual. Elementary Number Theory with Applications 2e is ideally suited for undergraduate students and is especially appropriate for prospective and in-service math teachers at the high school and middle school levels. * Loaded with pedagogical features including fully worked examples, graded exercises, chapter summaries, and computer exercises * Covers crucial applications of theory like computer security, ISBNs, ZIP codes, and UPC bar codes * Biographical sketches lay out the history of mathematics, emphasizing its roots in India and the Middle East

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 textbook presents an elementary introduction to number theory and its different aspects: approximation of real numbers, irrationality and transcendence problems, continued fractions, diophantine equations, quadratic forms, arithmetical functions and algebraic number theory.These topics are covered in 12 chapters and more than 200 solved exercises.Clear, concise, and self-contained, this textbook may be used by undergraduate and graduate students, as well as highschool mathematics teachers. More generally, it will be suitable for all those who are interested in number theory, this fascinating branch of mathematics.

This book details the classical part of the theory of algebraic number theory, excluding class-field theory and its consequences. Coverage includes: ideal theory in rings of algebraic integers, p-adic fields and their finite extensions, ideles and adeles, zeta-functions, distribution of prime ideals, Abelian fields, the class-number of quadratic fields, and factorization problems. The book also features exercises and a list of open problems.

In this volume one finds basic techniques from algebra and number theory (e.g. congruences, unique factorization domains, finite fields, quadratic residues, primality tests, continued fractions, etc.) which in recent years have proven to be extremely useful for applications to cryptography and coding theory. Both cryptography and codes have crucial applications in our daily lives, and they are described here, while the complexity problems that arise in implementing the related numerical algorithms are also taken into due account. Cryptography has been developed in great detail, both in its classical and more recent aspects. In particular public key cryptography is extensively discussed, the use of algebraic geometry, specifically of elliptic curves over finite fields, is illustrated, and a final chapter is devoted to quantum cryptography, which is the new frontier of the field. Coding theory is not discussed in full; however a chapter, sufficient for a good introduction to the subject, has been devoted to linear codes. Each chapter ends with several complements and with an extensive list of exercises, the solutions to most of which are included in the last chapter. Though the book contains advanced material, such as cryptography on elliptic curves, Goppa codes using algebraic curves over finite fields, and the recent AKS polynomial primality test, the authors' objective has been to keep the exposition as self-contained and elementary as possible. Therefore the book will be useful to students and researchers, both in theoretical (e.g. mathematicians) and in applied sciences (e.g. physicists, engineers, computer scientists, etc.) seeking a friendly introduction to the important subjects treated here. The book will also be useful for teachers who intend to give courses on these topics.

A highly successful presentation of the fundamental concepts of number theory and computer programming Bridging an existing gap between mathematics and programming, Elementary Number Theory with Programming provides a unique introduction to elementary number theory with fundamental coverage of computer programming. Written by highly-qualified experts in the fields of computer science and mathematics, the book features accessible coverage for readers with various levels of experience and explores number theory in the context of programming without relying on advanced prerequisite knowledge and concepts in either area. Elementary Number Theory with Programming features comprehensive coverage of the methodology and applications of the most well-known theorems, problems, and concepts in number theory. Using standard mathematical applications within the programming field, the book presents modular arithmetic and prime decomposition, which are the basis of the public-private key system of cryptography. In addition, the book includes: Numerous examples, exercises, and research challenges in each chapter to encourage readers to work through the discussed concepts and ideas Select solutions to the chapter exercises in an appendix Plentiful sample computer programs to aid comprehension of the presented material for readers who have either never done any programming or need to improve their existing skill set A related website with links to select exercises An Instructor’s Solutions Manual available on a companion website Elementary Number Theory with Programming is a useful textbook for undergraduate and graduate-level students majoring in mathematics or computer science, as well as an excellent supplement for teachers and students who would like to better understand and appreciate number theory and computer programming. The book is also an ideal reference for computer scientists, programmers, and researchers interested in the mathematical applications of programming.