In the study of numbers, prime numbers serve as the fundamental building blocks—much like atoms form chemical molecules. Every composite integer can be built by multiplying prime numbers together. The Fundamental Theorem of Arithmetic formalizes this observation and guarantees that every composite number has a unique prime factorisation.
This theorem is foundational to arithmetic, modular theory, and algebra. In CBSE Class 10 Mathematics, it enables us to compute HCF and LCM systematically, prove the irrationality of numbers like and , and analyze decimal expansions of rational fractions.
What You Will Learn
- Formal statement and meaning of the Fundamental Theorem of Arithmetic
- Uniqueness of prime factorisation (up to the order of factors)
- Constructing and using Factor Trees
- Algebraic applications: Determining whether numbers like or can end with the digit
- Proving expressions like are composite
- Important board exam tips and common misconceptions
1. Formal Statement of the Theorem
The Fundamental Theorem of Arithmetic
Every composite number can be expressed (factorised) as a product of primes, and this factorisation is unique, apart from the order in which the prime factors occur.
Mathematically, for any composite natural number : where are distinct prime numbers and are positive integer exponents.
Why is "Apart from the Order" Important?
Consider the number : Although the order of writing factors can change, the prime factors involved are always strictly one 2, one 3, and one 5. When written in ascending order, the representation is completely unique.
Important: <u>The uniqueness part of the Fundamental Theorem of Arithmetic is what makes it so powerful. It guarantees that a number cannot have two different prime decompositions.</u>
2. Factor Tree Method
A factor tree is a visual diagram used to break down a composite number into its prime factors through successive divisions.
Example: Factorising 32760
Thus, the canonical prime factorisation is:
3. High-Yield Board Exam Applications
Application 1: Can or End with Digit 0?
Problem: Check whether can end with the digit for any natural number .
Solution:
- If any number ends with the digit , it must be divisible by .
- Since , any number ending in must have both and as prime factors.
- Now, find the prime factorisation of :
- The only prime factors of are and .
- By the uniqueness of the Fundamental Theorem of Arithmetic, there are no other prime factors in the factorisation of .
- Since is not a prime factor of , <u> cannot be divisible by and therefore can never end with the digit for any natural number </u>.
Exam Tip: In this type of question, explicitly mention "By the uniqueness of the Fundamental Theorem of Arithmetic". Examiners specifically look for this key phrase when grading.
Application 2: Explaining Why a Given Expression is Composite
Problem: Explain why and are composite numbers.
Solution: Recall that a composite number has factors other than and itself.
-
For the first expression: Since the given number can be expressed as a product of prime factors and , it has more than two factors. Hence, it is a composite number.
-
For the second expression: Since both and are integers greater than , the number has factors other than and itself. Hence, it is a composite number.
4. Summary and Revision Guide
| Feature | Description |
|---|---|
| Theorem Statement | Every composite number has a unique prime factorisation (order disregarded). |
| Canonical Form | where . |
| Ending in 0 Rule | Requires prime factors 2 and 5 in the decomposition (). |
| Composite Proof | Factor out common terms to show factors other than 1 and itself. |
Remember: is neither prime nor composite. The smallest prime number is , which is also the only even prime number.
Common Mistake: Concluding that cannot end with 0 simply by checking small values like . You must use the prime factorisation theorem to prove it for all natural numbers .