Code

Code it
it Up!
Up!
17
17 22
22 22 13
13 15
15 13
13 26
26 11
12
12 17
17 44 17
17 11 23
23 26
26
88 13
13 26
26 23
23
14
14 99 11
11 22 23
23 26
26
15
15 26
26 13
13 99 22 13
13 11 22
20
20 17
17 11 22
 Number
Numbertheory
theory

Integers and
Greatest Common
Divisor
 Table
Table of
of contents
contents

01
01 What is Integers?

02
02 What is Greatest Common
Divisor?

03
03 Different Methods to get the
GCD
 Learning
Learning Outcomes
Outcomes

After the discussion, the student should be

able to:
know
know how
how to
to
get
get the
the GCD
GCD
Apply
Apply different
different
methods
methods inin
getting
getting the
the GCD
GCD
 Introduction
Introduction
Studying integers develops
critical thinking, logical
reasoning and problem-
solving abilities which are
useful in daily activities
and in mathematical
concept.
 01

What is Integers?
 Integers
Integers

INTEGERS- An integer is a number with no

decimal or fractional part and it includes negative
and positive numbers, including zero.

POSITIVE NUMBERS: A number is positive if it is

greater than zero.

NEGATIVE NUMBERS: A number is negative if it

is less than zero.

ZERO- is defined as neither a negative number

nor a positive number. It is a whole number.
02 What is Greatest
Common Divisor?
Greatest Common Divisor:
❖ The greatest common divisor (GCD) of two
nonzero integers a and b is the greatest
positive integer d such that d is a divisor of
both a and b.
❖ The greatest common divisor of both a and
b is denoted by gcd(a, b).
❖ Is also called Highest Common Factor.
 03
Methods to
find GCD
 Methods
Methods to
to Find
Find GCD
GCD

Prime
Listing out Long division
factorization
the Factors method
method
 List
List Method
Method

Find the GCD of 24 and 40

Factors of 24: 1, 2, 3, 4, 6, 8,
In this method, we 12, 24.
write down all the Factors of 40: 1, 2, 4, 5, 8, 10,
20, 40.
factors/divisors of Common factors of 24 and 40:
a group of 1, 2, 4, 8.
Therefore, the greatest
numbers. common factor of 24 and 40
is 8.
 Prime
Prime factorization
factorization method
method
Find the greatest common
It is a way of divisor of 24 and 36.
finding the prime
factors of a number,
such that the
original number is
evenly divisible by
these factors.
 Long
Long Division
Division Method
Method

Find the GCD of 16

In this method,
and 60.
we divide the
larger number
by the smaller
number using
long division.
 Euclid's
Euclid's Algorithm
Algorithm

Division includes
Is an algorithm for four numerical
finding the greatest elements:
common divisor
(GCD) between two Dividend= Divisor ×
numbers. Quotient +
Remainder
 Activity
Activity
1. In this method, we write down all the
factors/divisors of a group of numbers.
2. Greatest Common Divisor is also called?
3. Is defined as neither a negative number nor a
positive number. It is a whole number.
4. In this method, we divide the larger number by
the smaller number.
5. Is a number with no decimal or fractional part
and it includes negative and positive numbers,
including zero.
 Activity
Activity

6-7. Find the GCD of 18 and 24 using

prime factorization method.

8-9. Find the GCD of 75 and 180 using

long division method.
10. Find the GCD of 126, 162 and 180
using long division method .
Thank
you!!