1 page matching layers in this book
Results 1-1 of 1
What people are saying - Write a review
We haven't found any reviews in the usual places.
Greatest Common Divisors and Prime Factorization
11 other sections not shown
Other editions - View all
arithmetic base b expansion binary bit operations Carmichael number Chinese remainder theorem cipher system ciphertext ciphertext block Computer Projects Write conclude congruence x2 Consequently continued fraction expansion convergent Corollary decimal expansion deciphering divides division algorithm Euclidean algorithm Euler pseudoprime exponent Fermat numbers Fermat■s little theorem following theorem formula function greatest common divisor Hence incongruent solutions infinitely integer relatively prime inverse irrational number Jacobi symbol knapsack problem least positive residue Legendre symbols Lemma linear congruences mathematical induction mathematician Miller■s test modp modular exponentiation multiplicative nonnegative integers notation number theory obtain odd prime perfect number perfect square plaintext block positive integers less primality test prime divisor prime factorization prime-power factorization primitive root modulo Projects Write programs Proof prove Pythagorean triple quadratic irrational quadratic residue quotient rational number real number relatively prime residues modulo RSA cipher Section sequence Show simple continued fraction strong pseudoprime