pbull78 wrote:

can any one give me a proper explanation for this question, for some reasons i donot find the sentence construction of this problem correct ?

Is the positive integer j divisible by a greater number of different prime numbers than the positive integer k?Question basically asks: is the # of distinct prime factors of j more than the # of distinct prime factors of k?

(1) j is divisible by 30 --> j=30*n=(2*3*5)*n --> j has

at least three distinct prime factors 2, 3, and 5. Not sufficient as no info about k.

(2) k = 1000 --> k=1,000=2^3*5^3 --> k has

exactly two distinct prime factors 2 and 5. Not sufficient as no info about j.

(1)+(2) The # of distinct prime factors of j, which is at least 3, is more than the # of distinct prime factors of k, which is exactly 2. Sufficient.

Answer: C.

Hope it's clear.

Is the positive integer j divisible by a greater number of different prime numbers than the positive integer k?