Definitions Flashcards

1
Q

b divides a

A

Let a and b be integers. If there exists an integer c with a = bc, then we say that b divides a (or a is a multiple of b) and we write this as b | a

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

Common Divisor

A

Let a, b ∈ Z. If d | a and d | b we say that d is a common divisor of a and b. Let
D(a, b) denote the set of all common divisors of a and b.

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

Greatest Common Divisor

A

Let a, b ∈ Z. If at least one of a, b is non-zero then we denote the greatest
common divisor of a and b by gcd(a, b).

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

Prime

A

An integer p > 1 is said to be prime if the only positive divisors of p are 1 and
itself.

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

Finite Continued Fraction

A

A finite continued fraction is an expression of the form:
xo+1/(x1+1/(x2+1/…))
where xo ∈ R and all other xk are positive real numbers.
We denote the above finite continued fraction by [x0 : x1, x2, . . . , xn].

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

Finite Simple Continued Fraction

A

A finite simple continued fraction is an expression of the form:
xo+1/(x1+1/(x2+1/…))
where xo ∈ Z and all other xk are positive real numbers.
We denote the above finite simple continued fraction by [x0 : x1, x2, . . . , xn].

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

nth convergent

A

The nth convergent of [x0 : x1, x2, . . .] is the rational number pn/qn = [x0 : x1, . . . , xn].

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

Periodic Simple Continued Fraction

A

A periodic simple continued fraction is a simple continued fraction with a repeating block. [x0:x1,x2,…,xk,y1,…,yn] where y1,…,yn repeats infinitely

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

Quadratic Irrational

A

A quadratic irrational is an irrational real number that is a solution of a quadratic
equation with integer coefficients

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

Purely Periodic

A

An infinite simple continued fraction of the form [x0:x1,…,xn] is called purely periodic if it repeats x0,….xn

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

Conjugate

A

Let α = r + s√d be a quadratic irrational. We define the conjugate of α as the quadratic irrational α* = r − s√d.

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

Reduced Quadratic Irrational

A

Let α = r + s√d be a quadratic irrational.

We say that α is a reduced quadratic irrational if α > 1 and −1 < α* < 0

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

Pell Equations

A

Pell equations are quadratic Diophantine equations of the form x^2 - dy^2 = 1, where d is a positive integer

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

Fundamental Solution

A

Suppose that x^2 - dy^2 = 1 has non trivial solutions. We define the fundamental solution to be the minimal positive solution (x1, y1)

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

Congruent Modulo n

A

Let n be a fixed positive integer. We say that integers a and b are congruent modulo n if n divides a-b. We shall write a ≡ b mod n to denote that a and b are congruent modulo n

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

Unit

A

An element [a] ∈ Zn is called a unit if there exists [b] ∈ Zn satisfying [a][b] = [b][a] = [1].
We write Un to denote the set of all units in Zn.

17
Q

ϕ(n)

A

Let n be a positive integer. We define ϕ(n) to be the number of positive integers a less than or equal to n with gcd(a, n) = 1.
(Thus ϕ(n) = |Un|.)

18
Q

Primitive Root Modulo n

A

Let n be a positive integer. An element of [a] ∈ Un is called a primitive root
modulo n if it has order ϕ(n)

19
Q

Quadratic Residue

A

Let n be a positive integer. An element [a] ∈ Un is called a quadratic residue if
[a] = [x]^2 for some [x] ∈ Un.

20
Q

Quadratic Non Residues

A

If [a] ∈ Un is not a quadratic residue, then we call it a

quadratic non-residue. We denote the set of quadratic residues by Qn

21
Q

Hensel’s Lemma

A

Let f(x) be a polynomial with integer coefficients and let p be a prime. Assume that there exists a ∈ Z with;
(1) f(a) ≡ 0 mod p.
(2) f’(a) !≡ 0 mod p
Then for all m ≥ 1 there exists a unique integer r with 1 ≤ r ≤ p^m and
(a) f(r) ≡ 0 mod p^m.
(b) r ≡ a mod p.

22
Q

Euler’s Critierion

A

Let p be an odd prime and let a ∈ Z. Then

(a/p) ≡ a^(0.5(p-1)) mod p

23
Q

Quadratic Reciprocity Theorem

A

Let p and q be distinct odd primes. Then

q/p)(p/q) = (-1)^(0.25(p-1)(q-1)

24
Q

Which real numbers have a finite simple continued fraction?

A

Rationals

25
Q

Which real numbers have a infinite simple continued fraction?

A

Irrationals

26
Q

Which real numbers have a periodic simple continued fraction expansion?

A

Quadratic Irrationals

27
Q

State Fermat’s Little Theorem

A

Let p be a prime and let a be an integer not divisible by p. Then a^(p−1) ≡ 1 mod p

28
Q

State Lagrange’s Polynomial Congruence Theorem

A

Let f(x) be a polynomial of degree d with integer coefficients and let p be a prime. If some coefficient of f is not divisible by p, then the congruence f(x) ≡ 0modp has at most d solutions modulo p.

29
Q

When is a number purely periodic?

A

A quadratic irrational is purely periodic iff it is reduced

30
Q

State Wilson’s Theorem

A

A positive integer p is prime iff (p-1)! ≡ -1 mod p