GMAT Question of the Day - Daily to your Mailbox; hard ones only

It is currently 23 Oct 2018, 17:50

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.

Close

Request Expert Reply

Confirm Cancel

Is the positive integer j divisible by a greater number of

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Director
Director
avatar
Joined: 01 May 2007
Posts: 776
Is the positive integer j divisible by a greater number of  [#permalink]

Show Tags

New post 03 Feb 2008, 14:51
4
10
00:00
A
B
C
D
E

Difficulty:

  15% (low)

Question Stats:

78% (01:13) correct 22% (01:12) wrong based on 426 sessions

HideShow timer Statistics

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
Manager
Manager
User avatar
Joined: 20 Dec 2004
Posts: 247
Re: GMATPrep: PS Divisibility  [#permalink]

Show Tags

New post 04 Feb 2008, 18:54
2
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

Senior Manager
Senior Manager
avatar
Joined: 26 Jan 2008
Posts: 251
Re: GMATPrep: PS Divisibility  [#permalink]

Show Tags

New post 04 Feb 2008, 23:59
1
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

SVP
SVP
avatar
Joined: 29 Mar 2007
Posts: 2446
Re: GMATPrep: PS Divisibility  [#permalink]

Show Tags

New post 05 Feb 2008, 19:54
3
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: 95
Location: Astana
Re: GMATPrep: PS Divisibility  [#permalink]

Show Tags

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
Intern
Intern
avatar
Joined: 16 Dec 2011
Posts: 42
GMAT Date: 04-23-2012
Re: Is the positive integer j divisible by a greater number of  [#permalink]

Show Tags

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 ?
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 50058
Re: Is the positive integer j divisible by a greater number of  [#permalink]

Show Tags

New post 27 Jan 2012, 05:08
2
2
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 the Math Forum?
Please read this: Ultimate GMAT Quantitative Megathread | All You Need for Quant | PLEASE READ AND FOLLOW: 12 Rules for Posting!!!

Resources:
GMAT Math Book | Triangles | Polygons | Coordinate Geometry | Factorials | Circles | Number Theory | Remainders; 8. Overlapping Sets | PDF of Math Book; 10. Remainders | GMAT Prep Software Analysis | SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) | Tricky questions from previous years.

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?
Extra-hard Quant Tests with Brilliant Analytics

Manager
Manager
avatar
B
Joined: 23 Oct 2017
Posts: 64
Re: Is the positive integer j divisible by a greater number of  [#permalink]

Show Tags

New post 03 Jan 2018, 19:24
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

--------

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.
Intern
Intern
avatar
B
Joined: 06 Dec 2015
Posts: 1
Is the positive integer j divisible by a greater number of  [#permalink]

Show Tags

New post 18 Sep 2018, 07:23
Bunuel wrote:
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.




Question ask
Is the positive integer j divisible by a greater number of different prime numbers than the positive integer k?
Not : is the # of distinct prime factors of j more than the # of distinct prime factors of k?
question is talking about the integer k not its prime factors

Correct me if my understanding is wrong

answer should be E
GMAT Club Bot
Is the positive integer j divisible by a greater number of &nbs [#permalink] 18 Sep 2018, 07:23
Display posts from previous: Sort by

Is the positive integer j divisible by a greater number of

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  


Copyright

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

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne

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