Study guide

2.3 Number Theory: Factors, Multiples, Primes, GCF & LCM

Praxis Elementary Education: Mathematics Subtest 5003

Track your progress as you read

Finished sections get a check mark.

1 Chapter 1: Introduction & Exam Overview

1.1 Exam Facts, Format & Calculator Usage 1.2 Test-Taking Strategies & Mathematical Reasoning

2 Chapter 2: Number Sense, Place Value & Whole Number Operations

2.1 Place Value System & Number Representations 2.2 Whole Number Operations & Estimation Strategies 2.3 Number Theory: Factors, Multiples, Primes, GCF & LCM

3 Chapter 3: Rational Numbers, Proportional Reasoning & Percentages

3.1 Fractions & Mixed Numbers: Concepts & Operations 3.2 Decimals & Order of Operations 3.3 Ratios, Rates & Proportional Reasoning 3.4 Percentages & Real-World Applications

4 Chapter 4: Algebraic Expressions, Equations & Inequalities

4.1 Algebraic Expressions & Variable Evaluation 4.2 Solving One-Step & Multi-Step Linear Equations 4.3 Linear Inequalities & Word Problem Translations 4.4 Properties of Operations & Algebraic Principles

5 Chapter 5: Patterns, Relations & Functions

5.1 Number Patterns & Sequences 5.2 Input-Output Tables & Functional Relationships 5.3 Coordinate Plane & Linear Graphing

6 Chapter 6: Geometry & Spatial Reasoning

6.1 Two-Dimensional Shapes & Properties of Polygons 6.2 Three-Dimensional Figures, Nets & Spatial Reasoning 6.3 Perimeter, Area & Circumference 6.4 Surface Area & Volume 6.5 Geometric Transformations & Symmetry 6.6 Measurement: Elapsed Time, Money, Units & Conversions

7 Chapter 7: Data Analysis, Statistics & Probability

7.1 Data Representation & Graph Interpretation 7.2 Measures of Center & Spread 7.3 Probability & Counting Principles

2.3 Number Theory: Factors, Multiples, Primes, GCF & LCM

Key Takeaways Explain This Topic AI

The number 1 is neither prime nor composite; 2 is the smallest prime number and the only even prime number.

Divisibility rules for 3 and 9 require checking the sum of all digits, while rules for 4 and 8 examine only the last two or three digits, respectively.

Using prime factorizations, the GCF takes the lowest power of all shared prime factors, while the LCM takes the highest power of every prime factor present.

GCF word problems involve splitting items into equal groups without leftovers, whereas LCM word problems involve repeating cycle events that align at the same future time.

Last updated: July 2026

  • 2.3 Number Theory: Factors, Multiples, Primes, GCF & LCM
  • Primes, Composites & Prime Factorization

Number theory focuses on the properties and relationships of integers. Understanding prime numbers, composite numbers, factors, and multiples provides the bedrock for fraction arithmetic and algebraic reasoning.

Definitions

Factor (Divisor) : A whole number that divides another whole number evenly, with no remainder.

Multiple : The product of a given whole number and any non-zero whole number.

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

The first ten prime numbers are: 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 2, 3, 5, 7, 11, 13, 17, 19, 23, 29 2 , 3 , 5 , 7 , 11 , 13 , 17 , 19 , 23 , 29 .

Note: 2 2 2 is the smallest prime number and the ONLY even prime number.

Composite Number : A whole number greater than 1 1 1 that has more than two distinct positive factors.

Examples: 4 , 6 , 8 , 9 , 10 , 12 , 14 , 15 4, 6, 8, 9, 10, 12, 14, 15 4 , 6 , 8 , 9 , 10 , 12 , 14 , 15 .

Warning

The Special Cases of 0 and 1 : The number 1 1 1 is neither prime nor composite because it has only one positive factor ( 1 1 1 ). The number 0 0 0 is neither prime nor composite because it has infinitely many factors.

Prime Factorization & The Fundamental Theorem of Arithmetic

The Fundamental Theorem of Arithmetic states that 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 the factors.

Method 1: Factor Tree To find the prime factorization of 360 360 360 :

Branch 360 360 360 into any two factors: 36 × 10 36 \times 10 36 × 10 .

Branch 36 36 36 into 6 × 6 6 \times 6 6 × 6 and 10 10 10 into 2 × 5 2 \times 5 2 × 5 .

Branch 6 6 6 into 2 × 3 2 \times 3 2 × 3 and the other 6 6 6 into 2 × 3 2 \times 3 2 × 3 .

Collect all prime ends: 2 × 2 × 2 × 3 × 3 × 5 = 2 3 × 3 2 × 5 1 2 \times 2 \times 2 \times 3 \times 3 \times 5 = 2^3 \times 3^2 \times 5^1 2 × 2 × 2 × 3 × 3 × 5 = 2 3 × 3 2 × 5 1 .

