Elementary Number Theory and Its ApplicationsNew edition of a standard text. Integrates classical material with applications to cryptography and computer science. The author is with AT&T Bell Labs. Annotation copyright Book News, Inc. Portland, Or. |
Contents
Chapter | 1 |
Basic properties | 9 |
Mathematical induction | 15 |
Copyright | |
18 other sections not shown
Other editions - View all
Common terms and phrases
a₁ arithmetic base b expansion bit operations C₁ Chinese remainder theorem cipher system ciphertext computation program Computations and Explorations Computer Projects Programming conjecture continued fraction expansion Corollary decimal digits deciphering diophantine equation divides division algorithm enciphering Euclidean algorithm Euler pseudoprime Fermat numbers Fermat's little theorem following computations following theorem greatest common divisor Hence incongruent solutions infinitely inverse least positive residue Lemma linear congruences m₁ mathematical induction mathematician Mersenne method multiplicative nonnegative integer notation number theory obtain odd prime P₁ pairs primality test prime divisor prime factorization prime-power factorization primitive root modulo Programming Projects Write Projects Programming Projects Projects Write programs Proof prove pseudo-random numbers Pythagorean triple quadratic irrational quadratic nonresidue quadratic residue r₁ rational number real number relatively prime residues modulo Section sequence Show simple continued fraction strong pseudoprime Suppose x₁