Atnaujinkite slapukų nuostatas

Modern Introduction To Classical Number Theory, A [Kietas viršelis]

(Zhejiang Univ, China)
  • Formatas: Hardback, 432 pages
  • Išleidimo metai: 10-Aug-2021
  • Leidėjas: World Scientific Publishing Co Pte Ltd
  • ISBN-10: 9811218293
  • ISBN-13: 9789811218293
Kitos knygos pagal šią temą:
  • Formatas: Hardback, 432 pages
  • Išleidimo metai: 10-Aug-2021
  • Leidėjas: World Scientific Publishing Co Pte Ltd
  • ISBN-10: 9811218293
  • ISBN-13: 9789811218293
Kitos knygos pagal šią temą:
"Natural numbers are the oldest human invention. This book describes their nature, laws, history and current status. It has seven chapters. The first five chapters contain not only the basics of elementary number theory for the convenience of teaching and continuity of reading, but also many latest research results. The first time in history, the traditional name of the Chinese Remainder Theorem is replaced with the Qin Jiushao Theorem in the book to give him a full credit for his establishment of this famous theorem in number theory. Chapter 6 is about the fascinating congruence modulo an integer power, and Chapter 7 introduces a new problem extracted by the author from the classical problems of number theory, which is out of the combination of additivenumber theory and multiplicative number theory. One feature of the book is the supplementary material after each section, there by broadening the reader's knowledge and imagination. These contents either discuss the rudiments of some aspects or introducenew problems or conjectures and their extensions, such as perfect number problem, Egyptian fraction problem, Goldbach's conjecture, the twin prime conjecture, the 3x + 1 problem, Hilbert Waring problem, Euler's conjecture, Fermat's Last Theorem, Laudau'sproblem and etc. This book is written for anyone who loves natural numbers, and it can also be read by mathematics majors, graduate students, and researchers. The book contains many illustrations and tables. Readers can appreciate the author's sensitivity of history, broad range of knowledge, and elegant writing style, while benefiting from the classical works and great achievements of masters in number theory"--
Preface vii
1 The Division Algorithm
1(56)
1 The Origin of Natural Numbers
1(10)
Perfect numbers and amicable numbers
7(4)
2 The Mystery of Natural Numbers
11(8)
Mosaic geometry and Euler's characteristic
17(2)
3 The Division Algorithm
19(14)
Mersenne primes and Fermat primes
26(7)
4 The Greatest Common Divisor
33(7)
Graham's conjecture
38(2)
5 The Fundamental Theorem of Arithmetic
40(17)
Hilbert's 8th problem
47(8)
Exercises 1
55(2)
2 The Concept of Congruence
57(46)
6 The Concept of Congruence
57(7)
Gauss's Disquisitiones Arithmeticae
61(3)
7 Residue Classes and Residue Systems
64(11)
Function [ x] and the 3x + 1 problem
69(6)
8 The Fermat-Euler Theorem
75(9)
The Euler number and the Euler prime
83(1)
9 The Fraction Expressed as Repeating Decimal
84(9)
Mobius' function
88(5)
10 Application in Cryptology
93(10)
The generalized Euler function
97(6)
3 Congruences
103(54)
11 Qin Jiushao's Theorem
103(11)
Fibonacci's rabbits
109(5)
12 Wilson's Theorem
114(12)
A theorem that Gauss did not prove
123(3)
13 Diophantine Equation
126(9)
The Pythagorean triple
132(3)
14 Lucas' Congruence
135(10)
Covering system
142(3)
15 The Truth of Primes
145(12)
The chain of primes or composite numbers
151(3)
Exercises 3
154(3)
4 Quadratic Residue
157(42)
16 Quadratic Congruences
157(8)
Integers in the Gaussian ring
161(4)
17 The Legendre Symbol
165(14)
Representing integers as the sum of squares
171(8)
18 The Law of Quadratic Reciprocity
179(5)
N-gonal number and Fermat
181(3)
19 The Jacobi symbol
184(7)
The Hadamard matrix and Hadamard conjecture
189(2)
20 Congruences Modulo a Composite
191(8)
Constructibility of the regular 17-gon
194(3)
Exercises 4
197(2)
5 Nth Power Residues
199(44)
21 Definition of Order
199(6)
Egyptian fraction
202(3)
22 The Existence of Primitive Roots
205(5)
Artin's conjecture
208(2)
23 The nth Power Residues
210(14)
Pell's equation
219(5)
24 The Case of Composite Modulus
224(6)
Diophantine arrays
227(3)
25 Dirichlet Character
230(13)
Three special exponent sums
235(5)
Exercises 5
240(3)
6 Congruence Modulo Integer Powers
243(60)
26 Bernoulli Number and Bernoulli Polynomial
243(9)
Rummer's congruence
248(4)
27 Wolstenholme Theorem
252(11)
Elliptic curve
257(6)
28 Lehmer's Congruence
263(15)
The abc conjecture
273(5)
29 Morley's Theorem and Jacobstahl's Theorem
278(14)
Automorphic form and modular form
288(4)
30 Congruence on Harmonic Sum
292(11)
Multinomial coefficient of non-power
297(6)
7 Additive and Multiplicative Equations
303(62)
31 New Waring's Problem
303(10)
32 New Fermat's Last Theorem
313(11)
33 Euler's Conjecture
324(8)
34 F-Perfect Number Problem
332(10)
35 New Congruent Number Problem
342(10)
36 The ABCD Equation
352(13)
Solutions to Exercises 365(24)
Appendix: The List of Prime Numbers Less Than 10000 389(4)
Bibliography 393(2)
Author Index 395