Study guide

2.2 Prime Factors, Divisibility, GCF & LCM

Ontario Mathematics Proficiency Test MPT

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Introduction & Exam Overview

1.1 Ontario MPT Format, Scoring & Certification Requirements 1.2 The MPT Blueprint: Content Dimensions, Pedagogy Dimensions & Pacing

2 Chapter 2: Number Sense & Basic Operations

2.1 Whole Numbers, Place Value, Integers & Order of Operations 2.2 Prime Factors, Divisibility, GCF & LCM 2.3 Exponents, Powers & Scientific Notation

3 Chapter 3: Rational Numbers & Proportional Reasoning

3.1 Fractions: Types, Equivalencies & Operations 3.2 Decimals, Percents & Conversions 3.3 Ratios, Rates, Unit Rates & Proportions 3.4 Ordering & Comparing Whole Numbers, Integers, Decimals & Fractions

4 Chapter 4: Algebra, Patterning & Expressions

4.1 Patterning, Sequences & Functional Rules 4.2 Polynomial Terminology & Simplifying Algebraic Expressions 4.3 Solving Linear Equations & Inequalities

5 Chapter 5: Linear Relations & Computational Thinking

5.1 Linear Relations, Rate of Change & Slope 5.2 Direct vs. Partial Variations & Word Problems 5.3 Coding & Computational Thinking in Ontario Math 5.4 Solving Linear Systems Graphically

6 Chapter 6: Spatial Sense, Geometry & Measurement

6.1 Geometric Properties & Angle Relationships 6.2 Metric System & Unit Conversions 6.3 Perimeter & Area of 2D Polygons & Circles

7 Chapter 7: 3D Geometry, Pythagorean Theorem & Transformations

7.1 Surface Area & Volume of 3D Prisms & Cylinders 7.2 The Pythagorean Relationship & Right-Triangle Problems 7.3 Coordinate Plane & Geometric Transformations

8 Chapter 8: Data Management & Statistics

8.1 Data Collection, Organization & Sampling 8.2 Graphical Representations of Data 8.3 Measures of Central Tendency & Data Spread

9 Chapter 9: Probability

9.1 Simple Probability & Theoretical vs. Experimental 9.2 Compound Events, Tree Diagrams & Independence

10 Chapter 10: Financial Literacy

10.1 Money, Budgeting & Gross vs. Net Income 10.2 Sales Tax (HST), Discounts & Purchasing Power 10.3 Simple & Compound Interest & Borrowing Costs

11 Chapter 11: Mathematics Pedagogy & Assessment

11.1 Ontario Math Curriculum & Mathematical Processes 11.2 Instructional Frameworks: CPA & Three-Part Lesson 11.3 Assessment & Evaluation under Growing Success 11.4 Growing Success: Fundamental Principles & Learning Skills and Work Habits

12 Chapter 12: Inclusive Pedagogy & Differentiated Instruction

12.1 Universal Design for Learning (UDL) & Differentiated Instruction 12.2 Supporting English Language Learners & Diverse Learners 12.3 Cultivating Growth Mindset & Reducing Math Anxiety 12.4 Learning for All: Instructional Approaches, the Tiered Approach & Planning Assessment and Instruction

2.2 Prime Factors, Divisibility, GCF & LCM

Key Takeaways Explain This Topic AI

Prime numbers possess exactly two distinct factors (1 and the number itself), making 0 and 1 neither prime nor composite, and 2 the unique even prime.

Divisibility rules allow rapid identification of factors; for example, a number is divisible by 6 if it passes both the evenness test (divisible by 2) and the digital sum test (divisible by 3).

The Fundamental Theorem of Arithmetic guarantees that every composite number has a unique prime factorization, expressed in standard index notation.

The Greatest Common Factor (GCF) is calculated by multiplying the lowest powers of common prime factors, whereas the Least Common Multiple (LCM) takes the highest powers of all prime factors present.

For any two positive integers a a a and b b b , the relationship GCF ( a , b ) × LCM ( a , b ) = a × b \text{GCF}(a,b) \times \text{LCM}(a,b) = a \times b GCF ( a , b ) × LCM ( a , b ) = a × b holds true and serves as an efficient verification tool.

Last updated: August 2026

Prime Factors, Divisibility, GCF & LCM

Understanding the structural composition of whole numbers through prime factors, divisibility tests, and common multiples is a core strand of the Ontario Grades 4–8 mathematics curriculum. EQAO's published Number Sense skills name operations with whole numbers, integers, decimals and fractions rather than factorization as such, but GCF and LCM are the machinery those operations run on: you cannot add unlike fractions without a common multiple, and you cannot reduce a result to lowest terms without a common factor. Expect these techniques to appear inside fraction, ratio, and proportional-reasoning items rather than as standalone "find the GCF" questions.

