QUESTION 1:

Identify which property is this?

(a x b) x c= ax(b x c )
(5•3)•7 =5•(3•7)
15•7 =5•21
105 = 105
 QUESTION 2:

This property tells us that

when multiple any no by
zero, the product is always
zero?
 QUESTION 3:

Give the properties

of multiplication?
 QUESTION 4:

Is 248 81 is an example
of multiplication w/ or
w/out regrouping?
 QUESTION 5:

Give one example of

commutative
property?
 QUESTION 6:

A mathematical
operation that indicates
how many times a
number is added to itself.
 QUESTION 7:

Also known as scientific

notation or exponential
form
 QUESTION 8:

It is a number of times the

multiplication/division is
repeated.
 QUESTION 9:

Is 27 a prime or composite
number?
 QUESTION 10:

Is 48 divisible by 2 and 8
Yes or No?
OBJECTIVES:
• Differentiate prime from composite numbers.
• Write a given number as a product of its
prime factors; and
• Solve word problems involving prime
and composite numbers.
PRIME AND COMPOSITE NUMBER
Prime Numbers
-Is a whole number greater than 1 which has only two
factors, 1 and itself.
Example: 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37.

Composite Numbers
-A composite number is a positive integer divisible by
smaller positive integers other than 1 and itself.
Example: 4, 6, 8, 9, 10, 12, 14, 15, 16, 18, 20, 21,……..
PRODUCT
-Is an answer of to a multiplication
number.
7 x 8= 56
PRODUCT

FACTORS
-Are number being multiplied to find the
product.
56 ÷ 8 =7
FACTORS
Try this:
Tell whether each of the
following numbers is prime or
composite.
1. 51
2. 37
3. 48
TryTry this: this!
to solve
Tell
Jairyllwhether each
is thinking of the
of composite
following
number between numbers
60 andis
70.prime
The or
number
composite.has prime factors that have
the sum of 12. What is Jairyll
1. 51
number?
2. 37
3. 48
OBJECTIVES:
•Identify the divisibility rules for one-digit
numbers and selected two-digit numbers
•Solve routine and non-routine problems
involving divisibility rules.
 DIVISIBILITY RULES
