Items related to A Course in Computational Number Theory (Textbooks...

A Course in Computational Number Theory (Textbooks in Mathematical Sciences) - Hardcover

 
9780387988870: A Course in Computational Number Theory (Textbooks in Mathematical Sciences)

This specific ISBN edition is currently not available.

Synopsis

Combining the talents of two experienced authors, this book presents modern number theory in the context of modern computation, with the use of Mathematica. Emphasis is placed on the algorithmic aspects throughout, and Mathematica notebooks are available on a dedicated website, along with computer exercises and displayed computations. In addition to its modern treatment, the book also includes extensive coverage of the relevant traditional number theory as well.

"synopsis" may belong to another edition of this title.

Review

"The book presents the standard curriculum of a first course in number theory: the fundamental theorem of arithmetic, congruences, Fermat's theorem and Euler's generalization, primitive roots, facts about the distribution of primes, quadratic residues, Pell's equation and sums of squares. The proofs are constructive and the emphasis is on computing. Algorithms are given for GCD, solving linear congruences, factoring, primality testing, finding large primes, evaluating Jacobi symbols, computing square roots modulo a prime, finding continued fractions of quadratic irrationals, solving Pell's equation and expressing an integer as the sum of two squares. The diverse applications include repeating decimals, the RSA cipher, digital signatures, the Yao millionaire problem, check digits, the cattle problem of Archimedes and the crystal structure of salt. There is an excellent survey of many (probable) prime tests with Lucas sequences. The computer algebra system Mathematica is used throughout the book and summarized in an appendix. On nearly every page, Mathematica instructions illustrate algorithms and provide examples. An accompanying CD-ROM holds a rich assortment of Mathematica programs from the text. Three color plates display the power residues modulo small primes and the Gaussian primes reachable from $1+i$ in steps of bounded length."--MATHEMATICAL REVIEWS

"About this title" may belong to another edition of this title.

(No Available Copies)

Search Books:



Create a Want

Can't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!

Create a Want

Other Popular Editions of the Same Title

9781930190108: A Course in Computational Number Theory (Textbooks in Mathematical Sciences)

Featured Edition

ISBN 10:  1930190107 ISBN 13:  9781930190108
Publisher: Key College, 2000
Hardcover