Quiz 1 Lemmas/Theorems Flashcards
2-out-of-3 Lemma
Let a,b,c,d ∈Z, such that a + b = c. If d divides any two of a,b,c, it also divides the 3rd
First important Lemma about GCD
For any integer a, GCD(a,0) = |a|
Second important Lemma about GCD
For any integers a,b,q,r ∈Z satisfying a = qb + r, GCD(a,b) = GCD(b,r)
Euclid’s Lemma
Let a,b,c ∈Z be such that GCD(a,b) = 1. If a|bc then a|c
Theorem about LDE
Let ax + by = c be a LDE, Then either:
1) GCD(a,b) does not divide c and it has no solutions
2) If GCD(a,b)|c, then it has infinitely many solutions. They are given by the equations used in solving for Diophantine Equations
Prime Factorization Lemma
Every integer n >= 2 is divisible by a prime
Prime Factorization Corr.
Every integer n >= 2 can be written as a product of primes
Euclids Lemma for Primes
If p is a prime and a,b ∈Z such that p|ab then either p|a or p|b
Uniqueness of prime factorization Theorem
Let n∈Z, n >= 2. Let n = p1 x p2 … x pk be a prime factorization of n. Then this factorization is unique up to ordering of the primes
Lemma about LCM
LCM(a,b) = 2^max(e2, f2) x 3^max(e3, f3)
Corr. about LCM
LCM(a,b) x GCD(a,b) = ab
Multiplicative Functions
An arithmetic function, f, is said to be multiplicative if, for any a,b ∈Z+ such that GCD(a,b) = 1, f(a,b) = f(a)f(b) and f(1)=1
Theorem about coprime positive integers
Let a,b be co-rime positive integers. If u|a and v|b, then uv|ab.
Corr. about sigma(n)
sigma(n) is multiplicative