The prime number theory
Lemma 1
Every nonzero integer can be written as a product of primes.
Theorem 1
For every nonzero integer n there is a prime factorization
with the exponents uniquely determined by n.
Lemma 2
If and b>0, there exist q,r\in\mathbb{Z}such that a=qb+r with
Definition
If , we define to be the set of all integers of the form with .
Lemma 3
If , then there is a such that (a,b)=(d).
Definition
Let . An integer d is called a greatest common divisor of a and b if d is a divisor of both a and b and if every other common divisor of a and b divides d.
Lemma 4
Let .If (a,b)=(d) then d is a greatest common divisor of a and b.
Definition
We say that two integers a and b are relatively prime if the only common divisors are , the units.
Proposition 1.1.1
Suppose that a|bc and that (a,b)=1.Then a|c.
Corollary 1
If p is a prime and p|bc, then either p|b or p|c.
Corollary 2
Suppose that p is a prime and that . Then .
Unique Factorization in k[x]
Reference book
A Classical Introduction to Modern Number Theory by Kenneth Ireland and Michael Rosen