Prime vs. Composite Numbers

Prime Number : A positive integer strictly greater than 1 1 1 that has exactly two distinct positive factors : 1 1 1 and itself.

Composite Number : A positive integer strictly greater than 1 1 1 that has more than two factors (it can be divided evenly by numbers other than 1 1 1 and itself).

  • Warning
  • Special Cases: 0 and 1

1 1 1 is NEITHER prime nor composite. It has only one positive factor ( 1 1 1 ).

0 0 0 is NEITHER prime nor composite. It has infinitely many factors because any non-zero number divides 0 0 0 ( 0 ÷ n = 0 0 \div n = 0 0 ÷ n = 0 ).

2 2 2 is the ONLY EVEN PRIME NUMBER. All other even numbers are composite because they have 2 2 2 as a factor.

Primes Under 50

There are 15 prime numbers less than 50: 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47 2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 , 31 , 37 , 41 , 43 , 47

Ontario Curriculum Divisibility Rules

Divisibility rules allow teacher candidates to quickly determine if an integer is divisible by another without performing full long division.

Divisor Divisibility Condition Example & Verification

2 The last digit is even ( 0 , 2 , 4 , 6 , 8 0, 2, 4, 6, 8 0 , 2 , 4 , 6 , 8 ). 4 , 738 → 4,738 \rightarrow 4 , 738 → last digit is 8 8 8 (Even ✓ \checkmark ✓ )

3 The sum of all digits is divisible by 3 3 3 . 8 , 514 → 8 + 5 + 1 + 4 = 18 8,514 \rightarrow 8+5+1+4 = 18 8 , 514 → 8 + 5 + 1 + 4 = 18 ( 18 ÷ 3 = 6 ✓ 18 \div 3 = 6 \checkmark 18 ÷ 3 = 6 ✓ )

4 The number formed by the last two digits is divisible by 4 4 4 . 9 , 532 → 9,532 \rightarrow 9 , 532 → last two digits 32 32 32 ( 32 ÷ 4 = 8 ✓ 32 \div 4 = 8 \checkmark 32 ÷ 4 = 8 ✓ )

5 The last digit is 0 0 0 or 5 5 5 . 7 , 495 → 7,495 \rightarrow 7 , 495 → last digit is 5 5 5 (Valid ✓ \checkmark ✓ )

6 The number is divisible by BOTH 2 and 3 . 3 , 816 → 3,816 \rightarrow 3 , 816 → Even ( 6 6 6 ) AND sum 3 + 8 + 1 + 6 = 18 3+8+1+6=18 3 + 8 + 1 + 6 = 18 ( 18 ÷ 3 = 6 ✓ 18 \div 3 = 6 \checkmark 18 ÷ 3 = 6 ✓ )

8 The number formed by the last three digits is divisible by 8 8 8 . 14 , 816 → 14,816 \rightarrow 14 , 816 → last three digits 816 816 816 ( 816 ÷ 8 = 102 ✓ 816 \div 8 = 102 \checkmark 816 ÷ 8 = 102 ✓ )

9 The sum of all digits is divisible by 9 9 9 . 47 , 232 → 4 + 7 + 2 + 3 + 2 = 18 47,232 \rightarrow 4+7+2+3+2 = 18 47 , 232 → 4 + 7 + 2 + 3 + 2 = 18 ( 18 ÷ 9 = 2 ✓ 18 \div 9 = 2 \checkmark 18 ÷ 9 = 2 ✓ )

10 The last digit is 0 0 0 . 85 , 940 → 85,940 \rightarrow 85 , 940 → last digit is 0 0 0 (Valid ✓ \checkmark ✓ )

  • Prime Factorization & Factor Trees
  • The Fundamental Theorem of Arithmetic

Every integer greater than 1 1 1 is either a prime number itself or can be represented as a unique product of prime numbers (up to the order of factors).

Constructing a Factor Tree

To find the prime factorization of a number (e.g., 360 360 360 ):

Split 360 360 360 into any two factors: 360 = 18 × 20 360 = 18 \times 20 360 = 18 × 20 .

Split 18 18 18 into 2 × 9 2 \times 9 2 × 9 , and 20 20 20 into 4 × 5 4 \times 5 4 × 5 .

Continue splitting composite factors until all branch ends are prime numbers:

  • 9 = 3 × 3 9 = 3 \times 3 9 = 3 × 3
  • 4 = 2 × 2 4 = 2 \times 2 4 = 2 × 2

Collect all prime ends: 2 , 2 , 2 , 3 , 3 , 5 2, 2, 2, 3, 3, 5 2 , 2 , 2 , 3 , 3 , 5 .

