|
|
Mathematics 2006 - Number Theory
|
Jeffrey Stopple, University of California, Santa Barbara
This undergraduate-level introduction describes those mathematical properties of prime numbers that can be deduced with the tools of calculus. Jeffrey Stopple pays special attention to the rich history of the subject and ancient questions on polygonal numbers, perfect numbers and amicable pairs, as well as to the important open problems. The culmination of the book is a brief presentation of the Riemann zeta function, which determines the distribution of prime numbers, and of the significance of the Riemann Hypothesis.
Request Examination Copy | Learn more... |
|
Peter J. Giblin, University of Liverpool
Peter Giblin describes, in the context of an introduction to the theory of numbers, some of the more elementary methods for factorization and primality testing; that is, methods independent of a knowledge of other areas of mathematics. Indeed everything is developed from scratch so the mathematical prerequisites are minimal. An essential feature of the book is the large number of computer programs (written in Pascal) and a wealth of computational exercises and projects, in addition to more usual theory exercises. The theoretical development includes continued fractions and quadratic residues, directed always towards the two fundamental problems of primality testing and factorization. There is time, all the same, to include a number of topics and projects of a purely "recreational" nature.
Request Examination Copy | Learn more... |
|
Saban Alaca, Carleton University, Ottawa
Kenneth S. Williams, Carleton University, Ottawa
Suitable for senior undergraduates and beginning graduate students in mathematics, this book is an introduction to algebraic number theory at an elementary level. Prerequisites are kept to a minimum, and numerous examples illustrating the material occur throughout the text. References to suggested readings and to the biographies of mathematicians who have contributed to the development of algebraic number theory are provided at the end of each chapter. Other features include over 320 exercises, an extensive index, and helpful location guides to theorems in the text.
Request Examination Copy | Learn more... |
|
R. P. Burn
Number theory is concerned with the properties of the natural numbers: 1,2,3,.... During the seventeenth and eighteenth centuries, number theory became established through the work of Fermat, Euler and Gauss. With the hand calculators and computers of today, the results of extensive numerical work are instantly available and mathematicians may traverse the road leading to their discoveries with comparative ease. Now in its second edition, this book consists of a sequence of exercises that will lead readers from quite simple number work to the point where they can prove algebraically the classical results of elementary number theory for themselves. A modern high school course in mathematics is sufficient background for the whole book which, as a whole, is designed to be used as an undergraduate course in number theory to be pursued by independent study without supporting lectures.
Request Examination Copy | Learn more... |
|
James J. Tattersall, Providence College, Rhode Island
Intended to serve as a one-semester introductory course in number theory, this second edition has been revised throughout. 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. In addition, a wealth of new exercises have been included to fully illustrate the properties of numbers and concepts developed in the text. The book will serve as a stimulating introduction for students new to number theory, regardless of their background.
Request Examination Copy | Learn more... |
|
Victor Shoup, New York University
Number theory and algebra play an increasingly significant role in computing and communications, as evidenced by the striking applications of these subjects to such fields as cryptography and coding theory. This introductory book emphasises algorithms and applications, such as cryptography and error correcting codes, and is accessible to a broad audience. The mathematical prerequisites are minimal: nothing beyond material in a typical undergraduate course in calculus is presumed, other than some experience in doing proofs - everything else is developed from scratch. Thus the book can serve several purposes. It can be used as a reference and for self-study by readers who want to learn the mathematical foundations of modern cryptography. It is also ideal as a textbook for introductory courses in number theory and algebra, especially those geared towards computer science students.
Request Examination Copy | Learn more... |
|
