A Friendly Introduction to Number Theory, 4e
A friendly introduction to number theory, 4th edition is designed to introduce students to the overall themes and methodology of Mathematics through the detailed study of one particular facet–number theory. Starting with nothing more than basic high school Algebra, students are gradually led to the point of actively performing mathematical research while getting a glimpse of current mathematical frontiers. The writing is appropriate for the undergraduate audience and includes many numerical examples, which are analysed for patterns and used to make conjectures. Emphasis is on the methods used for proving theorems rather than on specific results.
Table of Contents:
- Chapter 1: What is number theory?
- Chapter 2: Pythagorean triples
- Chapter 3: Pythagorean triples and the Unit circle
- Chapter 4: sums of higher powers and fermat’s last theorem
- Chapter 5: Divisibility and the greatest common divisor
- Chapter 6: Linear Equations and the greatest common divisor
- Chapter 7: factorization and the fundamental theorem of Arithmetic
- Chapter 8: congruences
- Chapter 9: congruences, powers, and fermat’s little theorem
- Chapter 10: congruences, powers, and euler’s formula
- Chapter 11: euler’s Phi function and the Chinese Remainder theorem
- Chapter 12: prime numbers
- Chapter 13: counting primes
- Chapter 14: Mersenne primes
- Chapter 15: Mersenne primes and perfect numbers
- Chapter 16: powers modulo M and successive Squaring
- Chapter 17: computing kth roots modulo M
- Chapter 18: powers, roots, and “unbreakable” codes
- Chapter 19: primality testing and Carmichael numbers
- Chapter 20: squares modulo
- Chapter 21: is -1 a Square modulo ?
- Chapter 22: Quadratic Reciprocity
- Chapter 23: proof of Quadratic Reciprocity
- Chapter 24: which primes are sums of two squares?
- Chapter 25: which numbers are sums of two squares?
- Chapter 26: as easy as one, two, three
- Chapter 27: euler’s Phi function and sums of divisors
- Chapter 28: powers modulo br And primitive roots
- Chapter 29: primitive roots and Indices
- Chapter 30: The equation X4 + Y4 = Z4
- Chapter 31: square–triangular numbers Revisited
- Chapter 32: pell’s equation
- Chapter 33: diophantine approximation
- Chapter 34: diophantine approximation and pell’s equation
- Chapter 35: Number theory and imaginary numbers
- Chapter 36: The Gaussian Integers and unique factorization
- Chapter 37: irrational numbers and transcendental numbers
- Chapter 38: Binomial coefficients and pascal’s triangle
- Chapter 39: fibonacci’s rabbits and linear recurrence sequences
- Chapter 40: Oh, what a beautiful function
- Chapter 41: cubic curves and Elliptic curves
- Chapter 42: Elliptic curves with few rational points
- Chapter 43: points on Elliptic curves modulo
- Chapter 44: torsion collections modulo br And bad primes
- Chapter 45: defect bounds and modularity patterns
- Chapter 46: Elliptic curves and fermat’s last theorem
- Chapter 47: The topsy-turvey world of continued Fractions [online]
- Chapter 48: continued Fractions, Square Roots, and pell’s equation [online]
- Chapter 49: generating functions [online]
- Chapter 50: sums of powers [online].
| Book | |
|---|---|
| Author | Silverman |
| Pages | 424 |
| Year | 2019 |
| ISBN | 9789353433079 |
| Publisher | Pearson |
| Language | English |
| Uncategorized | |
| Edition | 4/e |
| Weight | 1 kg |
| Dimensions | 20.3 x 25.4 x 4.7 cm |
| Binding | Paperback |