A divisibility rule is a kind of shortcut that helps us to
identify if a given number is divisible by a divisor by
examining its digits, without performing the long
division process. These divisibility rules help us
determine the actual divisor of a number just by
considering the digits of that number. These are also
called divisibility tests which help in larger calculations
and ease out the process of simplification of numbers.
Divisibility rule for 2
The divisibility rule for 2 states that any number
with the last digit of 0, 2, 4, 6, or 8 will be
divisible by 2. Simply put, any even number
(numbers that end in 0, 2, 4, 6, or 8 is divisible by
2. If the number is not an even number, it is not
divisible by two.
Divisibility rule for 3
A number is divisible by 3, if the sum of
its all digits is a multiple of 3 or
divisibility by 3.
Divisibility rule for 4
A number is divisible by 4, if the last two
digits of a whole number are divisible by
4.
Divisibility rule for 5
A number is divisible by 5, if the
last digit of a number is either 0 or
5.
Divisibility rule for 6
A number is divisible by 6, if the
digits are divisible by 2 and 3 both.
Divisibility rule for 7
A number is divisible by 7, if the
difference between twice the unit digit of
the given number and the remaining part of
the given number should be a multiple of 7
or it should be equal to 0
Divisibility rule for 8
A number is divisible by 8, if the
last digits of a given number are
divisible by 8, then such a
number is divisible by 8. Divisibility rule for 9
A number is divisible by 9, if
the sum of the digits of the
numbers is divisible by 9.
Divisibility rule for 10
A number is divisible by
10 is it end in a 0.
Objectives:
• Find the factors of a number
• Find the common factors and the greatest common factors
(GCF) of two to three numbers using the following methods:
listing, prime factorization, continuous division, and
Euclidean algorithm; and
• Solve real-life problems involving GCF of 2-3 given
numbers.
Scenario: Gardening Project
Imagine a community gardening project where residents are
collaborating to beautify a communal space with flowers. There are
three different types of flower seeds available, and the community
wants to plant them in such a way that they create the most visually
appealing pattern.
Problem: The community has 36 rose seeds, 48 sunflower seeds, and
60 daisy seeds. The residents want to create as many identical flower
arrangements as possible, ensuring that each arrangement has an equal
number of each type of flower. They want to know the largest number
of arrangements they can create.
Listing Method
-The listing method is one of the approaches used to find the Greatest
Common Factor (GCF) of two or more numbers. It involves listing all
the factors of each number and identifying the common factors. The
GCF is then determined by multiplying together these common factors.
List the Factors:
Start by listing all the factors of each number. A factor is a number that divides
another number without leaving a remainder.
List the factors of each number in a column.
Identify Common Factors:
Identify the common factors that appear in the lists for all the numbers. These
are the numbers that are common to the factor lists of all the given numbers.
Find the Greatest Common Factor:
Determine the greatest common factor (GCF) by selecting the largest number
that is common to all the factor lists.
Prime Factorization Method:
Prime factorization is the process of expressing a number as
the product of its prime factors. Prime factors are prime
numbers that multiply together to give the original number.

Step 1: Divide the given number by the smallest prime number.

Step 2: Again, divide the quotient by the smallest prime number.
Step 3: Repeat the process, until the quotient becomes 1.
Step 4: Finally, multiply all the prime factors.
Continuous Division Method
In continuous division method, we continue dividing
the given numbers by a common prime number until
the quotients are relatively prime.
Step 1 - Divide the larger number by the smaller number
using long division.
Step 2 - If the remainder is 0, then the divisor is the GCF.
Step 3 - If the remainder is 0, then the divisor of the last
division is the GCF.
Euclidean Algorithm
Euclidean algorithm or Euclid's algorithm, is an efficient
method for computing the greatest common divisor (GCD) of
two integers (numbers), the largest number that divides them
both without a remainder.
Steps:
• Divide the bigger number by the smaller. If there is no
remainder then the divisor (smaller number) is the GCF. If
there is a remainder, proceed to step 2.
• Divide the smaller number by the remainder. If there is no
remainder, then the divisor is the GCF. If there is a remainder,
repeat the process.
Do This!

Find the GCF of 882, 424 and

248 using the Euclidean
Algorithm.
OBJECTIVES:
• Find the multiple of a number;
• Find the common multiples and least common
multiples (LCM) of two or
more numbers using the following methods: listing,
prime factorization, and continuous division.
• Solve real-life problems involving LCM of 2-3
given numbers.
LEAST COMMON MULTIPLE
LCM is the short form for “ Least
Common Multiple” The least common
multiple is defined as the smallest
multiple that two or more number
have in common.
How to find Least Common Multiple (LCM)?

Methods to determine the LCM of a set of

number are:
•Listing Multiplier Methods
• Prime Factorization
• Division Method
LISTING MULTIPLIES METHOD:

To find the LCM using multiples, list the multiples of the

numbers in the table as shown. The least common
multiple is the first common multiple for the given
numbers.

Multiples of 12 12 24 36 48 60 72

Multiples of 16 16 32 48 64 80 96
PRIME FACTORIZATION

The prime factorization method

involves finding the prime factors of
the given numbers and identifying
the least common multiple (LCM)
DIVISION METHOD

In this method, the given numbers are divided by

the common divisors until there is no possible
further division by the same numbers. The divisor
and the remainders are multiplied to obtain the
least common multiple.
Solve this!

You want to bake chocolate chip cookies every

12 days and oatmeal cookies every 15 days.
What is the least common multiple of these
intervals, and how often will you bake both types
of cookies on the same day?