Elementary Methods in Number TheorySpringer Science & Business Media, 2000 - 513 páginas Elementary Methods in Number Theory begins with "a first course in number theory" for students with no previous knowledge of the subject. The main topics are divisibility, prime numbers, and congruences. There is also an introduction to Fourier analysis on finite abelian groups, and a discussion on the abc conjecture and its consequences in elementary number theory. In the second and third parts of the book, deep results in number theory are proved using only elementary methods. Part II is about multiplicative number theory, and includes two of the most famous results in mathematics: the Erdös-Selberg elementary proof of the prime number theorem, and Dirichlets theorem on primes in arithmetic progressions. Part III is an introduction to three classical topics in additive number theory: Warings problems for polynomials, Liouvilles method to determine the number of representations of an integer as the sum of an even number of squares, and the asymptotics of partition functions. Melvyn B. Nathanson is Professor of Mathematics at the City University of New York (Lehman College and the Graduate Center). He is the author of the two other graduate texts: Additive Number Theory: The Classical Bases and Additive Number Theory: Inverse Problems and the Geometry of Sumsets. |
Contenido
Divisibility and Primes | 3 |
Primitive Roots and Quadratic Reciprocity 83 | 82 |
Fourier Analysis on Finite Abelian Groups | 121 |
4 | 122 |
The abc Conjecture | 171 |
Divisors and Primes in Multiplicative Number | 198 |
Divisor Functions 231 | 230 |
5 | 242 |
45 | 325 |
Warings Problem | 355 |
Sums of Sequences of Polynomials | 375 |
3 | 394 |
Liouvilles Identity 401 | 400 |
Sums of an Even Number of Squares | 423 |
4 | 426 |
Partition Asymptotics | 455 |
6 | 248 |
Prime Numbers | 267 |
Notes | 287 |
The Prime Number Theorem | 289 |
An Inverse Theorem for Partitions | 475 |
References 497 | 496 |
509 | |
Otras ediciones - Ver todas
Términos y frases comunes
abc conjecture arithmetic function asymptotic density completes the proof Compute congruence classes denote the number Dirichlet character Dirichlet character modulo distinct primes divides divisible divisor function element elementary proof Erdős Exercise exists an integer finite abelian group follows formula Fourier group of order Hint homomorphism ideal induction inequality infinitely many primes integer-valued polynomial L²(G leading coefficient Lemma Let f(x Let G lim sup log q log² multiplicative character nonnegative integers number of solutions number theory obtain odd prime PA(n partition polynomial of degree prime number theorem prime positive integers prime powers primitive root modulo Prove quadratic residue quadratic residue modulo real numbers relatively prime relatively prime positive ring sequence set of integers squares subset sufficiently large sumset unique Waring's problem weighted set Wieferich primes Z/mZ Σ Σ ΣΣ