Find all School-related info fast with the new School-Specific MBA Forum

It is currently 31 Jul 2014, 09:42

Close

GMAT Club Daily Prep

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.

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

Is the positive integer j divisible by a greater number of

  Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:
2 KUDOS received
Director
Director
avatar
Joined: 01 May 2007
Posts: 795
Followers: 1

Kudos [?]: 56 [2] , given: 0

GMAT Tests User
Is the positive integer j divisible by a greater number of [#permalink] New post 03 Feb 2008, 13:51
2
This post received
KUDOS
00:00
A
B
C
D
E

Difficulty:

  25% (medium)

Question Stats:

74% (01:44) correct 26% (00:55) wrong based on 86 sessions
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
[Reveal] Spoiler: OA
1 KUDOS received
Senior Manager
Senior Manager
User avatar
Joined: 20 Dec 2004
Posts: 258
Followers: 6

Kudos [?]: 57 [1] , given: 0

GMAT Tests User
Re: GMATPrep: PS Divisibility [#permalink] New post 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.

E in my opinion.

What is the OA ?
_________________

Stay Hungry, Stay Foolish

1 KUDOS received
Senior Manager
Senior Manager
avatar
Joined: 26 Jan 2008
Posts: 267
Followers: 2

Kudos [?]: 72 [1] , given: 1

GMAT Tests User
Re: GMATPrep: PS Divisibility [#permalink] New post 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)
_________________

My GMAT debrief

1 KUDOS received
CEO
CEO
User avatar
Joined: 29 Mar 2007
Posts: 2593
Followers: 16

Kudos [?]: 181 [1] , given: 0

GMAT Tests User
Re: GMATPrep: PS Divisibility [#permalink] New post 05 Feb 2008, 18:54
1
This post received
KUDOS
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


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
Manager
Manager
avatar
Joined: 01 Sep 2007
Posts: 103
Location: Astana
Followers: 1

Kudos [?]: 16 [0], given: 0

Re: GMATPrep: PS Divisibility [#permalink] New post 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

C
Intern
Intern
avatar
Joined: 16 Dec 2011
Posts: 49
GMAT Date: 04-23-2012
Followers: 0

Kudos [?]: 0 [0], given: 12

Re: Is the positive integer j divisible by a greater number of [#permalink] New post 27 Jan 2012, 03:56
can any one give me a proper explanation for this question, for some reasons i donot find the sentence construction of this problem correct ?
Expert Post
Math Expert
User avatar
Joined: 02 Sep 2009
Posts: 18851
Followers: 3274

Kudos [?]: 22872 [0], given: 2651

Re: Is the positive integer j divisible by a greater number of [#permalink] New post 27 Jan 2012, 04:08
Expert's post
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.
_________________

NEW TO MATH FORUM? PLEASE READ THIS: ALL YOU NEED FOR QUANT!!!

PLEASE READ AND FOLLOW: 11 Rules for Posting!!!

RESOURCES: [GMAT MATH BOOK]; 1. Triangles; 2. Polygons; 3. Coordinate Geometry; 4. Factorials; 5. Circles; 6. Number Theory; 7. Remainders; 8. Overlapping Sets; 9. PDF of Math Book; 10. Remainders; 11. GMAT Prep Software Analysis NEW!!!; 12. SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) NEW!!!; 12. Tricky questions from previous years. NEW!!!;

COLLECTION OF QUESTIONS:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS ; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.


What are GMAT Club Tests?
25 extra-hard Quant Tests

Get the best GMAT Prep Resources with GMAT Club Premium Membership

SVP
SVP
User avatar
Joined: 09 Sep 2013
Posts: 1832
Followers: 167

Kudos [?]: 33 [0], given: 0

Premium Member
Re: Is the positive integer j divisible by a greater number of [#permalink] New post 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.
_________________

GMAT Books | GMAT Club Tests | Best Prices on GMAT Courses | GMAT Mobile App | Math Resources | Verbal Resources

Re: Is the positive integer j divisible by a greater number of   [#permalink] 22 Oct 2013, 18:34
    Similar topics Author Replies Last post
Similar
Topics:
Experts publish their posts in the topic If j and k are positive integers and j + k is odd guerrero25 2 04 Feb 2014, 07:53
If j and k are positive integers such that k > j AkshayChittoria 0 05 Sep 2013, 22:32
15 If j and k are positive integers, j - 2 is divisible by 4 gmat1220 11 17 Apr 2011, 10:43
Is the positive integer j divisible by a greater number of alimad 1 27 Jun 2008, 19:34
If j and k are positive integers, j 2 is divisible by 4 Macedon 4 27 Sep 2005, 03:15
Display posts from previous: Sort by

Is the positive integer j divisible by a greater number of

  Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Privacy Policy| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group and phpBB SEO

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.