Thank you for using the timer - this advanced tool can estimate your performance and suggest more practice questions. We have subscribed you to Daily Prep Questions via email.

Customized for You

we will pick new questions that match your level based on your Timer History

Track Your Progress

every week, we’ll send you an estimated GMAT score based on your performance

Practice Pays

we will pick new questions that match your level based on your Timer History

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Re: GMATPrep: PS Divisibility [#permalink]
04 Feb 2008, 17:54

1

This post received KUDOS

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.

Re: GMATPrep: PS Divisibility [#permalink]
04 Feb 2008, 22:59

1

This post received KUDOS

neelesh wrote:

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 ?

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) _________________

Re: GMATPrep: PS Divisibility [#permalink]
08 Feb 2008, 02:03

jimmyjamesdonkey wrote:

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

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

Re: Is the positive integer j divisible by a greater number of [#permalink]
22 Oct 2013, 18:34

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email. _________________

Re: Is the positive integer j divisible by a greater number of [#permalink]
25 Nov 2014, 03:55

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email. _________________

Re: Is the positive integer j divisible by a greater number of [#permalink]
26 Nov 2015, 08:40

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email. _________________

Low GPA MBA Acceptance Rate Analysis Many applicants worry about applying to business school if they have a low GPA. I analyzed the low GPA MBA acceptance rate at...

http://blog.davidbbaker.com/wp-content/uploads/2015/11/12249800_10153820891439090_8007573611012789132_n.jpg When you think about an MBA program, usually the last thing you think of is professional collegiate sport. (Yes American’s I’m going...