A COURSE IN COMPUTATIONAL NUMBER THEORY (CD-Rom Included)

David Bressoud - Stan Wagon

ISBN 10: 1930190107 / ISBN 13: 9781930190108

Published by Key College Publishing / Springer, United States of America, 1999

About this Item

Illustrated Editorial Cardboard. Contents: Preface - Notation - Fundamentals - Congruences, Equations, and Powers - Eider's fi Function - Prime Numbers - Some Applications - Quadratic Residues - Continued Fractions - Testing with Lucas Sequences - Prime Imaginarias and Imaginary Primes - Mathematics Basics - Lucas Certificates Exist - References - Index of Mathematics Objects - Subject Index. 368págs with a CD-Rom Size: 24x18,5cm.

Seller Inventory # 0032197

Bibliographic Details

• Title: A COURSE IN COMPUTATIONAL NUMBER THEORY (CD-Rom Included)
• Publisher: Key College Publishing / Springer, United States of America
• Publication Date: 1999
• Language: English
• ISBN 10: 1930190107
• ISBN 13: 9781930190108
• Binding: Hard cover
• Condition: GOOD
• Seller catalogs:
  • Informática

About this title

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.

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