An Introduction to the Theory of NumbersAn Introduction to the Theory of Numbers by G.H. Hardy and E. M. Wright is found on the reading list of virtually all elementary number theory courses and is widely regarded as the primary and classic text in elementary number theory. Developed under the guidance of D.R. Heath-Brown this Sixth Edition of An Introduction to the Theory of Numbers has been extensively revised and updated to guide today's students through the key milestones and developments in number theory. Updates include a chapter by J.H. Silverman on one of the most important developments in number theory — modular elliptic curves and their role in the proof of Fermat's Last Theorem — a foreword by A. Wiles, and comprehensively updated end-of-chapter notes detailing the key developments in number theory. Suggestions for further reading are also included for the more avid reader The text retains the style and clarity of previous editions making it highly suitable for undergraduates in mathematics from the first year upwards as well as an essential reference for all number theorists. |
Other editions - View all
An Introduction to the Theory of Numbers G. H. Hardy,E. M. Wright,Joseph Silverman Limited preview - 2008 |
An Introduction to the Theory of Numbers G. H. Hardy,E. M. Wright,Joseph Silverman No preview available - 2008 |
An Introduction to the Theory of Numbers Godfrey H. Hardy,Edward M. Wright No preview available - 2008 |
Common terms and phrases
a₁ absolutely convergent algebraic number algorithm an+1 argument arithmetic chapter coefficients common divisor congruence conjecture continued fraction convergent coordinates coprime D. H. Lehmer decimal defined digits divides divisible divisor elliptic curve equation equivalent Euclid's Euclidean example Fermat's Fermat's last theorem finite follows formula function fundamental theorem Gaussian integers given infinitely infinity integral quaternions interval irrational Journal London Math Kronecker's theorem Landau lattice point loglog logx Mersenne prime modulus multiple number of primes number theory obtain odd prime p₁ partitions polynomial positive integers prime factors prime number Prime Number Theorem problem Proc proof of Theorem properties prove Theorem quadratic residue rational integers rational numbers representable result roots satisfies sequence simple solutions square suppose theory of numbers true unity values write