[Number & Operations · Core Concepts ① - Prime Factorization] The Essence of Prime Factorization: 5 Divisibility Rules, Ladder & Tree Algorithms & Perfect Square Mastery

Integrated Math 1 (Middle) · Concept ① [Numbers & Operations: Prime Factorization]

The Essence of Prime Factorization: 5 Divisibility Rules, Ladder & Tree Algorithms & Perfect Square Mastery

From prime classification and essential divisibility criteria to visual factorization methods, 3-step perfect square algorithms, and divisor counting

🌱 Prime factorization is mathematics' microscope for analyzing the indivisible atomic building blocks of numbers
In elementary arithmetic, factors and multiples are discovered by listing numbers individually.

In secondary mathematics, prime factorization introduces a foundational framework: detecting divisors in seconds via divisibility rules, and uniquely decomposing any natural number greater than 1 into a product of primes.

"Identify factors instantly via divisibility tests, ensure bases are strictly prime, complete even exponents to build perfect squares, and compute total divisors through combinatorial multiplications." Mastering these foundational rules guarantees long-term algebraic stability.
CORE THEORY 1

Properties of Primes and Composites & 5 Essential Divisibility Rules

Classify natural numbers into three distinct categories and utilize 5 key divisibility tests to detect prime factors instantly.

[1] Three Fundamental Properties of Primes and Composites
(1) The number 1 is neither prime nor composite. It possesses exactly 1 divisor and is excluded to preserve the uniqueness of prime factorization.
(2) The number 2 is the smallest prime number and the only even prime. All other primes are strictly odd.
(3) All even numbers greater than 2 have at least three divisors (1, 2, and themselves), making them composite.

[2] Top-Tier Cheat Sheet: 5 Core Divisibility Rules
Use these practical criteria to determine divisors of large integers within 3 seconds:
(1) Divisibility by 2: The last digit is 0 or an even number (2, 4, 6, 8).
(2) Divisibility by 3: The sum of all individual digits is a multiple of 3. (e.g., 123 has digit sum $1+2+3=6$, which is divisible by 3).
(3) Divisibility by 4: The last two digits are '00' or form a multiple of 4. (e.g., in 316, the last two digits 16 are divisible by 4).
(4) Divisibility by 5: The last digit is 0 or 5.
(5) Divisibility by 9: The sum of all individual digits is a multiple of 9. (e.g., 702 has digit sum $7+0+2=9$, which is divisible by 9).
[Diagram 1] 3-Way Partitioning of Natural Numbers by Divisor Counts
1
1 Divisor
Neither Prime nor Composite
Prime Numbers
2 Divisors (1 & self)
2 is the only even prime
Composite Numbers
3 or More Divisors
Decomposed into primes
✏️ [Example 1] Applying Divisibility Rules to Unknown Digits
The four-digit natural number $42\square5$ is a multiple of 3 but not a multiple of 9. Find the sum of all possible single-digit values for $\square$.
💡 Yulcho's Pro-Tip: Set up the sum of digits equation: $4 + 2 + \square + 5 = 11 + \square$. Find candidate values of $\square$ that make the sum a multiple of 3, then filter out any value that produces a multiple of 9.
View Solution & Answer (Click)
The sum of digits is $11 + \square$. Since $\square \in \{0, 1, \dots, 9\}$, $11 \le 11 + \square \le 20$.
1. Multiples of 3:
$11 + \square = 12 \implies \square = 1$
$11 + \square = 15 \implies \square = 4$
$11 + \square = 18 \implies \square = 7$
2. Filtering multiples of 9:
When $\square = 7$, the sum is 18 (a multiple of 9), which violates the condition.
Thus, valid values are $\square = 1$ and $\square = 4$.
The sum is $1 + 4 = 5$.
Answer: 5
CORE THEORY 2

Two Algorithms for Prime Factorization: Repeated Division vs. Factor Tree

Decompose composite numbers into products of pure prime factors using two standard visual methods.

[Diagram 2] Two Visual Algorithms for Prime Factorizing 60
[Method 1] Repeated Division (Ladder Method)
 2 ) 60
 ---
 2 ) 30
 ---
 3 ) 15
 ---
     5 (Continue until quotient is prime)
Multiply all prime divisors and the final quotient:
$60 = 2 \times 2 \times 3 \times 5 = 2^2 \times 3 \times 5$
[Method 2] Factor Tree (Branching Method)
     60
    /  \
  (2)   30
      /  \
    (2)   15
        /  \
      (3)  (5)
