Document Type
|
:
|
BL
|
Record Number
|
:
|
850309
|
Main Entry
|
:
|
Campbell, Duff,1959-
|
Title & Author
|
:
|
An open door to number theory /\ Duff Campbell.
|
Publication Statement
|
:
|
Providence, Rhode Island :: MAA Press, an imprint of the American Mathematical Society,, [2018]
|
Series Statement
|
:
|
AMS/MAA textbooks ;; vol. 39
|
Page. NO
|
:
|
1 online resource
|
ISBN
|
:
|
1470446847
|
|
:
|
: 9781470446840
|
|
:
|
1470443481
|
|
:
|
9781470443481
|
Bibliographies/Indexes
|
:
|
Includes bibliographical references and index.
|
Contents
|
:
|
Cover; Title page; 1. The Integers, \Z; 1. Number systems; 2. Rings and fields; 3. Some fundamental facts about \Z and \N; 4. Proofs by induction; 5. The binomial theorem; 6. The fundamental theorem of arithmetic (foreshadowing); 7. Divisibility; 8. Greatest common divisors; 9. The Euclidean algorithm; 10. The amazing array; 11. Convergents; 12. The amazing super-array; 13. The modified division algorithm; 14. Why does the amazing array work?; 15. Primes; 16. The proof of the fundamental theorem of arithmetic; 17. Unique factorization in other rings; 2. Modular Arithmetic in \Z/ \Z.
|
|
:
|
18. The integers mod , \Z/ \Z19. Congruences; 20. Units and zero-divisors in \Z/ \Z; 21. Cancellation law in \Z/ \Z; 22. Solving linear equations in \Z/ \Z; 23. Solving polynomial equations in \Z/ \Z; 24. Solving systems of linear equations in \Z/ \Z; 25. Lifting roots in \Z/ ⁿ\Z; 26. Wilson's theorem and its converse; 27. Calculating ( ); 28. Euler's and Fermat's theorems; 29. The order of an integer modulo; 30. Divisibility tests; 3. Quadratic Extensions of the Integers, \Z[√ ]; 31. Divisibility in \Z[ ]; 32. The Euclidean algorithm in \Z[ ]
|
|
:
|
33. Unique factorization in \Z[ ]34. The structure of \Z[√2]; 35. The Euclidean algorithm in \Z[√ ]; 36. Factoring in \Z[ ]; 37. The primes in \Z[ ]; 4. An Interlude of Analytic Number Theory; 38. The distribution of primes in \Z; 5. Quadratic Residues; 39. Perfect squares; 40. Quadratic residues; 41. Calculating the Legendre symbol (hard way); 42. The arithmetic of \Z[√-2] and the Legendre symbol \Leg{-2}; 43. Gauss's lemma; 44. Calculating the Legendre symbol (easier way); 45. The arithmetic of \Z[√-3]; 46. The arithmetic of \Z[ ]; 47. Calculating the Legendre symbol (easiest way)
|
|
:
|
48. The Jacobi symbol6. Further Topics; 49. When \Z/ \Z has a primitive root; 50. Minkowski's theorem (geometry in the aid of algebra); Appendix A. Tables; Appendix B. Projects; Bibliography; Index; Back Cover.
|
Abstract
|
:
|
A well-written, inviting textbook designed for a one-semester, junior-level course in elementary number theory. The intended audience will have had exposure to proof writing, but not necessarily to abstract algebra. That audience will be well prepared by this text for a second-semester course focusing on algebraic number theory. The approach throughout is geometric and intuitive; there are over 400 carefully designed exercises, which include a balance of calculations, conjectures, and proofs. There are also nine substantial student projects on topics not usually covered in a first-semester cou.
|
Subject
|
:
|
Number theory, Textbooks.
|
Subject
|
:
|
MATHEMATICS-- Algebra-- Intermediate.
|
Subject
|
:
|
Number theory-- Elementary number theory-- Congruences; primitive roots; residue systems.
|
Subject
|
:
|
Number theory-- Elementary number theory-- Continued fractions.
|
Subject
|
:
|
Number theory-- Elementary number theory-- Factorization; primality.
|
Subject
|
:
|
Number theory-- Elementary number theory-- Multiplicative structure; Euclidean algorithm; greatest common divisors.
|
Subject
|
:
|
Number theory-- Elementary number theory-- Power residues, reciprocity.
|
Subject
|
:
|
Number theory-- Elementary number theory-- Primes.
|
Subject
|
:
|
Number theory-- Instructional exposition (textbooks, tutorial papers, etc.)
|
Subject
|
:
|
Number theory.
|
Dewey Classification
|
:
|
512.72
|
LC Classification
|
:
|
QA241
|
NLM classification
|
:
|
11-0111A0511A0711A1511A4111A5111A55msc
|