Module #9 – Number Theory

3. Number theory and

Matrices

01/18/22 1
Module #9 – Number Theory
Section 3.4: The Integers and
Division
Division:
Let a, b  Z with a  0.
• a |b  “a divides b”.
We say that “a is a factor of b”, “a is a divisor of
b”, and “b is a multiple of a”.
• a does not divide b is denoted by a | b.
• We can express a | b using the quantifier
 c (b = ac), Domain = Z.
3  12  True, but 3  7  False.
01/18/22 2
Module #9 – Number Theory

The Divides Relations

• For every a, b, c  Z, we have

1. If a | b and a | c , then a | (b + c).
2. If a | b , then a | bc .
3. If a | b and b | c , then a | c .

Examples:
 3  12 and 3  9  3  (12 + 9)  3  21 (21 ÷ 3 = 7)
 2  6  2  (6 × 3)  2  18 (18 ÷ 2 = 9)
 4  8 and 8  64  4  64 (64 ÷ 4 = 16)

01/18/22 3
Module #9 – Number Theory

The Division Algorithm

• let a be an integer and d a positive integer, then

there exist unique integers q and r such that:
a = d ×q + r ,0r<d.
• d is called divisor and a is called dividend.
• q is the quotient and r is the remainder (positive
integer).
q = a div d , r = a mod d .

01/18/22 4
Module #9 – Number Theory

Examples
• What are the quotient and remainder when 101 is
divided by 11?
101 = 11 × 9 + 2,
q = 101 div 11 = 9, r = 101 – 11 × 9 = 2 = 101 mod 9
• What are the quotient and the remainder when −11
is divided by 3?
−11 = 3 × (−4) + 1 , q = −4 , r = 1
  11 
q  11 div 3       3.6  4
 3 
• Note: r  11  (4)  3  1  11 mod 3

-11  3 × (-3) - 2 because r can't be negative.

01/18/22 5
Module #9 – Number Theory

Examples
• Find a and b if :
2a + b = 46 mod 7 and a + 2b = 47 div 9.

46 = 6 × 7 + 4 and 47 = 5 × 9 + 2
46 mod 7 = 4 and 47 div 9 = 5
2a + b = 4 (1) and a + 2b = 5 (2)
(1) – 2 (2): -3b = -6
b = 2 and a = 1.

01/18/22 6
Module #9 – Number Theory

Section 3.5: Primes and Greatest

Common Divisors

• A positive integer p > 1 is prime if the only

positive factors of p are 1 and p.
Some primes: 2, 3, 5, 7, 11, 13, 17, ...
• Non-prime integer greater than 1 are called
composite, because they can be composed by
multiplying two integers greater than 1.

01/18/22 7
Module #9 – Number Theory

Fundamental Theorem of Arithmetic

• Every positive integer greater than 1 has a unique
representation as a prime or as the product of two
or more primes where the prime factors are written
in order of non-decreasing size. (tree or division)
100 = 2·2·5·5 = 2252
13 = 13
1024 = 2·2·2·2·2·2·2·2·2·2 = 210

01/18/22 8
Module #9 – Number Theory

Theorem

• If n is a composite integer, then n has prime

divisor ≤ n .
e.g. 49  prime numbers less than 49 are 2, 3, 5, 7
16  prime numbers less than 16 are 2, 3.
• An integer n is prime if it is not divisible by any
prime ≤ n .
e.g. 13 where 13 = 3.6 so the prime numbers are 2, 3
but non of them divides 13 so 13 is prime.

01/18/22 9
Module #9 – Number Theory

Prime Factorization Technique

• To find the prime factor of an integer n :

1. Find n.
2. List all primes ≤ n,
2, 3, 5, 7, … , up to n.
3. Find all prime factors that divides n.

01/18/22 10
Module #9 – Number Theory

Example 1

01/18/22 11
Module #9 – Number Theory

Example 2

01/18/22 12
Module #9 – Number Theory

Example 3

01/18/22
Module #9 – Number Theory

Discrete Mathematics

Matrices

01/18/22 14
Module #9 – Number Theory

Section 3.8: Matrices

• An m×n matrix is a rectangular array of mn
objects (usually numbers) arranged in m
horizontal rows and n vertical columns.

• An nn matrix is called a square matrix, whose

order is n.
2 3 
5  1 2 1
  3 1
7 0    22
32

