Addison-Wesley / Prentice Hall

Mathematics

Browse available resources for Mathematics:



Number Theory with Computer Applications
Ramanujachary Kumanduri, Columbia University
Christina Romero

ISBN-10: 013801812X
ISBN-13: 9780138018122

Publisher: Prentice Hall
Copyright: 1998
Format: Paper; 543 pp
Published: 08/04/1997

Suggested retail price: $73.33
Buy from myPearsonStore

Appropriate for most courses in Number Theory.

This book effectively integrates computing algorithms into the number theory curriculum using a heuristic approach and strong emphasis on 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 due to its use in the proof of Fermat's Last Theorem.

  • Offers a wealth of platform-independent computer activities (stressing the fundamental algorithms), allowing students to discover interesting properties of integers and work toward proving these properties. Pg.___
  • Discusses applications to cryptography in detail, examining all of the commonly used public-key cryptographic methods. Pg.___
  • Provides a clear presentation of primality testing and factoring, guiding students through numerous extended examples. Pg.___
  • Includes coverage of advanced topics not treated in most other texts, such as binary quadratic forms and elliptic curves. Pg.___
  • Encourages cooperative learning through over 50 group projects. Pg.___
  • Features over 500 worked examples, over 1,000 exercises—many of which are computer projects—and over 50 extended end-of-chapter exercises which are suitable for group projects. Pg.___
  • Web site offering instruction in Maple and Mathematica for the text computer projects. Pg.___



 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.


Appendix A: Mathematical Induction.


Appendix B: Binomial Theorem.


Appendix C: Algorithmic Complexity and O-notation.


Answers and Hints.


Index of Notation.


Index.

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students, contact your Pearson Higher Education representative for pricing and ordering information.

Pearson Higher Education offers special pricing when you choose to package your text with other student resources. If you're interested in creating a cost-saving package for your students contact your Pearson Higher Education representative.


Copyright ©2008 Pearson Education. All rights reserved. Legal Notice | Privacy Policy | Permissions