Join 60,000+ competitive exam aspirants
Which of the following numbers does NOT have exactly four distinct positive divisors?
p3 where p is a prime number
pтЛЕq where p and q are distinct prime numbers
q3 where q is a prime number
p2 where p is a prime number
p2 where p is a prime number
A number has exactly 4 divisors if it is of the form p3 (where d=3+1=4) or p├Чq (where d=(1+1)(1+1)=4). A number of form p2 has 2+1=3 divisors.
We need to identify which of the provided numbers does NOT have exactly four distinct positive divisors. The options are prime power or product forms: p┬│, p*q (distinct primes p, q), q┬│, and p┬▓.
d(n)=(a1тАЛ+1)(a2тАЛ+1)...(akтАЛ+1)┬аwhere┬аn=p1a1тАЛтАЛp2a2тАЛтАЛ...pkakтАЛтАЛ
A number has exactly 4 divisors if it is of the form p3 (where d=3+1=4) or p├Чq (where d=(1+1)(1+1)=4). A number of form p2 has 2+1=3 divisors.
Confusing p2 with p3. The square of a prime p2 has only 3 divisors: 1,p,p2.
Analyze Divisor Counting Formula
The number of divisors d(n) for an integer n=p1a1тАЛтАЛp2a2тАЛтАЛ... is given by (a1тАЛ+1)(a2тАЛ+1)....
d(n)=тИП(aiтАЛ+1)
Evaluate p┬│ and q┬│
For n=p3, the count is (3+1)=4. This matches the condition of having exactly four divisors.
d(p3)=3+1=4
Evaluate p * q
For n=p├Чq (where p, q are distinct primes, exponents are 1), the count is (1+1)(1+1)=4. This matches the condition.
d(pтЛЕq)=(1+1)(1+1)=4
Evaluate p┬▓
For n=p2, the count is (2+1)=3. This does not have exactly four divisors.
d(p2)=2+1=3
D is correct because the number p2 has exactly three positive divisors: 1, p, and p2, which is not four.
This concept is foundational for RSA cryptography where the number of divisors of n=pq is used to compute the Euler totient function ╧Х(n)=(pтИТ1)(qтИТ1).