Number

Theory
MS. LOQUE
What is number theory?
Number Theory is the study of set of integers and their properties.

Topics:

1.Congruence Modulo

2.Division and Euclidean Algorithm

3.Number System
Divisibility
Divisibility is when a and b are integers with a ≠ 0 , we say that a divides b if there is
𝑏
an integer c such that b = ac, or equivalently, if is an integer. The notation a∣b
𝑎
denotes that a divides b.

Here, a is the divisor and b is multiple. It is usually denoted a|b, or some authors
denoted it by b:a. but here, we will go with the first notation.

If a divides b we also say “ a is a factor of b” or “ b is a multiple of a” if a doesn’t

divide b, we write a∤b.
 Properties of Divisibility
1. 𝑎|0 7. If 𝑎|𝑏 and b|𝑐, then 𝑎|𝑐 Transitive Property

2. 1|𝑎 8. If 𝑎|𝑏 and 𝑥 is any integer then 𝑎|𝑏𝑥

3. 𝑎|𝑎 9. 𝑎|𝑏 and b|𝑎 if and only if 𝑎 = ±𝑏
4. 𝑎|1 if and only if 𝑎 = ±1
10. If 𝑎|𝑏 and 𝑏 ≠ 0, then 𝑎 ≤ 𝑏
5. If 𝑎|𝑏 and c|𝑑, then 𝑎𝑐|𝑏𝑑
11. If 𝑎|𝑏 and 𝑎|𝑐, then 𝑎|(𝑏𝑥 + 𝑐𝑦) for arbitrary integer 𝑥
6. If 𝑎|𝑏 and 𝑎|𝑐, then
• 𝑎|(𝑏 + 𝑐) and 𝑦.
• 𝑎|(𝑏 − 𝑐)
• 𝑎|𝑏𝑐
Congruence Modulo
If a and b are integers and m is a positive integer, then a is congruent
to b modulo m if 𝑚 divides 𝑎 − 𝑏.

In symbol, 𝑎 ≡ 𝑏(𝑚𝑜𝑑 𝑚), where a is the dividend, b is the remainder, m is the divisor and
"≡" is the symbol for congruence.
Theorem 5.1
Let 𝑚 be a positive integer, if 𝑎 ≡ 𝑏(𝑚𝑜𝑑 𝑚) and 𝑐 ≡ 𝑑 𝑚𝑜𝑑 𝑚 , then
1. 𝑎 ± 𝑐 ≡ 𝑏 ± 𝑑 𝑚𝑜𝑑 𝑚
2. 𝑎𝑐 ≡ 𝑏𝑑 𝑚𝑜𝑑 𝑚
3. 𝑎𝑘 ≡ 𝑏 𝑘 𝑚𝑜𝑑 𝑚 , ∀𝑘 ∈ ℕ
4. 𝑎 ≡ 𝑏 𝑚𝑜𝑑 𝑚 → 𝑎 𝑚𝑜𝑑 𝑚 = 𝑏(𝑚𝑜𝑑 𝑚)
Theorem 5.2
Let m > 1 be fixed and 𝑎, 𝑏, 𝑐, 𝑑 be arbitrary integers. Then Congruence Modulo m is an
equivalence relation.
▪ 𝑎 ≡ 𝑎 (𝑚𝑜𝑑 𝑚) for all 𝑎. (Reflexive)
▪ If 𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑚), then 𝑏 ≡ 𝑎 (𝑚𝑜𝑑 𝑚). (Symmetric)
▪ If 𝑎 ≡ 𝑏 (𝑚𝑜𝑑 𝑚) and 𝑏 ≡ 𝑐 (𝑚𝑜𝑑 𝑚), then 𝑎 ≡ 𝑐 (𝑚𝑜𝑑 𝑚)
Examples:
Verify the following congruence statements

1. 15 ≡ 6 𝑚𝑜𝑑 9

2. −47 ≡ 17 𝑚𝑜𝑑 8

