Is the positive integer j divisible by a greater number of

Question

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

(1) j is divisible by 30.
(2) k = 1000

neelesh · Answer

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 ?

incognito1 · Answer

st 1 ==> j is a multiple of 30. lets take j = 30 - so 3 prime divisors (2, 3 & 5). Note that any multiple of 30 will have atleast these 3 divisors.
st 2 ==> k = 1000. only divisors are 2 and 5

regardless of the actual value of j, it has more divisors than k. so the answer is (C)

GMATBLACKBELT · Answer

does J have a greater number of DIFFERENT primes than k?

1: Nothing about K
2: nothing about J

together lets take the worst case scenario for j. j=30. Primes of 30 are 2,3,5

2: primes of 1000 are 2,5... and thats it.

So we sufficed our worst case scenario here. J will always have more primes than k, even if its only 30.

C

CaspAreaGuy · Answer

1) different prime numbers are 2, 3 and 5. Insuffisient as it needs to be compared to the number of prime factors of K
2) the only different prime factors are 5 and 2. Alone insufficient because we'd have to know how many factor J has.

Together sufficient as K has 3 factors vs. J's 2 factors

C

pbull78 · Answer

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

Bunuel · Answer

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.

luffy_ueki · Answer

--------

The question can be rephrased as: Does the +ve integer j has higher number of prime factors than the +ver integer k ?
Stmt 1: j is divisble by 30 (=2*3*5)=> j has atleast 2,3,5 as the prime factors => but not sufficient as we dont have any info on k

Stmt 2: k is 1000 = 2*5*2*5*2*5 => only 2 prime factors 2,5 =>but not sufficient as we dont have any info on k

But combining both statements, we can see j has a higher no. of prime factors.

bumpbot · Answer

Automated notice from GMAT Club BumpBot: 

A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.

 This post was generated automatically.

Is the positive integer j divisible by a greater number of

Prep Toolkit

Top 5 GMAT Debrief Videos

615 to 715 in 15 Days (Ria's Strategies)

More than Quant/Verbal Abilities: Speed vs. Accuracy

745 with Only Self-Prep and GMAT Club

From 555 to 765: 210-point Improvement

Perfect 805 Score Debrief by Julia

My Rewards