Primes

G. PRABAKARAN

Assistant Professor of Mathematics,

Thiagarajar College, Madurai - 625 009.

19.08.2021
Definition
 Definition
An integer p > 1 is called a prime
number, or a prime, if
 Definition
An integer p > 1 is called a prime
number, or a prime, if there is no divisor d
of p with 1 < d < p.
 Definition
An integer p > 1 is called a prime
number, or a prime, if there is no divisor d
of p with 1 < d < p.
If an integer a > 1 is not a prime, then it
is called a composite number.
 Definition
An integer p > 1 is called a prime
number, or a prime, if there is no divisor d
of p with 1 < d < p.
If an integer a > 1 is not a prime, then it
is called a composite number.
Theorem 14
 Theorem 14
Every integer n > 1 can be expressed as
a product of primes
 Theorem 14
Every integer n > 1 can be expressed as
a product of primes (with perhapes only one
factor).
Proof 14
 Proof 14
Let n > 1 be an integer.
 Proof 14
Let n > 1 be an integer.
If n is a prime, then
 Proof 14
Let n > 1 be an integer.
If n is a prime, then n itself stands as a
"product" with a single factor.
 Proof 14
Let n > 1 be an integer.
If n is a prime, then n itself stands as a
"product" with a single factor.
Suppose n > 1 is not a prime.
 Proof 14
Let n > 1 be an integer.
If n is a prime, then n itself stands as a
"product" with a single factor.
Suppose n > 1 is not a prime.
Then n = n1 n2,
 Proof 14
Let n > 1 be an integer.
If n is a prime, then n itself stands as a
"product" with a single factor.
Suppose n > 1 is not a prime.
Then n = n1 n2, where 1 < n1 < n and
1 < n2 < n
 Proof 14
Let n > 1 be an integer.
If n is a prime, then n itself stands as a
"product" with a single factor.
Suppose n > 1 is not a prime.
Then n = n1 n2, where 1 < n1 < n and
1 < n2 < n
If n1 is a prime, then let it stand.
 Proof 14
Let n > 1 be an integer.
If n is a prime, then n itself stands as a
"product" with a single factor.
Suppose n > 1 is not a prime.
Then n = n1 n2, where 1 < n1 < n and
1 < n2 < n
If n1 is a prime, then let it stand.
If n1 is not a prime,
 Proof 14
Let n > 1 be an integer.
If n is a prime, then n itself stands as a
"product" with a single factor.
Suppose n > 1 is not a prime.
Then n = n1 n2, where 1 < n1 < n and
1 < n2 < n
If n1 is a prime, then let it stand.
If n1 is not a prime, then n1 = n3 n4,
 Proof 14
Let n > 1 be an integer.
If n is a prime, then n itself stands as a
"product" with a single factor.
Suppose n > 1 is not a prime.
Then n = n1 n2, where 1 < n1 < n and
1 < n2 < n
If n1 is a prime, then let it stand.
If n1 is not a prime, then n1 = n3 n4,
where 1 < n3 < n1 and 1 < n4 < n1
 Proof 14
Let n > 1 be an integer.
If n is a prime, then n itself stands as a
"product" with a single factor.
Suppose n > 1 is not a prime.
Then n = n1 n2, where 1 < n1 < n and
1 < n2 < n
If n1 is a prime, then let it stand.
If n1 is not a prime, then n1 = n3 n4,
where 1 < n3 < n1 and 1 < n4 < n1
Similarly, n2 can be factorized.
Proof 14 ...
 Proof 14 ...
This process
 Proof 14 ...
This process of writting each composite
number that arises as a product of factors
 Proof 14 ...
This process of writting each composite
number that arises as a product of factors
must terminates, because
 Proof 14 ...
This process of writting each composite
number that arises as a product of factors
must terminates, because the factors are
smaller than the composite number itself.
 Proof 14 ...
This process of writting each composite
number that arises as a product of factors
must terminates, because the factors are
smaller than the composite number itself.
Thus, we can write n as a product of
primes.
Proof 14 ...
 Proof 14 ...
Since the prime factors are not
necessarily distinct,
 Proof 14 ...
Since the prime factors are not
necessarily distinct, we can write
 Proof 14 ...
Since the prime factors are not
necessarily distinct, we can write
α α
n = pα1 1 pα2 2 p3 3 · · · pk k
 Proof 14 ...
Since the prime factors are not
necessarily distinct, we can write
α α
n = pα1 1 pα2 2 p3 3 · · · pk k
where p3, p1, p3, . . . pk are distinct primes
 Proof 14 ...
Since the prime factors are not
necessarily distinct, we can write
α α
n = pα1 1 pα2 2 p3 3 · · · pk k
where p3, p1, p3, . . . pk are distinct primes
and α1, α2, α3 . . . αk are positive
integers.
Theorem 15
 Theorem 15
If p is a prime and p | ab, then
 Theorem 15
If p is a prime and p | ab, then p | a or
p | b.
 Theorem 15
If p is a prime and p | ab, then p | a or
p | b.
More generally, if p | a1a2a3 · · · an, then
 Theorem 15
If p is a prime and p | ab, then p | a or
p | b.
More generally, if p | a1a2a3 · · · an, then
p divides at least one factor ai in the product.
Proof 15
 Proof 15
Claim - 1 : If p | ab, then
 Proof 15
Claim - 1 : If p | ab, then p | a or p | b
 Proof 15
