This preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full DocumentThis preview has intentionally blurred sections. Sign up to view the full version.
View Full Document
Unformatted text preview: Examples Mersenne primes have the form Greatest Common Divisor (GCD) Definition : Example Definition : Least Common Multiple (LCM) Example: Example: Theorem 5 . Let a and b be positive integers. Then ab = gcd(a,b)*lcm(a,b). Euclidean Algorithm Proof of Euclidean Algorithm Theorem 6 Lemma 3 Section 4.3, Problem 15' . Find all primes <= 30. Problem 15 . Find all positive integers that are < 30 and relatively prime to 30....
View
Full Document
 Fall '11
 Boppana
 Prime number, Greatest common divisor, Fundamental theorem of arithmetic

Click to edit the document details