Find all School-related info fast with the new School-Specific MBA Forum
Learn more about the recent changes... close

It is currently 22 May 2013, 20:41
Customize  |  Hide

Search
Register
New posts
Unanswered

Is the positive integer j divisible by a greater number of

  Question banks Downloads My Bookmarks Reviews  
  Oldest Best Reply
Search for:
 
Print view
First unread post
Author Message
TAGS:
Director
Director
Joined: 01 May 2007
Posts: 809
Followers: 1

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

GMAT Tests User
Is the positive integer j divisible by a greater number of [#permalink] New post 03 Feb 2008, 14:51
00:00

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 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
1 KUDOS received
Senior Manager
Senior Manager
User avatar
Joined: 20 Dec 2004
Posts: 268
Followers: 6

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

GMAT Tests User
Re: GMATPrep: PS Divisibility [#permalink] New post 04 Feb 2008, 18: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
Joined: 26 Jan 2008
Posts: 267
Followers: 2

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

GMAT Tests User
Re: GMATPrep: PS Divisibility [#permalink] New post 04 Feb 2008, 23: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: 2618
Followers: 13

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

GMAT Tests User
Re: GMATPrep: PS Divisibility [#permalink] New post 05 Feb 2008, 19: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
Joined: 01 Sep 2007
Posts: 105
Location: Astana
Followers: 1

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

Re: GMATPrep: PS Divisibility [#permalink] New post 08 Feb 2008, 03: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
Manager
Manager
Joined: 16 Dec 2011
Posts: 52
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, 04: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 ?
GMAT Club team member
User avatar
Joined: 02 Sep 2009
Posts: 11566
Followers: 1796

Kudos [?]: 9578 [0], given: 826

GMAT Tests User CAT Tests
Top Member of the Month
Re: Is the positive integer j divisible by a greater number of [#permalink] New post 27 Jan 2012, 05:08
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.
_________________

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

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. NEW!!!

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. NEW!!!


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

Find out what's new at GMAT Club - latest features and updates

Manager
Manager
Joined: 16 Dec 2011
Posts: 52
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, 06:01
thanks sir great help
Re: Is the positive integer j divisible by a greater number of   [#permalink] 27 Jan 2012, 06:01
    Similar topics Author Replies Last post
Similar
Topics:
 New posts If j and k are positive integers, j 2 is divisible by 4 Macedon 4 27 Sep 2005, 04:15
New posts If j and k are positive integers where k > j, what is the duttsit 7 08 Aug 2006, 15:49
New posts 1 This is from MGMAT Number Properties. Q: If j is divisible pbvmba 4 20 Jun 2008, 17:54
New posts Is the positive integer j divisible by a greater number of alimad 1 27 Jun 2008, 20:34
New posts 5 If j and k are positive integers, j - 2 is divisible by 4 gmat1220 9 17 Apr 2011, 11:43
Display posts from previous: Sort by

Is the positive integer j divisible by a greater number of

  Question banks Downloads My Bookmarks Reviews  
Print view
First unread post

Moderators: Bunuel, VeritasPrepKarishma, IanStewart

Search for:


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®.

Main navigation

GMAT Resources

Partners

MBA Resources

www.gmac.com|www.mba.com