Claim - 1 : If p | ab, then p | a or p | b
Suppose p - a.
 Proof 15
Claim - 1 : If p | ab, then p | a or p | b
Suppose p - a.
Then (p, a) =
 Proof 15
Claim - 1 : If p | ab, then p | a or p | b
Suppose p - a.
Then (p, a) = 1
 Proof 15
Claim - 1 : If p | ab, then p | a or p | b
Suppose p - a.
Then (p, a) = 1
Since p | ab and (p, a) = 1, from theorem - 10,
 Proof 15
Claim - 1 : If p | ab, then p | a or p | b
Suppose p - a.
Then (p, a) = 1
Since p | ab and (p, a) = 1, from theorem - 10,
p | b.
Proof 15 ...
 Proof 15 ...
Claim - 2 : If p | a1 a2 a3 · · · an , then
 Proof 15 ...
Claim - 2 : If p | a1 a2 a3 · · · an , then p | a1 for some
i, 1 ≤ i ≤ n
 Proof 15 ...
Claim - 2 : If p | a1 a2 a3 · · · an , then p | a1 for some
i, 1 ≤ i ≤ n
We shall prove this by induction on n.
 Proof 15 ...
Claim - 2 : If p | a1 a2 a3 · · · an , then p | a1 for some
i, 1 ≤ i ≤ n
We shall prove this by induction on n.
Initially, let n = 2
 Proof 15 ...
Claim - 2 : If p | a1 a2 a3 · · · an , then p | a1 for some
i, 1 ≤ i ≤ n
We shall prove this by induction on n.
Initially, let n = 2
Suppose p | a1 a2 .
 Proof 15 ...
Claim - 2 : If p | a1 a2 a3 · · · an , then p | a1 for some
i, 1 ≤ i ≤ n
We shall prove this by induction on n.
Initially, let n = 2
Suppose p | a1 a2 .
Then as shown above,
 Proof 15 ...
Claim - 2 : If p | a1 a2 a3 · · · an , then p | a1 for some
i, 1 ≤ i ≤ n
We shall prove this by induction on n.
Initially, let n = 2
Suppose p | a1 a2 .
Then as shown above, p | a1 or p | a2 .
 Proof 15 ...
Claim - 2 : If p | a1 a2 a3 · · · an , then p | a1 for some
i, 1 ≤ i ≤ n
We shall prove this by induction on n.
Initially, let n = 2
Suppose p | a1 a2 .
Then as shown above, p | a1 or p | a2 .
i.e. p divides at least one factor in the product.
 Proof 15 ...
Claim - 2 : If p | a1 a2 a3 · · · an , then p | a1 for some
i, 1 ≤ i ≤ n
We shall prove this by induction on n.
Initially, let n = 2
Suppose p | a1 a2 .
Then as shown above, p | a1 or p | a2 .
i.e. p divides at least one factor in the product.
Therefore, the result is true for n = 2.
Proof 15 ...
 Proof 15 ...
Assume that for whenever p divides a product
with fewer than n factors,
 Proof 15 ...
Assume that for whenever p divides a product
with fewer than n factors, p divides at least one factor
in the product.
 Proof 15 ...
Assume that for whenever p divides a product
with fewer than n factors, p divides at least one factor
in the product.
Let p | a1 a2 a3 · · · an .
 Proof 15 ...
Assume that for whenever p divides a product
with fewer than n factors, p divides at least one factor
in the product.
Let p | a1 a2 a3 · · · an .
⇒ p | a1 c, where c = a2 a3 · · · an
 Proof 15 ...
Assume that for whenever p divides a product
with fewer than n factors, p divides at least one factor
in the product.
Let p | a1 a2 a3 · · · an .
⇒ p | a1 c, where c = a2 a3 · · · an
Since p | a1 c,
 Proof 15 ...
Assume that for whenever p divides a product
with fewer than n factors, p divides at least one factor
in the product.
Let p | a1 a2 a3 · · · an .
⇒ p | a1 c, where c = a2 a3 · · · an
Since p | a1 c, as shown above, p | a1 or p | c.
 Proof 15 ...
Assume that for whenever p divides a product
with fewer than n factors, p divides at least one factor
in the product.
Let p | a1 a2 a3 · · · an .
⇒ p | a1 c, where c = a2 a3 · · · an
Since p | a1 c, as shown above, p | a1 or p | c.
If p | a1 , then the result is true.
Proof 15 ...
 Proof 15 ...
Let p | c
 Proof 15 ...
Let p | c
i.e. p | a2 a3 · · · an
 Proof 15 ...
Let p | c
i.e. p | a2 a3 · · · an
From induction assumption, p | ai for some
i, 2 ≤ i ≤ n
 Proof 15 ...
Let p | c
i.e. p | a2 a3 · · · an
From induction assumption, p | ai for some
i, 2 ≤ i ≤ n
i.e. p divides at least one factor.
 Proof 15 ...
Let p | c
i.e. p | a2 a3 · · · an
From induction assumption, p | ai for some
i, 2 ≤ i ≤ n
i.e. p divides at least one factor.
Therefore, from the principle of induction, the
result is true for all n
 Proof 15 ...
Let p | c
i.e. p | a2 a3 · · · an
From induction assumption, p | ai for some
i, 2 ≤ i ≤ n
i.e. p divides at least one factor.
Therefore, from the principle of induction, the
result is true for all n
Hence the theorem.