Write in Standard Prime Index Form : 360 = 2 3 × 3 2 × 5 1 360 = 2^3 \times 3^2 \times 5^1 360 = 2 3 × 3 2 × 5 1 360

  • / \
  • 18 x 20
  • / \ / \
  • 2 x 9 4 x 5
  • /\ /\
  • 3 3 2 2
  • GCF & LCM Algorithms
  • 1. Greatest Common Factor (GCF)

The largest positive integer that divides each of two or more integers without a remainder.

Prime Factor Rule : Express each number in prime index form. The GCF is the product of the lowest power of each common prime factor.

2. Least Common Multiple (LCM)

The smallest positive integer that is divisible by each of two or more integers.

Prime Factor Rule : Express each number in prime index form. The LCM is the product of the highest power of every prime factor present across all numbers.

Fundamental Product Identity

For any two positive integers a a a and b b b : GCF ( a , b ) × LCM ( a , b ) = a × b \text{GCF}(a, b) \times \text{LCM}(a, b) = a \times b GCF ( a , b ) × LCM ( a , b ) = a × b

Contextual Application Matrix: Word Problem Strategy

When faced with MPT contextual word problems, use this quick reference table to determine whether to solve for GCF or LCM:

Problem Scenario Indicator Required Tool Example Context

Splitting resources into equal groups or identical packages without remainders. GCF Packing 72 pencils and 90 notebooks into max identical student kits.

Cutting items into equal maximum lengths or tiling rectangular areas with squares. GCF Cutting wood boards of 120 cm and 180 cm into equal longest pegs.

Finding simultaneous occurrences or overlapping schedules . LCM Two alarm bells ringing every 12 and 18 minutes sounding together.

Purchasing items in different package quantities to get an equal number of each. LCM Hot dogs (packs of 10) and buns (packs of 8) for a barbecue.

  • Detailed Step-by-Step Worked Examples
  • Example 2.2.1: Factor Tree & Prime Index Form

Construct the prime factorization of 504 504 504 using the factor tree method and express the answer in standard prime index form.

Solution Step-by-Step:

First Factor Pair : Notice 504 504 504 is even. Divide by 2 2 2 : 504 = 2 × 252 504 = 2 \times 252 504 = 2 × 252

Decompose 252 252 252 : Sum of digits is 2 + 5 + 2 = 9 2+5+2=9 2 + 5 + 2 = 9 , so it is divisible by 9 9 9 : 252 = 9 × 28 252 = 9 \times 28 252 = 9 × 28

Decompose Prime Branches :

  • 9 = 3 × 3 9 = 3 \times 3 9 = 3 × 3
  • 28 = 4 × 7 = 2 × 2 × 7 28 = 4 \times 7 = 2 \times 2 \times 7 28 = 4 × 7 = 2 × 2 × 7

Gather All Prime Terminals :

Primes are: 2 , 3 , 3 , 2 , 2 , 7 2, 3, 3, 2, 2, 7 2 , 3 , 3 , 2 , 2 , 7 .

Group and Express with Exponents :

  • Count of 2 2 2 s: 3 ⟶ 2 3 3 \longrightarrow 2^3 3 ⟶ 2 3
  • Count of 3 3 3 s: 2 ⟶ 3 2 2 \longrightarrow 3^2 2 ⟶ 3 2

Count of 7 7 7 s: 1 ⟶ 7 1 1 \longrightarrow 7^1 1 ⟶ 7 1 504 = 2 3 × 3 2 × 7 1 504 = 2^3 \times 3^2 \times 7^1 504 = 2 3 × 3 2 × 7 1

  • Final Answer: 2 3 × 3 2 × 7 1 2^3 \times 3^2 \times 7^1 2 3 × 3 2 × 7 1
  • Example 2.2.2: GCF and LCM of Three Numbers

Determine the Greatest Common Factor (GCF) and Least Common Multiple (LCM) of 72 72 72 , 108 108 108 , and 120 120 120 .

Solution Step-by-Step:

Write Prime Factorizations :

  • 72 = 8 × 9 = 2 3 × 3 2 72 = 8 \times 9 = 2^3 \times 3^2 72 = 8 × 9 = 2 3 × 3 2
  • 108 = 4 × 27 = 2 2 × 3 3 108 = 4 \times 27 = 2^2 \times 3^3 108 = 4 × 27 = 2 2 × 3 3
  • 120 = 8 × 15 = 2 3 × 3 1 × 5 1 120 = 8 \times 15 = 2^3 \times 3^1 \times 5^1 120 = 8 × 15 = 2 3 × 3 1 × 5 1

Calculate GCF (Product of Lowest Powers of COMMON Factors) :

Common prime factors present in ALL three numbers are 2 2 2 and 3 3 3 .

Lowest power of base 2 2 2 : min ⁡ ( 3 , 2 , 3 ) = 2 2 \min(3, 2, 3) = 2^2 min ( 3 , 2 , 3 ) = 2 2

