Course Computational Number Theory by Bressoud David (16 results)

Hardcover. Condition: Good.

Har/Cdr. 367 p. Unread book. Like new. --- Ungelesenes Buch in neuwertigem Zustand. 9781930190108 Sprache: Englisch Gewicht in Gramm: 985 Hardcover: 17.8 x 2.5 x 22.9 cm.

Hardcover. Ex-library with stamp and library-signature. GOOD condition, some traces of use. Ancien Exemplaire de bibliothèque avec signature et cachet. BON état, quelques traces d'usure. Ehem. Bibliotheksexemplar mit Signatur und Stempel. GUTER Zustand, ein paar Gebrauchsspuren. 11 BRE 9781930190108 Sprache: Englisch Gewicht in Gramm: 1150.

Hard cover. Condition: GOOD. 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.

Hardcover. Condition: Very good. Hardcover Octavo. illustrated boards, 367 pp.

Hardcover. Condition: Good. 1. It's a preowned item in good condition and includes all the pages. It may have some general signs of wear and tear, such as markings, highlighting, slight damage to the cover, minimal wear to the binding, etc., but they will not affect the overall reading experience.

Hardcover. Condition: new. Hardcover. 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, Pells equation, and the Gaussian primes. 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. Shipping may be from multiple locations in the US or from the UK, depending on stock availability.

HRD. Condition: New. New Book. Shipped from UK. Established seller since 2000.

Hardback. Condition: New. 1st. 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.

Condition: New. 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. Num Pages: 384 pages. BIC Classification: PBH. Category: (P) Professional & Vocational. Dimension: 239 x 188 x 26. Weight in Grams: 846. . 2008. 1st Edition. Hardcover. . . . .

Hardcover. Condition: new. Hardcover. 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, Pells equation, and the Gaussian primes. 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. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability.

Hardcover. Condition: Brand New. 1st edition. 384 pages. 9.29x7.64x1.10 inches. In Stock.

Hardback. Condition: New. New copy - Usually dispatched within 4 working days.

Hardback. Condition: New. 1st. 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.

Condition: New. 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. Num Pages: 384 pages. BIC Classification: PBH. Category: (P) Professional & Vocational. Dimension: 239 x 188 x 26. Weight in Grams: 846. . 2008. 1st Edition. Hardcover. . . . . Books ship from the US and Ireland.

Hardcover. Condition: new. Hardcover. 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, Pells equation, and the Gaussian primes. 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. Shipping may be from our Sydney, NSW warehouse or from our UK or US warehouse, depending on stock availability.