Amazon cover image
Image from Amazon.com
Image from Google Jackets

Number theory with computer applications.

By: Contributor(s): Material type: TextTextLanguage: English Publication details: Upper Saddle River, New Jersey Prentice Hall, Inc. 1998Description: xiii, 543 p. illISBN:
  • 013801812X (HB)
Subject(s):
Contents:
1. Introduction 2. Divisibility and Primes 3. Modular Arithmetic 4. Fundamental Theorems of Modular Arithmetic 5. Cryptography 6. Primality Testing and Factoring 7. Primitive Roots 8. Applications 9. Quadratic Congruences 10. Applications 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 A. Mathematical Induction B. Binomial Theorem C. Algorithmic Complexity and O-notation
Summary: Integrates computing algorithms into the number theory curriculum using a heuristic approach and an emphasis on proofs. This book considers the trends and topics, such as elliptic curves. It is appropriate for courses in Number Theory.
Item type: BOOKS
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Home library Call number Materials specified Status Date due Barcode
IMSc Library 511-37 KUM (Browse shelf(Opens below)) Available 35927

Includes index.

1. Introduction
2. Divisibility and Primes
3. Modular Arithmetic
4. Fundamental Theorems of Modular Arithmetic
5. Cryptography
6. Primality Testing and Factoring
7. Primitive Roots
8. Applications
9. Quadratic Congruences
10. Applications
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
A. Mathematical Induction
B. Binomial Theorem
C. Algorithmic Complexity and O-notation

Integrates computing algorithms into the number theory curriculum using a heuristic approach and an emphasis on proofs. This book considers the trends and topics, such as elliptic curves. It is appropriate for courses in Number Theory.

There are no comments on this title.

to post a comment.
The Institute of Mathematical Sciences, Chennai, India