Prime factorization expresses an integer greater than 1 as a product of prime factors. For example, 60 can be written as 2 × 2 × 3 × 5, or 2^2 × 3 × 5. This process can be performed using repeated division by prime numbers or a factor tree. In a factor tree, a composite number is repeatedly split into smaller factors until every final factor is prime. The resulting prime factors, including their repetitions, form the prime factorization. This representation is unique apart from the order of the factors and provides a systematic way to analyze the structure of integers.
Prime Factorization
Prime factorization is the process of expressing a composite integer as a product of prime numbers. It is a fundamental method for finding GCD, LCM and simplifying numerical expressions.
| Name | Expression | Description |
|---|---|---|
Prime Factorization | n = p_1 × p_2 × ... × p_k | A positive integer greater than 1 is expressed as a product of prime factors. |
Exponential Form | n = p_1^(a_1) × p_2^(a_2) × ... × p_r^(a_r) | Repeated prime factors are grouped using positive integer exponents. |
Number of Positive Divisors | d(n) = (a_1 + 1)(a_2 + 1)...(a_r + 1) | The prime factorization can be used to calculate the number of positive divisors of n. |
Explanation
Variables
| Symbol | Meaning |
|---|---|
n | The positive integer being factorized. |
p_i | A distinct prime factor of n. |
a_i | The exponent or multiplicity of a prime factor. |
k | The total number of prime factors when repetitions are counted. |
r | The number of distinct prime factors. |
d(n) | The number of positive divisors of n. |
Example or application
A worked example has not yet been added.
Definition
Prime factorization is the representation of an integer greater than 1 as a product of prime numbers, including repeated prime factors when necessary.
Purpose
Prime factorization is used to break composite numbers into their basic prime components and simplify calculations involving factors, multiples and divisibility.
Importance
It is essential for calculating GCD and LCM, simplifying fractions, determining the number of divisors and understanding the Fundamental Theorem of Arithmetic.
Key Concepts
| Name | Description |
|---|---|
Prime Factor | A prime number that divides a given integer exactly. |
Prime Factorization | The expression of an integer as a product of prime factors. |
Factor Tree | A branching diagram that repeatedly splits a composite number into factors until only primes remain. |
Repeated Prime Factor | A prime number that appears more than once in a factorization. |
Exponent Form | A compact representation of repeated prime factors using exponents. |
Characteristics
Prime factorization applies to integers greater than 1.
Every factor in a complete prime factorization is prime.
Repeated prime factors must be included.
Prime factorization can be performed using repeated division or factor trees.
The order of prime factors does not change the product.
Every integer greater than 1 has a unique prime factorization apart from the order of factors.
Prime factorization provides a foundation for GCD and LCM calculations.
Types
| Name | Description |
|---|---|
Repeated Division Method | A method in which a number is repeatedly divided by prime numbers until the quotient becomes 1. |
Factor Tree Method | A visual method that breaks a composite number into smaller factors until all leaves are prime. |
Expanded Prime Factorization | A representation in which all prime factors are written individually, including repetitions. |
Exponential Prime Factorization | A compact representation that uses exponents for repeated prime factors. |
Components
| Name | Description |
|---|---|
Original Number | The integer being expressed as a product of primes. |
Prime Factors | The prime numbers whose product equals the original number. |
Multiplicity | The number of times a particular prime factor appears. |
Exponent | The number of occurrences of a repeated prime factor. |
Properties
| Name | Expression | Description |
|---|---|---|
Unique Prime Factorization | n = p_1^(a_1) × ... × p_r^(a_r) | Every integer greater than 1 has one unique prime factorization apart from the order of its factors. |
Product of Prime Factors | Product of all prime factors = n | Multiplying every prime factor with its full multiplicity reconstructs the original number. |
Prime Number Factorization | p = p^1 | A prime number has itself as its only prime factor. |
Divisor Count | d(n) = ∏(a_i + 1) | The number of positive divisors is obtained by adding one to each prime exponent and multiplying the results. |
Examples
| Problem | Solution | Explanation |
|---|---|---|
Find the prime factorization of 36. | 36 = 2 × 2 × 3 × 3 = 2^2 × 3^2. | Repeated division or a factor tree gives two factors of 2 and two factors of 3. |
Find the prime factorization of 84. | 84 = 2 × 42 = 2 × 2 × 21 = 2^2 × 3 × 7. | Each composite quotient is divided further until only prime factors remain. |
Find the prime factorization of 120. | 120 = 2 × 2 × 2 × 3 × 5 = 2^3 × 3 × 5. | The prime factor 2 occurs three times, while 3 and 5 occur once each. |
Find the number of positive divisors of 72. | 72 = 2^3 × 3^2. Therefore, d(72) = (3+1)(2+1) = 12. | Add one to each prime exponent and multiply the results. |
Applications
Calculating GCD and LCM.
Simplifying fractions.
Determining the number of positive divisors.
Testing divisibility.
Solving number theory problems.
Understanding mathematical structures used in cryptography.
Prerequisites
Understanding of factors and multiples.
Knowledge of prime and composite numbers.
Basic multiplication and division.
Understanding of exponents and powers.
Familiarity with divisibility rules.
Learning Objectives
Define prime factorization.
Identify prime factors of a composite number.
Use repeated division to find prime factors.
Construct and interpret factor trees.
Express repeated prime factors using exponent notation.
Calculate the number of positive divisors from prime factorization.
Understand the uniqueness of prime factorization.
Common Mistakes
Stopping the factorization while a composite factor remains.
Leaving out repeated prime factors.
Including 1 as a prime factor.
Confusing ordinary factorization with prime factorization.
Multiplying prime factors incorrectly when checking the result.
Forgetting to increase each exponent by one when calculating the divisor count.
Practice Questions
Find the prime factorization of 48.
Express 180 as a product of prime factors using exponent notation.
Find the prime factorization of 252.
Calculate the number of positive divisors of 60.
Use a factor tree to factorize 96.
Explain why every factor in a complete prime factorization must be prime.
Key Takeaway
Prime factorization expresses every integer greater than 1 as a product of prime numbers. It provides a unique representation and makes many number theory calculations easier.
Related Topics
SCI-MAT-002-043
SCI-MAT-002-045
SCI-MAT-002-046
SCI-MAT-002-047
SCI-MAT-002-048
Sources and verification
Sources are shown as provided in the project data. Not every source has yet been independently verified. Please report errors or missing citations.
- Source verification pending; check an authoritative textbook, university, standards body, or peer-reviewed source.
Suggest a correction or source · More in Arithmetic & Number Theory