Definitions Flashcards
b divides 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
Common Divisor
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.
Greatest Common Divisor
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).
Prime
An integer p > 1 is said to be prime if the only positive divisors of p are 1 and
itself.
Finite Continued Fraction
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].
Finite Simple Continued Fraction
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].
nth convergent
The nth convergent of [x0 : x1, x2, . . .] is the rational number pn/qn = [x0 : x1, . . . , xn].
Periodic Simple Continued Fraction
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
Quadratic Irrational
A quadratic irrational is an irrational real number that is a solution of a quadratic
equation with integer coefficients
Purely Periodic
An infinite simple continued fraction of the form [x0:x1,…,xn] is called purely periodic if it repeats x0,….xn
Conjugate
Let α = r + s√d be a quadratic irrational. We define the conjugate of α as the quadratic irrational α* = r − s√d.
Reduced Quadratic Irrational
Let α = r + s√d be a quadratic irrational.
We say that α is a reduced quadratic irrational if α > 1 and −1 < α* < 0
Pell Equations
Pell equations are quadratic Diophantine equations of the form x^2 - dy^2 = 1, where d is a positive integer
Fundamental Solution
Suppose that x^2 - dy^2 = 1 has non trivial solutions. We define the fundamental solution to be the minimal positive solution (x1, y1)
Congruent Modulo n
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