Number Theory with Computer Applications / Edition 1 available in Paperback
- Pub. Date:
This book effectively integrates computing concepts into the number theory curriculum using a heuristic approach and strong emphasis on rigorous proofs. Its in-depth coverage of modern applications considers the latest trends and topics, such as elliptic curves—a subject that has seen a rise in popularity in the undergraduate curriculum.
Table of Contents
2. Divisibility and Primes.
3. Modular Arithmetic.
4. Fundamental Theorems of Modular Arithmetic.
6. Primality Testing and Factoring.
7. Primitive Roots.
9. Quadratic Congruences.
11. Continued Fractions.
12. Factoring Methods.
13. Diophantine Approximations.
14. Diophantine Equations.
15. Arithmetical Functions and Dirichlet Series.
16. Distribution of Primes.
17. Quadratic Reciprocity Law
18. Binary Quadratic Forms.
19. Elliptic Curves.
Appendix A: Mathematical Induction.
Appendix B: Binomial Theorem.
Appendix C: Algorithmic Complexity and O-notation.
Answers and Hints.
Index of Notation.