Prime Factorization

Definition

Prime factorization is the process of breaking down a composite number into a product of prime numbers. Every integer greater than 1 has a unique prime factorization (The Fundamental Theorem of Arithmetic).

Why It Matters

Every number has a “Multiplicative Soul”—a unique set of prime atoms. This is the “Fundamental Theorem of Arithmetic.” If we couldn’t factorize, we couldn’t simplify fractions or secure our internet transactions (RSA). It is the “Irreducible Logic” of the integer system, proving that complex quantities are just “constellations” of prime building blocks.

Core Concepts

Composite Numbers: Positive integers greater than 1 that have at least one divisor other than 1 and itself.
Prime Atoms: Prime numbers act as the “multiplicative building blocks” of the entire integer system.
Canonical Form: Writing a number $n$ $n$ as $p_1^{a_1} p_2^{a_2} \dots p_k^{a_k}$ $p_{1}^{a_{1}} p_{2}^{a_{2}} \dots p_{k}^{a_{k}}$ , where $p_i$ $p_{i}$ are distinct primes.
- How to read: “The integer n is equal to the first prime p one raised to the power of a one, times the second prime p two raised to the power of a two, and so on.”
- Meaning: Unique prime decomposition—every integer’s “DNA” as a product of prime powers.
Factor Trees: A visual method for finding prime factors by repeatedly dividing a number.

Definition

Why It Matters

Core Concepts

Connected Concepts

Connected notes