Collect all prime leaves at the terminal branches:
$60 = 2^2 \times 3 \times 5$
Power Notation: Addition vs. Multiplication Distinction
Repeated addition represents multiplication: $3 + 3 + 3 + 3 = 3 \times 4 = 12$
Repeated multiplication represents exponentiation: $3 \times 3 \times 3 \times 3 = 3^4 = 81$
Prime factorization must be expressed as powers of prime bases.
✏️ [Example 2] Calculating the Sum of Distinct Prime Factors
When $504$ is prime-factorized as $2^a \times 3^b \times c$, find the value of $a + b + c$ and calculate the sum of all distinct prime factors of 504.
💡 Yulcho's Pro-Tip: 'Prime factors' refer specifically to the prime bases, ignoring exponents. Count each unique base exactly once when calculating their sum.
View Solution & Answer (Click)
Divide 504 successively by primes:
$504 \div 2 = 252$, $252 \div 2 = 126$, $126 \div 2 = 63$
$63 \div 3 = 21$, $21 \div 3 = 7$
$504 = 2^3 \times 3^2 \times 7^1$.
Comparing with $2^a \times 3^b \times c$: $a = 3, b = 2, c = 7 \implies a + b + c = 3 + 2 + 7 = 12$.
The distinct prime factors are 2, 3, and 7, so their sum is $2 + 3 + 7 = 12$.
Answer: $a + b + c = 12$, Sum of prime factors = 12
CORE THEORY 3

Constructing Perfect Squares: Even Exponent Balancing via Multiplication or Division

Every perfect square has prime factors with strictly even exponents.

(1) Invariant Property of Perfect Squares
A number obtained by squaring a natural number: $4 = 2^2, 9 = 3^2, 16 = 4^2, 25 = 5^2, \dots$
Essential Characteristic: When prime-factorized, all exponents of prime factors must be even numbers.

(2) 3-Step Algorithm to Construct Perfect Squares
Multiply or divide to convert all odd exponents into even exponents.
Step 1: Fully prime-factorize the given number.
Step 2: Identify all prime factors possessing odd exponents.
Step 3: Multiply by these factors (increasing odd exponents by 1) or divide by them (eliminating odd exponents).
[Diagram 3] Perfect Square Construction: Multiplying vs. Dividing
Case ① Multiplying by $a$: $20 \times a = b^2$
[Step 1] Factorize 20: $20 = 2^2 \times 5^1$
[Step 2] Check Odd Exponent: Factor 5 has exponent 1 (odd)
[Step 3] Balance Exponent to Even:
$20 \times 5 = (2^2 \times 5) \times 5 = 2^2 \times 5^2 = (2 \times 5)^2 = 10^2$
Smallest integer multiplier is $a = 5$, yielding square $10^2 = 100$.
Case ② Dividing by $a$: $\frac{12}{a} = b^2$
[Step 1] Factorize 12: $12 = 2^2 \times 3^1$
[Step 2] Check Odd Exponent: Factor 3 has exponent 1 (odd)
[Step 3] Cancel Odd Factor:
$\frac{12}{3} = \frac{2^2 \times 3}{3} = 2^2$
Smallest integer divisor is $a = 3$, yielding square $2^2 = 4$.
⚠️ Advanced Concept: Generating the 2nd and 3rd Smallest Multipliers
Subsequent valid multipliers follow the algebraic structure: $(Smallest\ Value) \times k^2$ for natural number $k$.
For $20 \times a = b^2$, candidate values for $a$ are:
Smallest: $5 \times 1^2 = 5$
2nd Smallest: $5 \times 2^2 = 20$
3rd Smallest: $5 \times 3^2 = 45$
✏️ [Example 3-1] Multiplying to Form a Perfect Square
Find $a + b$ when 180 is multiplied by the smallest natural number $a$ to become the square of natural number $b$.
💡 Yulcho's Pro-Tip: Factorize 180 first. Identify the prime factor with an odd exponent to determine $a$, then regroup into $(\dots)^2$ to evaluate $b$.
View Solution & Answer (Click)
1. Factorize: $180 = 2^2 \times 3^2 \times 5^1$.
2. 2 and 3 have even exponents (2). 5 has an odd exponent (1). Thus, $a = 5$.
3. $180 \times 5 = 2^2 \times 3^2 \times 5^2 = (2 \times 3 \times 5)^2 = 30^2 \implies b = 30$.
4. $a + b = 5 + 30 = 35$.
Answer: 35
✏️ [Example 3-2] Dividing to Form a Perfect Square
Find the smallest natural number $x$ such that $\frac{240}{x}$ is a perfect square.
💡 Yulcho's Pro-Tip: Division cancels factors. Multiplying all prime factors that have odd exponents produces the exact divisor $x$.
View Solution & Answer (Click)
1. Factorize: $240 = 2^4 \times 3^1 \times 5^1$.
2. $2^4$ has an even exponent (4). 3 and 5 both have odd exponents (1).
3. Divide by $x = 3 \times 5 = 15$ to cancel out the odd factors.
Verification: $\frac{240}{15} = 16 = 4^2$.
Answer: 15
CORE THEORY 4

