BN.com Gift Guide

Course in Computational Number Theory / With CD / Edition 1

Hardcover (Print)
Buy New
Buy New from BN.com
$113.37
Used and New from Other Sellers
Used and New from Other Sellers
from $81.52
Usually ships in 1-2 business days
(Save 37%)
Other sellers (Hardcover)
  • All (4) from $81.52   
  • New (3) from $81.52   
  • Used (1) from $114.84   

More About This Textbook

Overview

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.
Read More Show Less

Product Details

  • ISBN-13: 9780470412152
  • Publisher: Wiley
  • Publication date: 5/28/2000
  • Series: Key Curriculum Press Series
  • Edition description: New Edition
  • Edition number: 1
  • Pages: 384
  • Product dimensions: 7.26 (w) x 9.39 (h) x 0.99 (d)

Table of Contents

Preface.

Notation.

Chapter 1 Fundamentals.
1.0 Introduction.
1.1 A Famous Sequence of Numbers.
1.2 The Euclidean ALgorithm.
The Oldest Algorithm.
Reversing the Euclidean Algorithm.
The Extended GCD Algorithm.
The Fundamental Theorem of Arithmetic.
Two Applications.
1.3 Modular Arithmetic.
1.4 Fast Powers.
A Fast Alforithm for ExponentiationPowers of Matrices, Big-O Notation.

Chapter 2 Congruences, Equations, and Powers.
2.0 Introduction.
2.1 Solving Linear Congruences.
Linear Diophantine Equations in Two Variables.
The Conductor.
An Importatnt Quadratic Congruence.
2.2 The Chinese Remainder Theorem.
2.3 PowerMod Patterns.
Fermat's Little Theorem.
More Patterns in Powers.
2.4 Pseudoprimes.
Using the Pseudoprime Test.

Chapter 3 Euler's Function.
3.0 Introduction.
3.1 Euler's Function.
3.2 Perfect Numbers and Their Relatives.
The Sum of Divisors Function.
Perfect Numbers.
Amicalbe, Abundant, and Deficient Numbers.
3.3 Euler's Theorem.
3.4 Primitive Roots for Primes.
The order of an Integer.
Primes Have PRimitive roots.
Repeating Decimals.
3.5 Primitive Roots for COmposites.
3.6 The Universal Exponent.
Universal Exponents.
Power Towers.
The Form of Carmichael Numbers.

Chapter 4 Prime Numbers.
4.0 Introduction.
4.1 The Number of Primes.
We'll Never Run Out of Primes.
The Sieve of Eratosthenes.
Chebyshev's Theorem and Bertrand's Postulate.
4.2 Prime Testing and Certification.
Strong Pseudoprimes.
Industrial-Grade Primes.
Prime Certification Via Primitive Roots.
An Improvement.
Pratt Certificates.
4.3 Refinements and Other Directions.
Other PRimality Tests.
Strong Liars are Scarce.
Finding the nth Prime.
4.4 A Doszen Prime Mysteries.

Chapter 5 Some Applications.
5.0 Introduction.
5.1 Coding Secrets.
Tossing a Coin into a Well.
The RSA Cryptosystem.
Digital Signatures.
5.2 The Yao Millionaire Problem.
5.3 Check Digits.
Basic Check Digit Schemes.
A Perfect Check Digit Method.
Beyond Perfection: Correcting Errors.
5.4 Factoring Algorithms.
Trial Division.
Fermat's Algorithm.
Pollard Rho.
Pollard p-1.
The Current Scene.

Chapter 6 Quadratic Residues.
6.0 Introduction.
6.1 Pepin's Test.
Quadratic Residues.
Pepin's Test.
Primes Congruent to 1 (Mod.
6.2 Proof of Quadratic Reciprocity.
Gauss's Lemma.
Proof of Quadratic Recipocity.
Jacobi's Extension.
An Application to Factoring.
6.3 Quadratic Equations.

Chapter 7 Continuec Faction.
7.0 Introduction.
7.1 FInite COntinued Fractions.
7.2 Infinite Continued Fractions.
7.3 Periodic Continued Fractions.
7.4 Pell's Equation.
7.5 Archimedes and the Sun God's Cattle.
Wurm's Version: Using Rectangular Bulls.
The Real Cattle Problem.
7.6 Factoring via Continued Fractions.

Chapter 8 Prime Testing with Lucas Sequences.
8.0 Introduction.
8.1 Divisibility Properties of Lucas Sequencese.
8.2 Prime Tests Using Lucas Sequencesse.
Lucas Certification.
The Lucas-Lehmer Algorithm Explained.
Luca Pseudoprimes.
Strong Quadratic Pseudoprimes.
Primality Testing's Holy Grail.

Chapter 9 Prime Imaginaries and Imaginary Primes.
9.0 Introduction.
9.1 Sums of Two Squares.
9.2 The Gaussian Intergers.
Complex Number Theory.
Gaussian Primes.
The Moat Problem.
The Gaussian Zoo.
9.3 Higher Reciprocity  325.

Appendix A. Maathematica Basics.
1.0 Introduction.
A.1 Plotting.
A.2 Typesetting.
Sending Files By E-Mail.
A.3 Types of Functions.
A.4 Lists.
A.5 Programs.
A.6 Solving Equations.
A.7 Symbolic Algebra.

Appendix B Lucas Certificates Exist.

References.

Index of Mathematica Objects.

Subject Index.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)