𝔖 Scriptorium
✦   LIBER   ✦

πŸ“

A Course in Computational Number Theory

✍ Scribed by David Bressoud, Stan Wagon


Publisher
Wiley
Year
2008
Tongue
English
Leaves
383
Series
Key Curriculum Press
Edition
1
Category
Library

⬇  Acquire This Volume

No coin nor oath required. For personal study only.

✦ Synopsis


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.
<br /&gt

✦ Subjects


ΠœΠ°Ρ‚Π΅ΠΌΠ°Ρ‚ΠΈΠΊΠ°;ВСория чисСл;


πŸ“œ SIMILAR VOLUMES


A Course in Computational Number Theory
✍ David Bressoud, Stan Wagon πŸ“‚ Library πŸ“… 2008 πŸ› Wiley 🌐 English

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 wor

A Course in Computational Number Theory
✍ David Bressoud, Stan Wagon πŸ“‚ Library πŸ“… 2008 πŸ› Wiley 🌐 English

<i>A Course in Computational Number Theory</i> 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

A Course in Computational Algebraic Numb
✍ Henri Cohen πŸ“‚ Library πŸ“… 1996 πŸ› Springer Berlin Heidelberg 🌐 English

A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number

A course in computational algebraic numb
✍ Henri Cohen πŸ“‚ Library πŸ“… 1993 πŸ› Springer 🌐 English

A description of 148 algorithms fundamental to number-theoretic computations, in particular for computations related to algebraic number theory, elliptic curves, primality testing and factoring. The first seven chapters guide readers to the heart of current research in computational algebraic number