01/18/22 15
Module #9 – Number Theory

Matrix Equality

• Two matrices A and B are equal if and only if they

have the same number of rows, the same number
of columns, and all corresponding elements are
equal.

 3 2  3 2 0
  1 6     1 6 0
   

01/18/22 16
Module #9 – Number Theory

Row and Column Order

• The rows in a matrix are usually indexed 1 to m
from top to bottom. The columns are usually
indexed 1 to n from left to right. Elements are
indexed by row, then column.

 a11 a12  a1n 

a a22  a2 n 
A  [aij ]   21

    
 
am1 am 2  amn 

01/18/22 17
Module #9 – Number Theory

Matrix Sums
• The sum A + B of two matrices A, B (which must
have the same number of rows, and the same
number of columns) is the matrix given by adding
corresponding elements.
• A + B = [aij + bij]
2 6   7  5  9 1
 0  8   4  1    4  9 
     
1 2  3 6  4 8 

01/18/22 18
Module #9 – Number Theory

Matrix Products
For an mk matrix A and a kn matrix B, the
product AB is the mn matrix:
k 
AB  C  [cij ]   aip b pj 
 p 1 
i.e. The element (i, j ) of AB is given by the vector
dot product of the ith row of A and the jth column
of B (considered as vectors).

Note: Matrix multiplication is not commutative!

01/18/22 19
Module #9 – Number Theory

Matrix Product Example

0  1 1 0
0 1  1   1 0  5  1
2 0 3  2 0  2 0  
3  2 11 3 
  1 0 3 
1  

2×3 3×4 2×4

01/18/22 20
Module #9 – Number Theory

Identity Matrices
• The identity matrix of order n, In , is the order-n
matrix with 1’s along the upper-left to lower-right
diagonal and 0’s everywhere else.
• A In = A
1 0  0

1 if i  j  0 1  
0
I n   
0 if i  j     
 
0 0  1

01/18/22 21
Module #9 – Number Theory

Powers of Matrices

• If A is an nn square matrix and p  0, then:

Ap  AAA ··· A (A0  In)
p times
3
 2 1  2 1  2 1  2 1
  1 0    1 0   1 0   1 0
     
 2 1  3 2  4 3
     
  1 0   2  1   3  2 
01/18/22 22
Module #9 – Number Theory

Matrix Transposition

• If A is an mn matrix, then the transpose of A is

the nm matrix AT given by interchanging the
rows and the columns of A.

2 0
2 1 3  
A   A  1  1 
T

0  1  2 3  2

01/18/22 23
Module #9 – Number Theory

Symmetric Matrices
• A square matrix A is symmetric if and only if AT
= A.
• Which is symmetric?
A B C

1 1  2 1 3 3 0 1
1 1  1  0 2  1 
  0 1  
 
1 1  3  1 2  1 1  2

01/18/22 24
Module #9 – Number Theory

Zero-One Matrices

All elements of a zero-one matrix are 0 or 1,

representing False & True respectively.
• The join of A and B (both mn zero-one matrices)
is
A  B : [aij  bij].
• The meet of A and B is:
A  B  [aij  bij].

01/18/22 25
Module #9 – Number Theory

Example

1 0 1 0 1 0 
A=   B =  
0 1 0  1 1 0 

1 1 1 
• The join between A and B is A  B =  
1 1 0 
0 0 0 
• The meet between A and B is A  B = 0 1 0 
 

01/18/22 26
Module #9 – Number Theory

Boolean Products

• Let A be an m k zero-one matrix and B be a

k n zero-one matrix,
• The Boolean product A⊙B of A and B is like
normal matrix product, but using  instead +
and using  instead .

01/18/22 27
Module #9 – Number Theory

Boolean Powers

• For a square zero-one matrix A, and any k  0, the

kth Boolean power of A is simply the Boolean
product of k copies of A.
A[k]  A⊙A⊙…⊙A

k times

01/18/22 28
Module #9 – Number Theory

Example
1 0
0 1 1 0
Let A =  1 and B = 0 1 1
1
 
0

(1  1)  (0  0) (1  1)  (0  1) (1  0)  (0  1) 
A⊙B = (0  1)  (1  0) (0  1)  (1  1) (0  0)  (1  1) 
 
(1  1)  (0  0) (1  1)  (0  1) (1  0)  (0  1) 
1 1 0
 0 1 1
1 1 0
01/18/22 29