If primes are the building blocks of integers, then prime factorization is the process that reveals how those blocks are assembled.
What this post covers
- What prime factorization is
- Several concrete examples
- Why uniqueness matters
- How this prepares us to compute divisor counts, gcds, and lcms structurally
Key terms
- prime factorization: expressing an integer greater than 1 as a product of primes
- fundamental theorem of arithmetic: the theorem that such a factorization is unique up to order
- prime number: a natural number greater than 1 with only two positive divisors
- composite number: a natural number greater than 1 with additional divisors
What is prime factorization?
Prime factorization means breaking an integer greater than 1 all the way down until only primes remain.
For example,
and
Reading structure through examples
24
45
84
These forms show which primes appear and how many times they appear. That exponent pattern is exactly the structural information we will use in later computations.
Why is uniqueness important?
It is not enough to say that factorization exists. The essential point is that the prime factorization is unique up to order.
So while
and
look different, they represent the same prime structure.
The fundamental theorem of arithmetic
The formal statement is:
- Every integer greater than 1 can be written as a product of primes.
- This expression is unique up to the order of the factors.
That is the fundamental theorem of arithmetic.
A preview of gcd and lcm through exponents
Write
The gcd takes the smaller exponents:
The lcm takes the larger exponents.
Common mistakes
1. Stopping too early
12=2×6 is not a prime factorization yet, because 6 is not prime.
2. Including 1 as a prime factor
1 is not prime, so it does not belong in a prime factorization.
3. Thinking different orders mean different factorizations
Order does not matter for the essential structure.
Wrap-up
Prime factorization turns an integer into a readable prime-exponent structure. The next post uses that structure in practical computation: divisor counts, gcds, and lcms.
💬 댓글
이 글에 대한 의견을 남겨주세요