A Friendly Introduction to Number Theory, 3/e (IE-Paperback)
Joseph H. Silverman
- 出版商: Prentice Hall
- 出版日期: 2005-03-31
- 售價: $700
- 貴賓價: 9.8 折 $686
- 語言: 英文
- 頁數: 448
- 裝訂: Hardcover
- ISBN: 0131861379
- ISBN-13: 9780131861374
已過版
買這商品的人也買了...
-
$280$99 -
$880$880 -
$970Introduction to Algorithms, 2/e
-
$600$600 -
$1,127Field and Wave Electromagnetics, 2/e (Paperback)
-
$550$435 -
$774Design and Validation of Computer Protocols (Paperback)
-
$600$199 -
$490$382 -
$1,127Introductory Statistics, 2/e
-
$880$695 -
$480$408 -
$2,660Thinking in Java, 4/e (Paperback)
-
$400$360 -
$680$666 -
$980$774 -
$1,080CMMI: Guidelines for Process Integration and Product Improvement, 2/e
-
$1,200$948 -
$480$432 -
$580$551 -
$600$480 -
$1,200$1,020 -
$520$468 -
$650$507 -
$580$493
相關主題
商品描述
Description
For courses in Elementary Number Theory for math majors, for mathematics education students, and for Computer Science students.
This introductory undergraduate text is designed to entice a wide variety of majors into learning some mathematics, while teaching them to think mathematically at the same time. Starting with nothing more than basic high school algebra, the reader is gradually led from basic algebra to the point of actively performing mathematical research while getting a glimpse of current mathematical frontiers. The writing style is informal and includes many numerical examples, which are analyzed for patterns and used to make conjectures. Emphasis is on the methods used for proving theorems rather than on specific results.
Table of Contents
1. What Is Number Theory?
2. Pythagorean Triples
3. Pythagorean Triples and the Unit Circle
4. Sums of Higher Powers and Fermat’s Last Theorem
5. Divisibility and the Greatest Common Divisor
6. Linear Equations and the Greatest Common Divisor
7. Factorization and the Fundamental Theorem of Arithmetic
8. Congruences
9. Congruences, Powers, and Fermat’s Little Theorem
10. Congruences, Powers, and Euler’s Formula
11. Euler’s Phi Function and the Chinese Remainder Theorem
12. Prime Numbers
13. Counting Primes
14. Mersenne Primes
15. Mersenne Primes and Perfect Numbers8
16. Powers Modulo m and Successive Squaring
17. Computing kth Roots Modulo m
18. Powers, Roots, and “Unbreakable” Codes
19. Primality Testing and Carmichael Numbers
20. Euler’s Phi Function and Sums of Divisors
21. Powers Modulo p and Primitive Roots
22. Primitive Roots and Indices
23. Squares Modulo p
24. Is —1 a Square Modulo p? Is 2?
25. Quadratic Reciprocity
26. Which Primes Are Sums of Two Squares?
27. Which Numbers Are Sums of Two Squares?
28. The Equation X4 + Y 4 = Z4
29. Square-Triangular Numbers Revisited
30. Pell’s Equation
31. Diophantine Approximation
32. Diophantine Approximation and Pell’s Equation
33. Number Theory and Imaginary Numbers
34. The Gaussian Integers and Unique Factorization
35. Irrational Numbers and Transcendental Numbers
36. Binomial Coefficients and Pascal’s Triangle
37. Fibonacci’s Rabbits and Linear Recurrence Sequences
38. Oh, What a Beautiful Function
39. The Topsy-Turvy World of Continued Fractions
40. Continued Fractions, Square Roots and Pell’s Equation
41. Generating Functions
42. Sums of Powers
43. Cubic Curves and Elliptic Curves
44. Elliptic Curves with Few Rational Points
45. Points on Elliptic Curves Modulo p
46. Torsion Collections Modulo p and Bad Primes
47. Defect Bounds and Modularity Patterns
48. Elliptic Curves and Fermat’s Last Theorem
Further Reading
A. Factorization of Small Composite Integers
B. A List of Primes