Lowest power of base 3 3 3 : min ⁡ ( 2 , 3 , 1 ) = 3 1 \min(2, 3, 1) = 3^1 min ( 2 , 3 , 1 ) = 3 1 GCF = 2 2 × 3 1 = 4 × 3 = 12 \text{GCF} = 2^2 \times 3^1 = 4 \times 3 = 12 GCF = 2 2 × 3 1 = 4 × 3 = 12

Calculate LCM (Product of Highest Powers of ALL Factors) :

All prime factors present: 2 , 3 , 5 2, 3, 5 2 , 3 , 5 .

  • Highest power of base 2 2 2 : max ⁡ ( 3 , 2 , 3 ) = 2 3 \max(3, 2, 3) = 2^3 max ( 3 , 2 , 3 ) = 2 3
  • Highest power of base 3 3 3 : max ⁡ ( 2 , 3 , 1 ) = 3 3 \max(2, 3, 1) = 3^3 max ( 2 , 3 , 1 ) = 3 3

Highest power of base 5 5 5 : max ⁡ ( 0 , 0 , 1 ) = 5 1 \max(0, 0, 1) = 5^1 max ( 0 , 0 , 1 ) = 5 1 LCM = 2 3 × 3 3 × 5 1 = 8 × 27 × 5 = 1 , 080 \text{LCM} = 2^3 \times 3^3 \times 5^1 = 8 \times 27 \times 5 = 1,080 LCM = 2 3 × 3 3 × 5 1 = 8 × 27 × 5 = 1 , 080

  • Final Answer: GCF = 12 \text{GCF} = 12 GCF = 12 ; LCM = 1 , 080 \text{LCM} = 1,080 LCM = 1 , 080
  • Example 2.2.3: Integrated Dual MPT Word Problem

An Ontario school coordinator has 96 96 96 blue markers, 144 144 144 red markers, and 120 120 120 green markers.

What is the maximum number of identical activity kits she can assemble such that all markers are distributed evenly with no remainders, and how many red markers are in each kit?

If two automated school bells ring every 18 18 18 minutes and 24 24 24 minutes respectively, and they ring simultaneously at 8:00 AM, at what time will they next ring together?

Solution Step-by-Step:

Part 1: Kit Distribution (GCF Problem)

Prime Factorizations:

  • 96 = 2 5 × 3 1 96 = 2^5 \times 3^1 96 = 2 5 × 3 1
  • 144 = 2 4 × 3 2 144 = 2^4 \times 3^2 144 = 2 4 × 3 2
  • 120 = 2 3 × 3 1 × 5 1 120 = 2^3 \times 3^1 \times 5^1 120 = 2 3 × 3 1 × 5 1

GCF = 2 min ⁡ ( 5 , 4 , 3 ) × 3 min ⁡ ( 1 , 2 , 1 ) = 2 3 × 3 1 = 8 × 3 = 24 \text{GCF} = 2^{\min(5,4,3)} \times 3^{\min(1,2,1)} = 2^3 \times 3^1 = 8 \times 3 = 24 GCF = 2 m i n ( 5 , 4 , 3 ) × 3 m i n ( 1 , 2 , 1 ) = 2 3 × 3 1 = 8 × 3 = 24 kits.

Red markers per kit: 144 total red 24 kits = 6 \frac{144 \text{ total red}}{24 \text{ kits}} = 6 24 kits 144 total red ​ = 6 red markers per kit.

Part 2: Bell Overlap (LCM Problem)

Prime Factorizations:

  • 18 = 2 1 × 3 2 18 = 2^1 \times 3^2 18 = 2 1 × 3 2
  • 24 = 2 3 × 3 1 24 = 2^3 \times 3^1 24 = 2 3 × 3 1

LCM = 2 max ⁡ ( 1 , 3 ) × 3 max ⁡ ( 2 , 1 ) = 2 3 × 3 2 = 8 × 9 = 72 \text{LCM} = 2^{\max(1,3)} \times 3^{\max(2,1)} = 2^3 \times 3^2 = 8 \times 9 = 72 LCM = 2 m a x ( 1 , 3 ) × 3 m a x ( 2 , 1 ) = 2 3 × 3 2 = 8 × 9 = 72 minutes.

Convert 72 72 72 minutes to hours and minutes: 72 min = 1 hour 12 minutes 72 \text{ min} = 1 \text{ hour } 12 \text{ minutes} 72 min = 1 hour 12 minutes .

Add to 8:00 AM: 8 : 00 AM + 1 h 12 m = 9 : 12 AM 8:00 \text{ AM} + 1 \text{h } 12 \text{m} = 9:12 \text{ AM} 8 : 00 AM + 1 h 12 m = 9 : 12 AM .

Final Answer: Max kits = 24 24 24 (with 6 6 6 red markers per kit); Next simultaneous chime = 9:12 AM.