prasannar wrote:

C

J & K are unknowns

for knowing the multiples of a number, we need to know the number or the multiple of the number

now using both the statements we can figure out that J is multiple of 30 so all the primes that divide 30 also divide J and K is given to be 1000, we can figure out the # of the primes that divide 1000 and then find the relationship that both are required.

I dont understand how C is the answer.

Question is that if the total number of prime factors that J has is more than K.

From St.1 -- Since j is divisible by 30 it is divisible by 2*3*5*n. n can potentially be a prime number or a product of several prime numbers. So total number of factors of j can be anywhere between 4 or infinity. For example n can be equal to 7*11*13*17*19*23*29*31*......... so it is indeterministic what the total number of prime factors j has and if it is less than k.

From St. 2 -- We know that k=1000. But we still dont know what j is. All we know is that j 2*3*5*n. n can be a product of just 2 prime numbers or several infinite prime numbers and hence we cannot establish if total number of prime factors of j is less than 1000 or greater than 1000.

E in my opinion.

What is the OA ?

_________________

Stay Hungry, Stay Foolish