Q11: If is a product of two unequal prime numbers, then it has exactly divisors.
SOLUTION
UNDERSTAND THE QUESTION
- We need to prove the statement: "If is a product of two unequal prime numbers, then it has exactly divisors."
- This involves the fundamental concepts of prime numbers, composite numbers, and divisors (factors) as taught in Class 9 Number Systems.
- A prime number is a natural number greater than that has no positive divisors other than and itself.
- If , where and are two distinct (unequal) prime numbers, we need to find all positive integers that divide without leaving a remainder.
Step 1 — STATE THE GIVEN CONDITIONS
Let and be two unequal (distinct) prime numbers, so that .
Let the number be the product of these two prime numbers:
Step 2 — IDENTIFY THE FACTORS OF
By definition, a divisor (or factor) of is an integer such that leaves no remainder.
Since and are prime numbers, the positive divisors of are:
- : Every positive integer is divisible by .
- : Since , dividing by gives ().
- : Since , dividing by gives ().
- (or ): Every positive integer is divisible by itself.
Step 3 — VERIFY DISTINCTNESS OF DIVISORS
We must verify that these four divisors (, , , and ) are all distinct from one another:
- and (since and are prime numbers, which are greater than ).
- (since ).
- is given in the problem statement (unequal prime numbers).
- and (since and ).
Thus, all four numbers , , , and are distinct.
Step 4 — CONCLUSION
Counting the distinct positive divisors of , we get:
Total number of divisors = .
ANSWER
It is proved that if is a product of two unequal prime numbers, its divisors are , , , and , making a total of exactly divisors.
COMMON MISTAKES
- Assuming Equal Primes: Forgetting that the primes must be unequal. If , then , and the divisors would be , , and , which are only divisors instead of .
- Missing and : Omitting or the number itself, which are always divisors for any positive integer .