Number Theory Definitions Flashcards
Definition of Prime
a positive integer p is prime iff the only positive integers dividing p are 1 and p.
Definition of Composite
a positive integer n is composite iff there exist integers a,b with 1 < a, b < n such that n = ab
gcd(a, b)
gcd(a,b) = d such that d is the largest possible integer such that d|a and d|b.
lcm(a, b)
lcm(a,b) = l such that l is the smallest possible integer such that a|l and b|l.
gcd(a, b) (prime factorization)
p1^min(e_1a, e_1b) * p2^min(e_2a, e_2b) * …
lcm(a, b) (prime factorization)
p1 ^ max(e_1a, e_1b) * p2 ^ max(e_2a, 2b) …
lcm(a,b) * gcd(a, b) =
ab
Division Algorithm
For all integers a, b such that b is not 0, there exist unique integers q and r such that a = qb + r and 0 < r < |b|
1 + r + r^2 + … + r^n
(r^{n+1} - 1) / (r - 1)
Formula for number of digits (base 10) for natural number n
k = floor(log(n)) + 1
Number of digits (base b) for natural number n
k = floor(log_b(n)) + 1
Log_b(n) (in terms of log_10)
[log_10(n)] / [log_10(b)]
Definition of divisibility
a|b iff (if and only if) there exists an integer k such that b = ka
Divisibility tautologies
a|a, 1|a, a|0
if a|b and a|c, then ??? (integer linear combination)
a|(bx + cy) where x, y are integers