Elementary Number Theory, Sixth Edition, blends classical theory with modern applications and is notable for its outstanding exercise sets. A full range of exercises, from basic to challenging, helps students explore key concepts and push their understanding to new heights. Computational exercises and computer projects are also available. Reflecting many years of professor feedback, this edition offers new examples, exercises, and applications, while incorporating advancements and discoveries in number theory made in the past few years.

1. The Integers.

Numbers and Sequences.

Sums and Products.

Mathematical Induction.

The Fibonacci Numbers.

Divisibility

2. Integer Representations and Operations.

Representations of Integers.

Computer Operations with Integers.

Complexity of Integer Operations.

3. Primes and Greatest Common Divisors.

Prime Numbers.

The Distribution of Primes.

Greatest Common Divisors and their Properties

The Euclidean Algorithm.

The Fundemental Theorem of Arithmetic.

Factorization Methods and Fermat Numbers.

Linear Diophantine Equations.

4. Congruences.

Introduction to Congruences.

Linear Congrences.

The Chinese Remainder Theorem.

Solving Polynomial Congruences.

Systems of Linear Congruences.

Factoring Using the Pollard Rho Method.

5. Applications of Congruences.

Divisibility Tests.

The perpetual Calendar.

Round-Robin Tournaments.

Hashing Functions.

Check Digits.

6. Some Special Congruences.

Wilson's Theorem and Fermat's Little Theorem.

Pseudoprimes.

Euler's Theorem.

7. Multiplicative Functions.

The Euler Phi-Function.

The Sum and Number of Divisors.

Perfect Numbers and Mersenne Primes.

Mobius Inversion.

Partitions.

8. Cryptology.

Character Ciphers.

Block and Stream Ciphers.

Exponentiation Ciphers.

Public Key Cryptography

Knapsack Ciphers.

Cryptographic Protocols and Applications.

9. Primitive Roots.

The Order of an Integer and Primitive Roots.

Primitive Roots for Primes.

The Existence of Primitive Roots.

Discrete Logarithms and Index Arithmetic

Primality Tests Using Orders of Integers and Primitive Roots

Universal Exponents

10. Applications of Primitive Roots and the Order of an Integer.

Pseudorandom Numbers.

The EIGamal Cryptosystem.

An Application to the Splicing of Telephone Cables.

11. Quadratic Residues.

Quadratic Residues and nonresidues.

The Law of Quadratic Reciprocity.

The Jacobi Symbol.

Euler Pseudoprimes.

Zero-Knowledge Proofs.

12. Decimal Fractions and Continued.

Decimal Fractions.

Finite Continued Fractions.

Infinite Continued Fractions.

Periodic Continued Fractions.

Factoring Using Continued Fractions.

13. Some Nonlinear Diophantine Equations.

Pythagorean Triples.

Fermat's Last Theorem.

Sums of Squares.

Pell's Equation.

Congruent Numbers.

14. The Gaussian Integers.

Gaussian Integers and Gaussian Primes.

Greatest Common Divisors and Unique Factorization.

Gaussian Integers and Sums of Squares.

Answers to Odd-Numbered Exercises.

Bibliography

Kenneth H. Rosen 

Kenneth H. Rosen received his BS in mathematics from the University of Michigan―Ann Arbor (1972) and his PhD in mathematics from MIT (1976). Before joining Bell Laboratories in 1982, he held positions at the University of Colorado―Boulder, The Ohio State University―Columbus, and the University of Maine―Orono, where he was an associate professor of mathematics. While working at AT&T Laboratories, he taught at Monmouth University, teaching courses in discrete mathematics, coding theory, and data security. Dr. Rosen has published numerous articles in professional journals in the areas of number theory and mathematical modeling. He is the author of Elementary Number Theory, 6/e, and other books.

배송정보

교환/반품 정보