Lecture 1 Flashcards
Algebra
The study of structures on sets
Structure
Thick of as an operation. Such as addition or multiplication
Binary operation
Let S be a set, a binary operation on S is a map. For Z both + and * are binary operations where are / is not.
Well-ordering principle
If set S subsets Z and S is bounded below, then S has a minimal element. This is not true for Q.
a|b
a divides b if there is an integer c s.t. ac=b
Fact 3 (idk what it’s called)
For any numbers a, b there is a unique non-negative number d, s.t. d|a and d|b
Greatest common divisor (GCD)
If c|a and c|b then c|d and d = gcd(a,b)
Least common multiple (LCD)
If a, b are in Z, there is a unique non-negative integer l s.t.
1. a|l and b|l
2. If a|m and b|m then l|m