Flashcards
§1 Preliminaries
Cards in this deck (10)
- 1Definition 1.2: Equivalence Relation~ is an equivalence relation if
i) For every a є A, a~a.
ii) For any a,b ∈ A, whenever a~b then b~a.
iii) If a~b & b~c, then a~c - 2Notation: Equivalence classSuppose ~ is an equivalence relation on A. For given a ∈ A,
[a] ={a’ є A : a’ ~ a} - 3Proposition 1.1For a,b ∈ A,
if [a]∩[b] ≠ 0,
then [a] = [b] - 4Definition 1.6: Dividesm,n ∈ Z. Say m|n
if n=k∙m,
for some k∈Z - 5Definition 1.7: PrimeFor p∈N, p>1.
Say p is prime if its only divisor are 1, and p. - 6Definition 1.8: Modulusp,q∈Z, m∈Z (m≠0).
p≡q(mod m)
if m|p-q - 7Definition: Residue classa∈Z, m∈Z(m≠0)
\([a]_m\)={b∈Z:b≡a(mod m)} is a residue class. - 8Theorem 1.2: Long division, Euclidean divisionm∈Z, m>0 & n∈Z.
Then n=q∙m+r
for some q,r∈Z with 0≤r - 9Corollary of Theorem 1.1If p,q∈Z, g.c.d(p,q)=1, then there are a,b∈Z such that ap+bq=1
- 10Lemma 1.1: Euclid's lemmaIf p is a prime, and p|ab (for a,b∈Z), then p|a or p|b.
Information
- Description
- Diploma/Certificado de qualificação profissional de nivel 3 Mathematics (Algebra (MATH311)) Flashcards on §1 Preliminaries, created by Amy Wogan on 19/03/2016.
- Created by
- Amy Wogan · Mar 2016
- Updated
- Jun 30, 2016
- Views
- 2
- Tags
- Rating