|
Author |
Message |
|
TAGS:
|
|
|
Manager
Joined: 13 May 2010
Posts: 116
Followers: 1
Kudos [?]:
9
[1] , given: 7
|
Does the integer k have a factor p such that 1<p<k? [#permalink]
 19 Jun 2010, 03:49
1
This post received
KUDOS
Question Stats:
65% (02:12) correct
34% (01:13) wrong based on 3 sessions
i dont have any idea to solve the attached problem. Please provide methodology to solve such problems. Does the integer k have a factor p such that 1<p<k? (1) k > 4! (2) 13! + 2<= k <= 13!+13
|
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 11594
Followers: 1799
Kudos [?]:
9585
[4] , given: 826
|
4
This post received
KUDOS
Does the integer k have a factor p such that 1<p<k? Question basically asks whether k is a prime number. If it is, then it won't have a factor p such that 1<p<k (definition of a prime number). (1) k>4! --> k is more than some number ( 4!=24). k may or may not be a prime. Not sufficient. (2) 13!+2\leq{k}\leq{13!+13} --> k can not be a prime. For instance if k=13!+8=8*(2*4*5*6*7*9*10*11*12*13+1), then k is a multiple of 8, so not a prime. Same for all other numbers in this range. So, k=13!+x, where 2\leq{x}\leq{13} will definitely be a multiple of x (as we would be able to factor out x out of 13!+x, the same way as we did for 8). Sufficient. Answer: B. Check similar question: factor-factorials-100670.htmlHope 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
Joined: 13 May 2010
Posts: 116
Followers: 1
Kudos [?]:
9
[0], given: 7
|
Thanks..can not be clearer than this.
|
|
|
|
|
|
SVP
Status: 2000 posts! I don't know whether I should feel great or sad about it! LOL
Joined: 04 Oct 2009
Posts: 1756
Location: Peru
Schools: Harvard, Stanford, Wharton, MIT & HKS (Government)
WE 1: Economic research
WE 2: Banking
WE 3: Government: Foreign Trade and SMEs
Followers: 50
Kudos [?]:
145
[0], given: 108
|
Bunuel wrote: Does the integer k have a factor p such that 1<p<k? Question basically asks is k a prime number. If it is, then it won't have a factor p such that 1<p<k (definition of a prime number). (1) k>4! --> k is more than some number ( 4!=24). k may or may not be a prime. Not sufficient. (2) 13!+2\leq{k}\leq{13!+13} --> k can not be a prime. For instance if k=13!+8=8*(2*4*5*6*7*9*10*11*12*13+1), then k is a multiple of 8, so not a prime. Same for all other numbers in this range. So, k=13!+x, where 2\leq{x}\leq{13} will definitely be a multiple of x (as we would be able to factor out x out of 13!+x). Sufficient. Answer: B. Check similar question: factor-factorials-100670.htmlHope it's clear. Thanks Bunuel. I have a question, what would happen if the second statement said this? (2) 13!+1\leq{k}\leq{13!+13} I have seen some similar problems, in which they add 1. Could you post some links about it? Thanks!
_________________
"Life’s battle doesn’t always go to stronger or faster men; but sooner or later the man who wins is the one who thinks he can."
My Integrated Reasoning Logbook / Diary: my-ir-logbook-diary-133264.html
Find out what's new at GMAT Club - latest features and updates
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 11594
Followers: 1799
Kudos [?]:
9585
[2] , given: 826
|
2
This post received
KUDOS
metallicafan wrote: Bunuel wrote: Does the integer k have a factor p such that 1<p<k? Question basically asks is k a prime number. If it is, then it won't have a factor p such that 1<p<k (definition of a prime number). (1) k>4! --> k is more than some number ( 4!=24). k may or may not be a prime. Not sufficient. (2) 13!+2\leq{k}\leq{13!+13} --> k can not be a prime. For instance if k=13!+8=8*(2*4*5*6*7*9*10*11*12*13+1), then k is a multiple of 8, so not a prime. Same for all other numbers in this range. So, k=13!+x, where 2\leq{x}\leq{13} will definitely be a multiple of x (as we would be able to factor out x out of 13!+x). Sufficient. Answer: B. Check similar question: factor-factorials-100670.htmlHope it's clear. Thanks Bunuel. I have a question, what would happen if the second statement said this? (2) 13!+1\leq{k}\leq{13!+13} I have seen some similar problems, in which they add 1. Could you post some links about it? Thanks! So basically we should determine whether 13!+1 is a prime number (as shown above all other possible values of k are not are not prime), which can not be done without a computer. There are some particular values of k=n!+1 for which we can say whether it's a prime or not with help of Wilson's theorem, but again it's out of the scope of GMAT. By the way: 13!+1 is not a prime number, it has two distinct prime factors: 13!+1=83*75,024,347=6,227,020,801, so the answer still will be B.
_________________
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
|
|
|
|
|
|
Intern
Joined: 12 Nov 2010
Posts: 23
Followers: 0
Kudos [?]:
0
[0], given: 1
|
Bunuel wrote: Does the integer k have a factor p such that 1<p<k? Question basically asks whether k is a prime number. If it is, then it won't have a factor p such that 1<p<k (definition of a prime number). (1) k>4! --> k is more than some number ( 4!=24). k may or may not be a prime. Not sufficient. (2) 13!+2\leq{k}\leq{13!+13} --> k can not be a prime. For instance if k=13!+8=8*(2*4*5*6*7*9*10*11*12*13+1), then k is a multiple of 8, so not a prime. Same for all other numbers in this range. So, k=13!+x, where 2\leq{x}\leq{13} will definitely be a multiple of x (as we would be able to factor out x out of 13!+x). Sufficient. Answer: B. Check similar question: factor-factorials-100670.htmlHope it's clear. Sorry for the question, but I am just not understanding how you get 8*(2*4*5*6*7*9*10*11*12*13+1) from 13!+8 then how do you know that k is a multiple of 8...I obviously have some deficiencies when it comes to number properties. So then how is k never a prime between those parameters? I would think (1*2*3*4*5*6*7*8*9*10*11*12*13) +8 ...
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 11594
Followers: 1799
Kudos [?]:
9585
[1] , given: 826
|
1
This post received
KUDOS
ChenggongMAS wrote: Bunuel wrote: Does the integer k have a factor p such that 1<p<k? Question basically asks whether k is a prime number. If it is, then it won't have a factor p such that 1<p<k (definition of a prime number). (1) k>4! --> k is more than some number ( 4!=24). k may or may not be a prime. Not sufficient. (2) 13!+2\leq{k}\leq{13!+13} --> k can not be a prime. For instance if k=13!+8=8*(2*4*5*6*7*9*10*11*12*13+1), then k is a multiple of 8, so not a prime. Same for all other numbers in this range. So, k=13!+x, where 2\leq{x}\leq{13} will definitely be a multiple of x (as we would be able to factor out x out of 13!+x). Sufficient. Answer: B. Check similar question: factor-factorials-100670.htmlHope it's clear. Sorry for the question, but I am just not understanding how you get 8*(2*4*5*6*7*9*10*11*12*13+1) from 13!+8 then how do you know that k is a multiple of 8...I obviously have some deficiencies when it comes to number properties. So then how is k never a prime between those parameters? I would think (1*2*3*4*5*6*7*8*9*10*11*12*13) +8 ... k=13!+8 means k=2*3*4*5*6*7* 8*9*10*11*12*13+ 8, now factor out 8: k=8*(2*4*5*6*7*9*10*11*12*13+1) --> k is a multiple of 8 as k=8*something --> as k is a multiple of 8 it can not be a prime number. You can have any number from 2 to 13 inclusive instead of 8, and you'll be able to factor out this number the same way as you did with 8, so any number of a type 13!+x, wher x is from 2 to 13 inclusive will be a multiple of x, thus not a prime number. Check the link in my first post for similar problem. Also check Number Theory chapter of Math Book: math-number-theory-88376.htmlHope 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
Joined: 05 Mar 2011
Posts: 160
Followers: 0
Kudos [?]:
2
[0], given: 3
|
153. Does the integer k have a factor p such that 1>p>k?
(1) k>4!
(2) 13! + 2 <= k <= 13! + 13
|
|
|
|
|
|
Manager
Joined: 29 Jul 2011
Posts: 113
Location: United States
Followers: 1
Kudos [?]:
21
[0], given: 6
|
Answer can't be E, it has to be B. I don't have OG with me, but I need to check. 1. By itself not sufficient. K could be prime. 2. 13! + 2 <= K <= 13! + 13 ensures that you have ever number from 2 - 13 dividing k. That is: 13! + 2 -> div by 2 13! + 3 -> div by 3 ... so on till 13. So, answer should be B.
_________________
I am the master of my fate. I am the captain of my soul.
Please consider giving +1 Kudos if deserved!
DS - If negative answer only, still sufficient. No need to find exact solution.
PS - Always look at the answers first
CR - Read the question stem first, hunt for conclusion
SC - Meaning first, Grammar second
RC - Mentally connect paragraphs as you proceed. Short = 2min, Long = 3-4 min
|
|
|
|
|
|
GMAT Club team member
Joined: 02 Sep 2009
Posts: 11594
Followers: 1799
Kudos [?]:
9585
[0], given: 826
|
|
|
|
|
|
|
Senior Manager
Joined: 13 Aug 2012
Posts: 468
Followers: 12
Kudos [?]:
75
[0], given: 11
|
Re: Does the integer k have a factor p such that 1<p<k? [#permalink]
22 Jan 2013, 03:40
gmatcracker2010 wrote: i dont have any idea to solve the attached problem. Please provide methodology to solve such problems. Does the integer k have a factor p such that 1<p<k? (1) k > 4! (2) 13! + 2<= k <= 13!+13 1. if k=29 p=29= k NO! if k =35 p could be 7 or 5 YES! INSUFFICIENT! 2. 13! + 2 = 2(13!/2 + 1) = 2*odd 13! + 3 = 3(13!/3 + 1) = 3*odd ... 13! + 13 = 13 (12! +1) = 13*odd Always there is a 1< p < 13! + n Answer: B
|
|
|
|
|
|
|
Re: Does the integer k have a factor p such that 1<p<k?
[#permalink]
22 Jan 2013, 03:40
|
|
|
|
|
|
|
|
|
|
|
close
