Online Library TheLib.net » Elementary Methods in Number Theory
cover of the book Elementary Methods in Number Theory

Ebook: Elementary Methods in Number Theory

00
27.01.2024
0
0

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.




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.


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.
Content:
Front Matter....Pages i-xviii
Front Matter....Pages 1-1
Divisibility and Primes....Pages 3-43
Congruences....Pages 45-81
Primitive Roots and Quadratic Reciprocity....Pages 83-120
Fourier Analysis on Finite Abelian Groups....Pages 121-169
The abc Conjecture....Pages 171-197
Front Matter....Pages 199-199
Arithmetic Functions....Pages 201-229
Divisor Functions....Pages 231-266
Prime Numbers....Pages 267-288
The Prime Number Theorem....Pages 289-323
Primes in Arithmetic Progressions....Pages 325-351
Front Matter....Pages 353-353
Waring’s Problem....Pages 355-374
Sums of Sequences of Polynomials....Pages 375-399
Liouville’s Identity....Pages 401-421
Sums of an Even Number of Squares....Pages 423-454
Partition Asymptotics....Pages 455-474
An Inverse Theorem for Partitions....Pages 475-495
Back Matter....Pages 497-516


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.
Content:
Front Matter....Pages i-xviii
Front Matter....Pages 1-1
Divisibility and Primes....Pages 3-43
Congruences....Pages 45-81
Primitive Roots and Quadratic Reciprocity....Pages 83-120
Fourier Analysis on Finite Abelian Groups....Pages 121-169
The abc Conjecture....Pages 171-197
Front Matter....Pages 199-199
Arithmetic Functions....Pages 201-229
Divisor Functions....Pages 231-266
Prime Numbers....Pages 267-288
The Prime Number Theorem....Pages 289-323
Primes in Arithmetic Progressions....Pages 325-351
Front Matter....Pages 353-353
Waring’s Problem....Pages 355-374
Sums of Sequences of Polynomials....Pages 375-399
Liouville’s Identity....Pages 401-421
Sums of an Even Number of Squares....Pages 423-454
Partition Asymptotics....Pages 455-474
An Inverse Theorem for Partitions....Pages 475-495
Back Matter....Pages 497-516
....
Download the book Elementary Methods in Number Theory for free or read online
Read Download
Continue reading on any device:
QR code
Last viewed books
Related books
Comments (0)
reload, if the code cannot be seen