Number Theory Definitions Flashcards

1
Q

Definition of Prime

A

a positive integer p is prime iff the only positive integers dividing p are 1 and p.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
2
Q

Definition of Composite

A

a positive integer n is composite iff there exist integers a,b with 1 < a, b < n such that n = ab

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
3
Q

gcd(a, b)

A

gcd(a,b) = d such that d is the largest possible integer such that d|a and d|b.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
4
Q

lcm(a, b)

A

lcm(a,b) = l such that l is the smallest possible integer such that a|l and b|l.

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
5
Q

gcd(a, b) (prime factorization)

A

p1^min(e_1a, e_1b) * p2^min(e_2a, e_2b) * …

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
6
Q

lcm(a, b) (prime factorization)

A

p1 ^ max(e_1a, e_1b) * p2 ^ max(e_2a, 2b) …

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
7
Q

lcm(a,b) * gcd(a, b) =

A

ab

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
8
Q

Division Algorithm

A

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|

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
9
Q

1 + r + r^2 + … + r^n

A

(r^{n+1} - 1) / (r - 1)

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
10
Q

Formula for number of digits (base 10) for natural number n

A

k = floor(log(n)) + 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
11
Q

Number of digits (base b) for natural number n

A

k = floor(log_b(n)) + 1

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
12
Q

Log_b(n) (in terms of log_10)

A

[log_10(n)] / [log_10(b)]

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
13
Q

Definition of divisibility

A

a|b iff (if and only if) there exists an integer k such that b = ka

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
14
Q

Divisibility tautologies

A

a|a, 1|a, a|0

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
15
Q

if a|b and a|c, then ??? (integer linear combination)

A

a|(bx + cy) where x, y are integers

How well did you know this?
1
Not at all
2
3
4
5
Perfectly
16
Q

Fundamental Theorem of Arithmetic (Unique Factorization Theorem)

A

Every integer n > 1 can be written uniquely (up to ordering) as a product of primes. In other words, for all integers n, n > 1, n = p_1^(e1) p_2^(e2)…p_k^(ek) for distinct primes p_1, …, p_k. The primes and exponents (ei) are unique with ei > 0.

17
Q

Consequence of Fundamental Theorem of Arithmetic

A

for every integer n > 1, there exists a prime such that p|n.

18
Q

Definition of a rational number

A

A number n is rational iff there exist integers a, b with b \ne 0 st. n = a/b

19
Q
A