A Course in Computational Number Theory: Essential Tool for Motivation and Explanation.DUBLIN, Ireland -- Research and Markets (http://www.researchandmarkets.com/research/03ac21/a_course_in_comput) has announced the addition of John Wiley John Wiley may refer to:
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 A primality test is an algorithm for determining whether an input number is prime. It is important to note the difference between primality testing and integer factorization. , the RSA (1) (Rural Service Area) See MSA. (2) (Rivest-Shamir-Adleman) A highly secure cryptography method by RSA Security, Inc., Bedford, MA (www.rsa.com), a division of EMC Corporation since 2006. It uses a two-part key. public-key cryptosystem, and unusual applications such as check digit A numeric digit used to ensure that account numbers are entered accurately into the computer. Using a formula, a digit is calculated from each new account number, which is then made part of that number, either at the end, the beginning or somewhere in the middle of the number. schemes and a computation of the energy that holds a salt crystal together. Advanced topics include continued fractions, Pells equation, and the Gaussian primes. The CD-ROM CD-ROM: see compact disc. CD-ROM in full compact disc read-only memory Type of computer storage medium that is read optically (e.g., by a laser). contains a Mathematica package that has hundreds of functions that show step-by-step operation of famous algorithms. (The user must have Mathematica in order to use this package.) Also included is an auxiliary package that contains a database of all 53,000 integers below 10^16 that are 2- and 3-strong pseudoprimes. Users will also have access to an online guide that gives illustrative examples of each function. Key Topics Covered: Preface v Notation Chapter 1 Fundamentals Chapter 2 Congruences, Equations, and Powers Using the Pseudoprime Test Chapter 3 Euler's Function Chapter 4 Prime Numbers Chapter 5 Some Applications Chapter 6 Quadratic Residues Chapter 7 Continuec Faction Chapter 8 Prime Testing with Lucas Sequences Chapter 9 Prime Imaginaries and Imaginary Primes For more information visit http://www.researchandmarkets.com/research/03ac21/a_course_in_comput |
|
||||||||||||||
Printer friendly
Cite/link
Email
Feedback
Reader Opinion