3. Given 15 ≡ 6 𝑚𝑜𝑑 9 and 13 ≡ −5 𝑚𝑜𝑑 9

Given 𝑎 ≡ 4 (𝑚𝑜𝑑 9) and 𝑏 ≡ 5 (𝑚𝑜𝑑 9), find the value of 𝑐 with
𝑎 < 𝑐 < 9, such that

1. 𝑐 ≡ 4𝑎 𝑚𝑜𝑑 9

2. 𝑐 ≡ 3𝑏 𝑚𝑜𝑑 9

3. 𝑐 ≡ 6𝑎 − 5𝑏 𝑚𝑜𝑑 9

4. 𝑐 ≡ 𝑎2 + 𝑏 2 𝑚𝑜𝑑 9
Division Algorithm
In the equality given in the division algorithm, m is called the divisor, a is called the
dividend, q is called the quotient, and r is called the remainder. In symbol,

𝑞 = 𝑎 𝑑𝑖𝑣 𝑚

𝑟 ≡ 𝑎 𝑚𝑜𝑑 𝑚

𝑎 = 𝑏𝑞 + 𝑟, where 0 ≤ 𝑟 < 𝑏
Example:
What are the quotient and remainder when 101 is divided by 11?
Example:
What are the quotient and remainder when - 11 is divided by 3?
Example:
Use the division algorithm to find the quotient and remainder when a = 158 and

b =17.
Euclidean Algorithm
Let 𝑎 = 𝑏𝑞 + 𝑟, where 𝑎, 𝑏, 𝑞, and 𝑟 are integers. Then gcd 𝑎, 𝑏 = gcd(𝑏, 𝑟).

This uses the division algorithm to

➢Find the greatest common divisor (gcd) aka highest common factor (hcf)
➢Find the lowest common multiple (lcm) of two numbers
➢Reduce a fraction to its simplest form
➢Find relatively prime (coprime) integers
• These occur when gcd 𝑎, 𝑏 = 1
Find the gcd of 135 and 1780
Solution:
𝑎 = 𝑏𝑞 + 𝑟
1780 = 135 ∙ 13 + 25

Now continue, replacing 𝑎 with 𝑏, and 𝑏 with 𝑟.

Find the lcm of 135 and 1780
Solution:
𝑎𝑏
𝑙𝑐𝑚 𝑎, 𝑏 =
gcd(𝑎, 𝑏)
Hence the gcd 135,1780 = 5
135∙1780
𝑙𝑐𝑚 135,1780 = 5

240300
= 5

= 48060

𝑙𝑐𝑚 135,1780 = 48060

Reduce the fraction 1480/128600 to its
simplest form
Solution:
𝑎 = 𝑏𝑞 + 𝑟
128600 = 1480 ∙ 86 + 1320
1480 = 1320 ∙ 1 + 160
1320 = 160 ∙ 8 + 40
160 = 40 ∙ 4 + 0

gcd 140, 128600 = 40

Divide numerator and denominator by the gcd
1480÷40 37
= 3215
128600÷40
Show that 34 and 111 are coprime/relatively prime
Solution:
𝑎 = 𝑏𝑞 + 𝑟
111 = 34 ∙ 3 + 9
34 = 9 ∙ 3 + 7
9=7∙1+2
7=2∙3+1
2=1∙2+0

gcd 34, 111 = 1

∴ 34 𝑎𝑛𝑑 111 are coprime.

Number System
MS. LOQUE
What is Number System?
A number system is defined as a system of writing for expressing numbers. It is the mathematical
notation for representing numbers of a given set by using digits or other symbols in a consistent
manner. It also allows us to operate arithmetic operations like addition, subtraction, multiplication
and division.

The value of any digit in a number can be determined by:

• The digit
• Its position in the number
• The base of the number system
Types of Number System

1.Decimal number system (Base-10)

2.Binary number system (Base- 2)