Method 2: Ladder / Division Method Divide successively by the smallest prime numbers:

  • 360 ÷ 2 = 180 360 \div 2 = 180 360 ÷ 2 = 180
  • 180 ÷ 2 = 90 180 \div 2 = 90 180 ÷ 2 = 90
  • 90 ÷ 2 = 45 90 \div 2 = 45 90 ÷ 2 = 45
  • 45 ÷ 3 = 15 45 \div 3 = 15 45 ÷ 3 = 15
  • 15 ÷ 3 = 5 15 \div 3 = 5 15 ÷ 3 = 5

5 ÷ 5 = 1 5 \div 5 = 1 5 ÷ 5 = 1 Prime factors: 2 × 2 × 2 × 3 × 3 × 5 = 2 3 × 3 2 × 5 1 2 \times 2 \times 2 \times 3 \times 3 \times 5 = 2^3 \times 3^2 \times 5^1 2 × 2 × 2 × 3 × 3 × 5 = 2 3 × 3 2 × 5 1 .

Divisibility Rules

Divisibility rules enable candidates to test quickly whether a number is divisible by another without performing full long division.

Divisor Divisibility Condition Example & Test

2 Last digit is even ( 0 , 2 , 4 , 6 , 8 0, 2, 4, 6, 8 0 , 2 , 4 , 6 , 8 ) 3 , 854 → 3,854 \rightarrow 3 , 854 → Last digit is 4 4 4 (even) → \rightarrow → Divisible by 2 2 2 .

3 Sum of all digits is divisible by 3 3 3 4 , 521 → 4 + 5 + 2 + 1 = 12 4,521 \rightarrow 4+5+2+1 = 12 4 , 521 → 4 + 5 + 2 + 1 = 12 ( 12 ÷ 3 = 4 12 \div 3 = 4 12 ÷ 3 = 4 ) → \rightarrow → Divisible by 3 3 3 .

4 Number formed by last two digits is divisible by 4 4 4 7 , 316 → 7,316 \rightarrow 7 , 316 → Last two digits 16 16 16 ( 16 ÷ 4 = 4 16 \div 4 = 4 16 ÷ 4 = 4 ) → \rightarrow → Divisible by 4 4 4 .

5 Last digit is 0 0 0 or 5 5 5 9 , 845 → 9,845 \rightarrow 9 , 845 → Last digit is 5 → 5 \rightarrow 5 → Divisible by 5 5 5 .

6 Number is divisible by both 2 2 2 and 3 3 3 6 , 132 → 6,132 \rightarrow 6 , 132 → Even ( 2 2 2 ) AND sum 6 + 1 + 3 + 2 = 12 6+1+3+2=12 6 + 1 + 3 + 2 = 12 ( 3 3 3 ) → \rightarrow → Divisible by 6 6 6 .

8 Number formed by last three digits is divisible by 8 8 8 54 , 116 → 116 ÷ 8 = 14.5 54,116 \rightarrow 116 \div 8 = 14.5 54 , 116 → 116 ÷ 8 = 14.5 (No); 54 , 128 → 128 ÷ 8 = 16 54,128 \rightarrow 128 \div 8 = 16 54 , 128 → 128 ÷ 8 = 16 → \rightarrow → Divisible by 8 8 8 .

9 Sum of all digits is divisible by 9 9 9 8 , 496 → 8 + 4 + 9 + 6 = 27 8,496 \rightarrow 8+4+9+6 = 27 8 , 496 → 8 + 4 + 9 + 6 = 27 ( 27 ÷ 9 = 3 27 \div 9 = 3 27 ÷ 9 = 3 ) → \rightarrow → Divisible by 9 9 9 .

10 Last digit is 0 0 0 4 , 930 → 4,930 \rightarrow 4 , 930 → Last digit is 0 → 0 \rightarrow 0 → Divisible by 10 10 10 .

  • Greatest Common Factor (GCF) & Least Common Multiple (LCM)
  • Definitions & Calculation Methods

Greatest Common Factor (GCF) : The largest whole number that divides evenly into two or more numbers.

Least Common Multiple (LCM) : The smallest positive whole number that is a multiple of two or more numbers.

Method: Prime Factorization (Exponential Comparison)

To find the GCF and LCM of 48 48 48 and 72 72 72 :

Write prime factorizations: 48 = 2 4 × 3 1 48 = 2^4 \times 3^1 48 = 2 4 × 3 1 72 = 2 3 × 3 2 72 = 2^3 \times 3^2 72 = 2 3 × 3 2

