A Course in Computational Number Theory uses the computer as a tool for motivation and explanation. The book is designed for the reader to quickly access a computer and begin doing personal experiments with the patterns of the integers. It presents and explains many of the fastest algorithms for working with integers. Traditional topics are covered, but the text also explores factoring algorithms, primality testing, the RSA public-key cryptosystem, and unusual applications such as check digit schemes and a computation of the energy that holds a salt crystal together. Advanced topics include continued fractions, Pell's equation, and the Gaussian primes.
"Sinopsis" puede pertenecer a otra edición de este libro.
"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
"Sobre este título" puede pertenecer a otra edición de este libro.
Descripción Wiley, 2008. Hardcover. Estado de conservación: Brand New. 1st edition. 384 pages. 9.29x7.64x1.10 inches. In Stock. Nº de ref. de la librería zk0470412151
Descripción Wiley, 2008. Hardcover. Estado de conservación: New. Never used!. Nº de ref. de la librería P110470412151
Descripción Wiley, 2008. Hardcover. Estado de conservación: New. book. Nº de ref. de la librería M0470412151