Number Theory with Computer Applications, 1st edition

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.___