Elementary Number Theory and Its Applications
New 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.
61 pages matching Computer Projects Programming in this book
Results 1-3 of 61
What people are saying - Write a review
We haven't found any reviews in the usual places.
Greatest Common Divisors and Prime Factorization
10 other sections not shown
Other editions - View all
arithmetic base b expansion bit operations Carmichael number check digit Chinese remainder theorem cipher system ciphertext composite computation program Computations and Explorations Computer Projects Programming conjecture continued fraction expansion Corollary decimal digits deciphering divides division algorithm Euclidean algorithm Euler pseudoprime Fermat numbers Fermat's little theorem Fibonacci numbers following computations following integers following theorem greatest common divisor Hence incongruent solutions infinitely integer relatively prime inverse least positive residue Lemma linear congruences mathematical induction mathematician matrix Mersenne method modp multiplicative nonnegative integer notation number theory obtain odd prime pairs perfect square 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 quotient rational number real number relatively prime residues modulo RSA cipher Section sequence Show simple continued fraction strong pseudoprime Suppose