3.Octal number system (Base-8)

4.Hexadecimal number system (Base- 16)

Base value and set of digits of a given number system

Base
Number System Set of Digits
Value

Decimal 10 0,1,2,3,4,5,6,7,8,9

Binary 2 0,1

Octal 8 0,1,2,3,4,5,6,7

Hexadecimal 16 0,1,2,3,4,5,6,7,8,9,A,B,C,D,E,F
Decimal Number System
➢ has base 10 because it uses ten digits from 0 to 9. In the decimal number system, the positions
successive to the left of the decimal point represent units, tens, hundreds, thousands, and so on. This
system is expressed in decimal numbers. Every position shows a particular power of the base (10).

Example:
The decimal number 1457 consists of the digit 7 in the units position, 5 in the tens place, 4 in
the hundreds position, and 1 in the thousands place whose value can be written as
1 × 1000 + 4 × 100 + 5 × 10 + 7 × 1
1 × 103 + 4 × 102 + 5 × 101 + 7 × 100
= 1000 + 400 + 50 + 7

∴ 145710
Binary Number System

The base 2 number system is also known as the Binary number system, wherein, only two binary
digits exist, i.e., 0 and 1. Specifically, the usual base-2 is a radix of 2. The figures described under this
system are known as binary numbers which are the combination of 0 and 1.

For example:

1101012 is a binary number.

Octal Number System
In the octal number system, the base is 8 and it uses numbers from 0 to 7 to represent numbers.
Octal numbers are commonly used in computer applications.

Example:

2008

Note:
2008 ≠ 20010
Hexadecimal Number System
In the hexadecimal system, numbers are written or represented with base 16. In the hex system,
the numbers are first represented just like in the decimal system i.e. from 0 to 9. Then, the
numbers are represented using the alphabets from A to F.

The below-given table shows the representation of numbers in the hexadecimal number
system.

Example: 2𝐴𝐹16
Conversion of
Number System
Decimal to Binary
Example:

Convert (25)10 to Binary number.

Solution:
25 = 2 ∙ 12 + 1
12 = 2 ∙ 6 + 0
6= 2∙3+0
3= 2∙1+1
1= 2∙0+1

∴ (25)10 = (11001)2
Decimal to Octal
Example:

Convert (128)10 to Octal number.

Solution:
128 = 8 ∙ 16 + 0
16 = 8 ∙ 2 + 0
2= 8∙0+2

∴ (128)10 = (200)8
Decimal to Hexadecimal
Example:

Convert (128)10 to Hexadecimal number.

128 = 16 ∙ 8 + 0
8 = 16 ∙ 0 + 8

∴ (128)10 = (80)16
Binary to Decimal
Example:
Convert (1101)2 to Decimal number.
Solution:
1 ∙ 23 + 1 ∙ 22 + 0 ∙ 21 + 1 ∙ 20
= 8+4+0+1
= 13

∴ (1101)2 = (13)10
Octal to Decimal
Example:

Convert (22)8 to Decimal number.

Solution:
2 ∙ 81 + 2 ∙ 80
= 16 + 2
= 18

∴ 228 = 1810
Hexadecimal to Decimal

Example:

Convert (121)16 to Decimal number.

Solution:
1 ∙ 162 + 2 ∙ 161 + (1 ∙ 160 )
= 256 + 32 + 1
= 289

∴ 12116 = 28910
Hexadecimal to Binary
Shortcut Method
Example:

Convert (89)16 into a Binary number.

Solution:

From the table, we can get the binary value of 8 and 9,

hexadecimal base numbers.

8 = 1000 and 9 = 1001

∴ (89)16 = (10001001)2
Octal to Binary
(Shortcut)
Example:
Convert (214)8 into a Binary number.
Solution:
From the table,
2 = 010
1 = 001
4 = 100

∴ 2148 = (010001100)2
End of
Presentation! Number Theory
Number System

Prepared by:
Ms. Loque