NEWAll India NCERT Mock Test Series is now live!Take Free Test
| Exercise 9.1

Q11: If nn is a product of two unequal prime numbers, then it has exactly 44 divisors.

UNDERSTAND THE QUESTION

  • We need to prove the statement: "If nn is a product of two unequal prime numbers, then it has exactly 44 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 11 that has no positive divisors other than 11 and itself.
  • If n=pimesqn = p imes q, where pp and qq are two distinct (unequal) prime numbers, we need to find all positive integers that divide nn without leaving a remainder.

Step 1 — STATE THE GIVEN CONDITIONS

Let pp and qq be two unequal (distinct) prime numbers, so that p≠qp \ne q.

Let the number nn be the product of these two prime numbers:
n=p×qn = p \times q

Step 2 — IDENTIFY THE FACTORS OF nn

By definition, a divisor (or factor) of nn is an integer dd such that n÷dn \div d leaves no remainder.

Since n=p×qn = p \times q and p,qp, q are prime numbers, the positive divisors of nn are:

  1. 11: Every positive integer is divisible by 11.
  2. pp: Since n=p×qn = p \times q, dividing nn by pp gives qq (n÷p=qn \div p = q).
  3. qq: Since n=p×qn = p \times q, dividing nn by qq gives pp (n÷q=pn \div q = p).
  4. nn (or p×qp \times q): Every positive integer is divisible by itself.

Step 3 — VERIFY DISTINCTNESS OF DIVISORS

We must verify that these four divisors (11, pp, qq, and pqpq) are all distinct from one another:

  • 1≠p1 \ne p and 1≠q1 \ne q (since pp and qq are prime numbers, which are greater than 11).
  • 1≠pq1 \ne pq (since pq>1pq > 1).
  • p≠qp \ne q is given in the problem statement (unequal prime numbers).
  • p≠pqp \ne pq and q≠pqq \ne pq (since q>1q > 1 and p>1p > 1).

Thus, all four numbers 11, pp, qq, and pqpq are distinct.

Step 4 — CONCLUSION

Counting the distinct positive divisors of nn, we get:
Divisors of n={1,p,q,pq}\text{Divisors of } n = \{1, p, q, pq\}

Total number of divisors = 44.

ANSWER

It is proved that if nn is a product of two unequal prime numbers, its divisors are 11, pp, qq, and pqpq, making a total of exactly 44 divisors.

COMMON MISTAKES

  • Assuming Equal Primes: Forgetting that the primes must be unequal. If p=qp = q, then n=p2n = p^2, and the divisors would be 11, pp, and p2p^2, which are only 33 divisors instead of 44.
  • Missing 11 and nn: Omitting 11 or the number nn itself, which are always divisors for any positive integer nn.

Was this solution helpful?