GCF Rule : Take the MINIMUM exponent of each shared prime factor. GCF ( 48 , 72 ) = 2 min ⁡ ( 4 , 3 ) × 3 min ⁡ ( 1 , 2 ) = 2 3 × 3 1 = 8 × 3 = 24 \text{GCF}(48, 72) = 2^{\min(4,3)} \times 3^{\min(1,2)} = 2^3 \times 3^1 = 8 \times 3 = \mathbf{24} GCF ( 48 , 72 ) = 2 m i n ( 4 , 3 ) × 3 m i n ( 1 , 2 ) = 2 3 × 3 1 = 8 × 3 = 24

LCM Rule : Take the MAXIMUM exponent of every prime factor present. LCM ( 48 , 72 ) = 2 max ⁡ ( 4 , 3 ) × 3 max ⁡ ( 1 , 2 ) = 2 4 × 3 2 = 16 × 9 = 144 \text{LCM}(48, 72) = 2^{\max(4,3)} \times 3^{\max(1,2)} = 2^4 \times 3^2 = 16 \times 9 = \mathbf{144} LCM ( 48 , 72 ) = 2 m a x ( 4 , 3 ) × 3 m a x ( 1 , 2 ) = 2 4 × 3 2 = 16 × 9 = 144

Useful Formula Relationship

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

Verification for 48 48 48 and 72 72 72 : 48 × 72 = 3 , 456 and 24 × 144 = 3 , 456 ✓ 48 \times 72 = 3,456 \quad \text{and} \quad 24 \times 144 = 3,456 \quad \checkmark 48 × 72 = 3 , 456 and 24 × 144 = 3 , 456 ✓

Real-World Word Problems: GCF vs. LCM

A core skill tested on Praxis 5003 is determining whether a word problem requires finding the GCF or the LCM.

Decision Matrix for Word Problems

Characteristic GCF Problem LCM Problem

Core Goal Splitting/dividing items into smaller equal groups with nothing left over. Repeating cycles/events lining up in the future or finding equal total items.

Key Action Partitioning, grouping, cutting lengths into equal segments. Scheduling, recurring alarms, buying items in packaged sets.

Keywords "maximum number of groups" , "greatest length" , "equal portions without leftovers" "when will they next meet" , "minimum number of packages" , "happens at the same time"

Result Size Result is smaller than or equal to the given numbers. Result is larger than or equal to the given numbers.

Step-by-Step Word Problem Examples

Worked Example 1 (GCF Context) :

A florist has 60 red roses and 84 white tulips. He wants to create identical floral arrangements using all flowers with no flowers left over. What is the maximum number of arrangements he can create, and how many of each flower will be in each arrangement?

Solution :

Recognize problem type: Equal division without leftovers → \rightarrow → GCF .

Prime factorizations: 60 = 2 2 × 3 1 × 5 1 60 = 2^2 \times 3^1 \times 5^1 60 = 2 2 × 3 1 × 5 1 84 = 2 2 × 3 1 × 7 1 84 = 2^2 \times 3^1 \times 7^1 84 = 2 2 × 3 1 × 7 1

Find GCF: GCF ( 60 , 84 ) = 2 2 × 3 1 = 4 × 3 = 12 \text{GCF}(60, 84) = 2^2 \times 3^1 = 4 \times 3 = \mathbf{12} GCF ( 60 , 84 ) = 2 2 × 3 1 = 4 × 3 = 12

Interpret result:

Maximum arrangements = 12 12 12 arrangements .

Red roses per arrangement: 60 ÷ 12 = 5 60 \div 12 = \mathbf{5} 60 ÷ 12 = 5 roses.

White tulips per arrangement: 84 ÷ 12 = 7 84 \div 12 = \mathbf{7} 84 ÷ 12 = 7 tulips.

Worked Example 2 (LCM Context) :

Red flashing lights blink every 15 seconds, and blue flashing lights blink every 20 seconds. If both lights blink simultaneously at 12:00 PM, at what time will they next blink together?

Solution :

Recognize problem type: Repeating periodic cycles lining up → \rightarrow → LCM .

Prime factorizations: 15 = 3 1 × 5 1 15 = 3^1 \times 5^1 15 = 3 1 × 5 1 20 = 2 2 × 5 1 20 = 2^2 \times 5^1 20 = 2 2 × 5 1

Find LCM: LCM ( 15 , 20 ) = 2 2 × 3 1 × 5 1 = 4 × 3 × 5 = 60 seconds \text{LCM}(15, 20) = 2^2 \times 3^1 \times 5^1 = 4 \times 3 \times 5 = \mathbf{60} \text{ seconds} LCM ( 15 , 20 ) = 2 2 × 3 1 × 5 1 = 4 × 3 × 5 = 60 seconds

Interpret result:

60 seconds = 1 minute 60 \text{ seconds} = 1 \text{ minute} 60 seconds = 1 minute .

The lights will next blink together at 12:01 PM .

Loading diagram... GCF vs LCM Problem Solving Flowchart