Divisor Counting Formulas & Exponent Back-Calculation

Compute total divisors efficiently through prime factor exponent combinations.

(1) Formula Derivation
When $N = a^m \times b^n$ ($a, b$ are distinct primes):
Divisors from $a^m$ are $1, a, a^2, \dots, a^m$ ($m + 1$ choices).
Divisors from $b^n$ are $1, b, b^2, \dots, b^n$ ($n + 1$ choices).
Total Divisors of $N = (m + 1)(n + 1)$

(2) Why 1 is Added to Each Exponent
It accounts for the selection of the zero exponent ($a^0 = 1$), representing the omission of that prime factor.

(3) Sum of Divisors Identity
Expanding $(1 + a + a^2 + \dots + a^m)(1 + b + b^2 + \dots + b^n)$ produces the exact sum of all positive divisors.
✏️ [Example 4] Determining Unknown Exponents from Divisor Counts
If the number of divisors of $2^x \times 3^2 \times 5$ is 24, find natural number $x$.
💡 Yulcho's Pro-Tip: Confirm that bases 2, 3, and 5 are strictly prime. An unwritten exponent on 5 denotes $5^1$, not $5^0$. Solve $(x + 1)(2 + 1)(1 + 1) = 24$.
View Solution & Answer (Click)
The expression is $2^x \times 3^2 \times 5^1$.
Using the divisor formula:
$(x + 1) \times (2 + 1) \times (1 + 1) = 24$
$6(x + 1) = 24 \implies x + 1 = 4 \implies x = 3$.
Answer: 3
WARNING

Three Common Exam Traps in Prime Factorization

🚨 [Trap 1] Applying Divisor Formulas Directly to Composite Bases
Calculating divisors for $4^2 \times 3^3$ as $(2 + 1)(3 + 1) = 12$ is incorrect. Since 4 is composite, rewrite it as $4^2 = (2^2)^2 = 2^4$. The correct prime factorized form is $2^4 \times 3^3$, yielding $(4 + 1)(3 + 1) = 20$ divisors.
🚨 [Trap 2] Treating Omitted Exponent 1 as Exponent 0
In $2^3 \times 5$, students often ignore the prime 5, writing $(3 + 1) = 4$ divisors. An unwritten exponent represents $5^1$, requiring $(3 + 1)(1 + 1) = 8$ divisors.
🚨 [Trap 3] Assuming All Odd Numbers are Prime or 1 is Prime
Numbers like 9, 15, 21, and 25 are odd yet composite. Furthermore, 1 has only one divisor and is neither prime nor composite.
🌿 Yulcho's Insight
"Prime factorization is not mere mechanical number-splitting. It is the decoding of an integer's mathematical DNA to govern divisors, multiples, and algebraic structures. Identifying divisors rapidly via divisibility rules and adhering to prime bases forms the bedrock of secondary school mathematics."
Having mastered prime testing, divisibility rules, ladder/tree algorithms, and perfect squares, our next post explores: [Integrated Math 1 (Middle) · Problem Types ①] Prime Factorization: 15 Benchmark Types & 1:1 Parallel Diagnostic Drills.

Comments

Popular posts from this blog

Authentic Reference Models Beyond Basic Rulers

[Math Column]Studying Alongside Dedicated Peers: Becoming Each Other’s Lifelong Catalyst

[High School Math] Coordinate Geometry: 15 Essential Practice Problems on Section Formulas (Internal & External Division)