ABSTRACT ALGEBRA

Chapter 0
o
o

Well Ordering Principle (WOP)

Every nonempty set of positive integers contains a smallest number.
Divides
Let and be integers. We say that | if s.t. = .
Example:
1. = 2; = 2; = 4
=
22=4
Division Algorithm
Let and be integers with > 0. Then a unique and with the property that
= + , where 0 < .
PROOF:
Let = { | , , > 0 0}. is not empty.
If 0 , it that = 0 and = that |.
By WOP, a least element say = . We show that 0 < . It is left to show
that < .
By contradiction, suppose
0 since > 0, <
It that = ( + 1) < , a contradiction since is the least element.
Therefore, 0 < .
To prove uniqueness, let 1 , 2 , 1 , 2 be and 0 1 < and 0 2 < ,
< 2 1 < .
2 ( 1 ) = 2 1 2 + 1 = 2 1
(2 + 1 ) = 2 1
must divide 2 1 ,
|2 1
This will be only true if 2 1 = 0 implying that 1 = 2 1 = 2

Greatest Common Divisor (GCD)

Let , , , > 0
1. If | and | we say that is a common divisor of and .
2. If and if | and |, and if |, we say that is the GCD of and .
THM 0.2 GCD IS A LINEAR COMBINATION
1. gcd(, ) = + ,
2. The least element in the set + is the gcd(, )
PROOF:
Given , + , let = { + |, + > 0}
is not empty.
By WOP, has a least element = +
Show that gcd(, ) = , using division algorithm, let = + where
0 < , > 0. If > 0, = = ( + ) =
(1 ) + () , and (1 ) + () < = +

A contradiction since we let to be the least element of .

= 0 and = |.
It also shows that | is the common divisor.
Left to show, is the of (, ). Let be the another common divisor.
So, = and = for , .
= + = ( ) + ( ) = ( + )
It that | and gcd(, ) = .

Corollary
If and are relatively prime, then there exist integers and such that + = 1
gcd(, ) = 1
Euclids Lemma
If is a prime and | then either | or |.
PROOF:
Case 1: If |, then the lemma already holds.
Case 2: If , we show that |.
What is the gcd(, )?
So, gcd(, ) = 1
By corollary, and s.t. + = 1
It that = +
| since |
| since |
Then |( + )
|.

Theorem 3. The Fundamental Theorem of Arithmetic

PROOF: Number theory books

Lemma
If divides 1 2 , where is a prime, 1 , 2 , , are positive integers, then
an with 1 s.t. |
| = 1 2 |
PROOF: By Math Induction
Let () be a statement. We show () is true for all +
Steps:
1. Show that (1) is true
2. Assume that () is true for a particular value. Assume that =
3. Prove that ( + 1) is also true so that, we can say () is true for all
PROOF: By Assumption |1 2 , +
1. If = 1
|, true because s.t. |
If = 2
|1 2 , true by Euclids Lemma
2. Assume |1 2 where 1 < s.t. | . Show |1 2 +1
|(1 2 )+1
Case 1: |(1 2 ) is already true by assumption where 1 < s.t. |

Case 2: (1 2 ) we show that |+1. But this is again a true statement by

Euclids Lemma.
where 1 < s.t. if |1 2 +1 then |
this is true for all in +

LCM
, , , + and
(1) | and |, we say that is a common multiple of and . (2) And , if | and | and
| then we say that is the LCM of both and .
Modular Arithmetic (Congruence)
Def.
Given integers , , we say that , + if |( )
Note: Congruence is an equivalence relation
1. Def. Congruence. Let , , + , we define if |( )
2. Congruence is an equivalence relation.
PROOF of TRANSITIVITY
If and then
Since then |( ) 1 s.t. 1 =
Since then |( ) 2 s.t. 2 =
It implies that 1 + 2 = .
(1 + 2 ) =
Since (1 + 2 ) = then |( )
By definition of congruence, .

Divisibility
Divisible by 11: alternate subtract and add if the answer is divisible by 11, then the
whole is divisible by 11.
1,837
7 3 = 4 + 8 = 12 1 = 11 , 11 is divisible by 11
Divisibility
= ( 1 1 0 )10 where {0, 1, 2, , }, {0, 1, , }
= 10 + 1 101 + + 2 102 + 10 + 0
1. Divisibility by Powers of 2
10 0 2 102 02 22 102 0 4
= 10 + 1 101 + + 2 102 + 10 + 0 0 2
0 2
= 10 + 1 101 + + 2 102 + 10 + 0 1 10 + 0 4
(1 0 )10 22
(2 1 0 )10 23

 (1 2 1 )10 2
Example:
= 235488

2|, 4|, 8|, 6|, 32|, 64

2. By Powers of 5
0 5
10 0 5
= 10 + 1 101 + + 2 102 + 10 + 0
0 5
(1 0 )10 52
(2 1 0 )10 53
(1 1 0 )10 5
Example:
= 321675

5|, 25|, 125

3. By Powers of 3 and 9
10 1 3, 10 1 9
= 10 + 1 101 + + 2 102 + 10 + 0
+ 1 + + 2 + 1 + 0 (3 9)
Example:
= 657,848,571
9 3|
4. By 11
10 1 11
= 10 + 1 101 + + 2 102 + 10 + 0
(1) + 1 (1)1 + + 2 (1)2 + 1 (1) + 0 11
Example:
= 9,826,491,345
11|
11|(5 4 + 3 1 + 9 4 + 6 2 + 8 9)
5. By 7, 11, 13
1000 1 7
*every 1,000 papalitan ng -1
2 (
2
= 1000 8 10 + 7 10 + 6 ) + 1000(5 102 + 4 10 + 3 ) + (2 102 + 1 10
+ 0 )
2
+ (1) (8 7 6 )10 + (1)(5 4 3 )10 + (2 1 0 )10 7 11 13

*Power of 2 last digit

*Power of 4 last 2 digit

*Power of 8 last 3 digit

*Power of 11 alternate last digit (+, -, +, )
*7, 11, 13 alternate last 3 digit
*3, 9 add
*5 last digit
*25 last 2 digit
*125 last 3 digit