Last visit was: 19 Nov 2025, 11:00 It is currently 19 Nov 2025, 11:00
Home
GMAT
Messages
Tests
Schools
Events
Rewards
Chat
My Profile
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.
Go to My Error Log Learn more
Close
Request Expert Reply
Confirm Cancel
Back to Forum
Create Topic
 1   2   
User avatar
gmatcracker2010
User avatar
Joined: 13 May 2010
Last visit: 27 Sep 2010
Posts: 80
Own Kudos:
911
 [584]
Given Kudos: 7
Posts: 80
Kudos: 911
 [584]
Does the integer k have a factor p such that 1 < p < k ? 19 Jun 2010, 03:49
32
Kudos
Add Kudos
552
Bookmarks
Bookmark this Post
00:00
Start Timer
Pause Timer
Resume Timer
Show Answer
Hide
Show
History
B
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!

Difficulty:

55% (hard)

Question Stats:

61% (01:41) correct 39% (02:00) wrong based on 4840 sessions

History

Date
Time
Result
Not Attempted Yet
Does the integer k have a factor p such that 1<p<k?


(1) k > 4!

(2) \(13! + 2 \leq k \leq 13!+13\)
ShowHide Answer
Official Answer
B
Most Helpful Reply
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,390
Own Kudos:
778,308
 [279]
Given Kudos: 99,977
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,390
Kudos: 778,308
 [279]
Does the integer k have a factor p such that 1 < p < k ? 19 Jun 2010, 04:51
106
Kudos
Add Kudos
169
Bookmarks
Bookmark this Post
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*3*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: https://gmatclub.com/forum/factor-factorials-100670.html

Hope it's clear.
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,390
Own Kudos:
778,308
 [24]
Given Kudos: 99,977
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,390
Kudos: 778,308
 [24]
Does the integer k have a factor p such that 1 < p < k ? 14 Feb 2012, 16:15
17
Kudos
Add Kudos
7
Bookmarks
Bookmark this Post
M3tm4n
Hi bunuel
I don't understand the definition of a prime ( 1<p<k ). I know what a prime is but this drives me nuts.
For an example I take 10 for k. I have factors 2x5 that are greater than 1 and smaller than 10. :?:

Or is it asking for one factor? I see "a factor" in the question, which is singular. Then I understand this. It is really tricky.

Posted from GMAT ToolKit
Show more

Question asks whether some number k has a factor p which is more than 1 but less than k. For example if k=10 then the answer is yes, since both 2 and 5 are factors of 10 and are more than 1 and less than 10. But if for example k=7=prime then the answer is no, since 7 has no factor which is more than 1 and less than 7.

Now, look at the definition of a prime number: a prime number is a positive integer with exactly two factors: 1 and itself. So, we can say that the questions asks whether k is a prime number, because if it is then it won't have a factor which is more than 1 and less than k.

Hope it's clear.
General Discussion
User avatar
metallicafan
User avatar
Retired Moderator
Joined: 04 Oct 2009
Last visit: 26 Aug 2020
Posts: 759
Own Kudos:
4,406
 [3]
Given Kudos: 109
Status:2000 posts! I don't know whether I should feel great or sad about it! LOL
Location: Peru
Concentration: Finance, SMEs, Developing countries, Public sector and non profit organizations
Schools:Harvard, Stanford, Wharton, MIT &amp; HKS (Government)
GPA: 4.0
WE 1: Economic research
WE 2: Banking
WE 3: Government: Foreign Trade and SMEs
Posts: 759
Kudos: 4,406
 [3]
Does the integer k have a factor p such that 1 < p < k ? 03 Nov 2010, 15:20
1
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
Bunuel
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.html

Hope it's clear.
Show more

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!
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,390
Own Kudos:
778,308
 [6]
Given Kudos: 99,977
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,390
Kudos: 778,308
 [6]
Does the integer k have a factor p such that 1 < p < k ? 03 Nov 2010, 15:51
4
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
metallicafan
Bunuel
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.html

Hope 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!
Show more

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 cannot 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.
avatar
ChenggongMAS
avatar
Joined: 12 Nov 2010
Last visit: 13 Apr 2024
Posts: 17
Own Kudos:
75
Given Kudos: 3
Posts: 17
Kudos: 75
Does the integer k have a factor p such that 1 < p < k ? 10 Feb 2011, 18:04
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
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.html

Hope it's clear.
Show more

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 ...
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,390
Own Kudos:
778,308
 [15]
Given Kudos: 99,977
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,390
Kudos: 778,308
 [15]
Does the integer k have a factor p such that 1 < p < k ? 10 Feb 2011, 18:19
10
Kudos
Add Kudos
5
Bookmarks
Bookmark this Post
ChenggongMAS
Bunuel
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.html

Hope 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 ...
Show more

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

Hope it's clear.
avatar
M3tm4n
avatar
Joined: 06 Nov 2011
Last visit: 23 Mar 2012
Posts: 28
Own Kudos:
20
 [2]
Given Kudos: 50
Location: Germany
Concentration: Entrepreneurship, General Management
GMAT Date: 03-10-2012
GPA: 3
Posts: 28
Kudos: 20
 [2]
Does the integer k have a factor p such that 1 < p < k ? 14 Feb 2012, 14:27
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hi bunuel
I don't understand the definition of a prime ( 1<p<k ). I know what a prime is but this drives me nuts.
For an example I take 10 for k. I have factors 2x5 that are greater than 1 and smaller than 10. :?:

Or is it asking for one factor? I see "a factor" in the question, which is singular. Then I understand this. It is really tricky.

Posted from GMAT ToolKit
User avatar
mneeti
User avatar
Joined: 30 Oct 2011
Last visit: 15 Dec 2018
Posts: 24
Own Kudos:
73
Given Kudos: 13
Posts: 24
Kudos: 73
Does the integer k have a factor p such that 1 < p < k ? 18 Nov 2012, 03:18
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
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: if-x-is-an-integer-does-x-have-a-factor-n-such-that-100670.html

Hope it's clear.
Show more


Hi Bunuel, I have a small query here- Had the question been : 4!+2<k<4!+6, if I follow the approach explained above I may conclude that k is not a prime no. reason being all the factors of 4! are the factors of 4!+?. Since its easy to calculate here the values between 4!+2 and 4!+6, I already know that it includes 29 which is a prime no., where as in case of 13!+2<k<13!+13, it is not easy to calculate 13!, we may be missing some value which is a prime no. How do we make sure that we are not missing anything? (Assuming we can not cross check by calculating the values because of the time constraint at the exam time)
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,390
Own Kudos:
778,308
 [4]
Given Kudos: 99,977
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,390
Kudos: 778,308
 [4]
Does the integer k have a factor p such that 1 < p < k ? 18 Nov 2012, 05:01
2
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
mneeti
Bunuel
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: if-x-is-an-integer-does-x-have-a-factor-n-such-that-100670.html

Hope it's clear.


Hi Bunuel, I have a small query here- Had the question been : 4!+2<k<4!+6, if I follow the approach explained above I may conclude that k is not a prime no. reason being all the factors of 4! are the factors of 4!+?. Since its easy to calculate here the values between 4!+2 and 4!+6, I already know that it includes 29 which is a prime no., where as in case of 13!+2<k<13!+13, it is not easy to calculate 13!, we may be missing some value which is a prime no. How do we make sure that we are not missing anything? (Assuming we can not cross check by calculating the values because of the time constraint at the exam time)
Show more

If \(13!+2\leq{k}\leq{13!+13}\), then we can factor out \(x\) out of \(13!+x\) (where \(2\leq{x}\leq{13}\)), which means that k is not a prime.

But you cannot apply the same logic with 4!+2<k<4!+6, since if k=4!+5, then you cannot factor out 5 out of it.
avatar
gultrage
avatar
Joined: 21 Apr 2013
Last visit: 15 Jan 2014
Posts: 6
Own Kudos:
20
 [5]
Posts: 6
Kudos: 20
 [5]
Does the integer k have a factor p such that 1 < p < k ? 29 May 2013, 23:17
5
Kudos
Add Kudos
Bookmarks
Bookmark this Post
crazypriya
Does the integer k have a factor p such that 1<p<k?
1.k>4!
2.13!+2<=k<=13!+13

Show Spoiler
OA B
Show more
Essentially this is about prime and non-prime.
Option 1: k>4!
Now assume k=5. then is there any factor of 5 which lies between 1 and 5? NO.
Take k=6. then there is 2,3 which lies between 1 and 6.
So 1 alone insufficient.

Option 2: 13!+2<=k<=13!+13
Take say 13!+3. now it can be rewritten as 3*{(13.12.11.....4.2.1)+1}
So there is 3 as factor between 1 and k. Similarly you can take the common factor out of all nos. in option 2.
Therefore option 2 is sufficient!
Add Kudos if this helps!
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,390
Own Kudos:
778,308
 [7]
Given Kudos: 99,977
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,390
Kudos: 778,308
 [7]
Does the integer k have a factor p such that 1 < p < k ? 13 Apr 2014, 07:01
1
Kudos
Add Kudos
6
Bookmarks
Bookmark this Post
Similar questions to practice:
https://gmatclub.com/forum/if-x-is-an-in ... 00670.html
https://gmatclub.com/forum/for-any-integ ... 68575.html
https://gmatclub.com/forum/does-integer- ... 65983.html
https://gmatclub.com/forum/if-z-is-an-in ... 28732.html

Hope this helps.
User avatar
BrentGMATPrepNow
User avatar
Major Poster
Joined: 12 Sep 2015
Last visit: 31 Oct 2025
Posts: 6,739
Own Kudos:
35,346
 [19]
Given Kudos: 799
Location: Canada
Expert
Expert reply
Posts: 6,739
Kudos: 35,346
 [19]
Does the integer k have a factor p such that 1 < p < k ? 04 Oct 2015, 18:30
14
Kudos
Add Kudos
5
Bookmarks
Bookmark this Post
gmatcracker2010
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
Show more
Target question: Does the integer k have a factor p such that 1 < p < k ?

This question is a great candidate for rephrasing the target question. (We have a free video with tips on rephrasing the target question: https://www.gmatprepnow.com/module/gmat-data-sufficiency?id=1100)

Let's look at a few cases to get a better idea of what the target question is asking.
- Try k = 6. Since 2 is a factor of 6, we can see that k DOES have a factor p such that 1<p<k.
- Try k = 10 Since 5 is a factor of 10, we can see that k DOES have a factor p such that 1<p<k.
- Try k = 16. Since 4 is a factor of 14, we can see that k DOES have a factor p such that 1<p<k.
- Try k = 5. Since 1 and 5 are the ONLY factors of 5, we can see that k does NOT have a factor p such that 1<p<k.
Aha, so if k is a prime number, then it CANNOT satisfy the condition of having a factor p such that 1 < p < k
In other words, the target question is really asking us whether k is a non-prime integer (aka a "composite integer")

REPHRASED target question: Is integer k a non-prime integer?

Statement 1: k > 4!
In other words, k > 24
This does not help us determine whether or not k is a non-prime integer? No.
Consider these two conflicting cases:
Case a: k = 25, in which case k is a non-prime integer
Case b: k = 29, in which case k is a prime integer
Since we cannot answer the target question with certainty, statement 1 is NOT SUFFICIENT

Statement 2: 13! + 2 ≤ k ≤ 13! + 13
Let's examine a few possible values for k.

k = 13! + 2
= (13)(12)(11)....(5)(4)(3)(2)(1) + 2
= 2[(13)(12)(11)....(5)(4)(3)(1) + 1]
Since k is a multiple of 2, k is a non-prime integer

k = 13! + 3
= (13)(12)(11)....(5)(4)(3)(2)(1) + 3
= 3[(13)(12)(11)....(5)(4)(2)(1) + 1]
Since k is a multiple of 3, k is a non-prime integer

k = 13! + 4
= (13)(12)(11)....(5)(4)(3)(2)(1) + 4
= 4[(13)(12)(11)....(5)(3)(2)(1) + 1]
Since k is a multiple of 4, k is a non-prime integer

As you can see, this pattern can be repeated all the way up to k = 13! + 13. In EVERY case, k is a non-prime integer

Since we can answer the target question with certainty, statement 2 is SUFFICIENT

Answer = B

Cheers,
Brent
User avatar
mcelroytutoring
User avatar
Joined: 10 Jul 2015
Last visit: 15 Nov 2025
Posts: 1,204
Own Kudos:
2,644
 [1]
Given Kudos: 282
Status:Expert GMAT, GRE, and LSAT Tutor / Coach
Affiliations: Harvard University, A.B. with honors in Government, 2002
Location: United States (CO)
Age: 45 (10 years and counting on GMAT Club!)
GMAT 1: 770 Q47 V48
GMAT 2: 730 Q44 V47
GMAT 3: 750 Q50 V42
GMAT 4: 730 Q48 V42 (Online)
GRE 1: Q168 V169
GRE 2: Q170 V170
Expert
Expert reply
GMAT 4: 730 Q48 V42 (Online)
GRE 1: Q168 V169
GRE 2: Q170 V170
Posts: 1,204
Kudos: 2,644
 [1]
Does the integer k have a factor p such that 1 < p < k ? 28 Mar 2016, 18:21
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
Here is a visual that should help.
Attachments

Screen Shot 2016-03-28 at 6.20.15 PM.png
Screen Shot 2016-03-28 at 6.20.15 PM.png [ 133.71 KiB | Viewed 73081 times ]

avatar
ruchitd
avatar
Joined: 10 Dec 2014
Last visit: 30 Jan 2017
Posts: 2
Posts: 2
Kudos: 0
Does the integer k have a factor p such that 1 < p < k ? 04 Dec 2016, 21:07
Kudos
Add Kudos
Bookmarks
Bookmark this Post
"Question basically asks whether k is a prime number. If it is, then it won't have a factor psuch that 1<p<k

(definition of a prime number)."

Hi,

I just don't understand this. Can you please explain?
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,390
Own Kudos:
778,308
Given Kudos: 99,977
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,390
Kudos: 778,308
Does the integer k have a factor p such that 1 < p < k ? 05 Dec 2016, 01:16
Kudos
Add Kudos
Bookmarks
Bookmark this Post
ruchitd
"Question basically asks whether k is a prime number. If it is, then it won't have a factor psuch that 1<p<k

(definition of a prime number)."

Hi,

I just don't understand this. Can you please explain?
Show more

A prime number is a positive integer with only two factors 1 and itself. So, a prime number does not have a factor which is more that 1 and less than itself.
User avatar
rocko911
User avatar
Joined: 11 Feb 2017
Last visit: 12 Apr 2018
Posts: 157
Own Kudos:
36
 [1]
Given Kudos: 206
Posts: 157
Kudos: 36
 [1]
Does the integer k have a factor p such that 1 < p < k ? 08 Jul 2017, 13:07
Kudos
Add Kudos
1
Bookmarks
Bookmark this Post
[quote="Bunuel"][quote="mneeti"][quote="Bunuel"]


Bunuel , Please make me understand one thing.

The question tells us that 1<p<k

which means p can be anything smaller than k , and question asks if p is a factor of K?

it means if k is 25 then is p a factor of 25? or we can assume p be any number less than 25 and check if its factor of 25 or not

My question is in option B,

If 13! + 2 <= k <= 13! + 13 , it means k is a very large digit and lies between those equalities.
SO NOW , p must be any integer less than k and we need to see if p is a factor of k?

How about 17? lets take p as 17

1<=17<=(13!+2,13!+3,13!+4........13!+13)
as we know from B that k has a factor , yes we can see 2, 3 ,4 ,5 till 13 it has factor but hat about 17?

17 satisfies the criteria and it should also be a factor and if its not then it must be uncertain if p is factor of k or not?


PLEASE HELP
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,390
Own Kudos:
778,308
Given Kudos: 99,977
Products:
GMAT Club Tests Forum Quiz
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,390
Kudos: 778,308
Does the integer k have a factor p such that 1 < p < k ? 09 Jul 2017, 02:16
Kudos
Add Kudos
Bookmarks
Bookmark this Post
rocko911
Bunuel , Please make me understand one thing.

The question tells us that 1<p<k

which means p can be anything smaller than k , and question asks if p is a factor of K?

it means if k is 25 then is p a factor of 25? or we can assume p be any number less than 25 and check if its factor of 25 or not

My question is in option B,

If 13! + 2 <= k <= 13! + 13 , it means k is a very large digit and lies between those equalities.
SO NOW , p must be any integer less than k and we need to see if p is a factor of k?

How about 17? lets take p as 17

1<=17<=(13!+2,13!+3,13!+4........13!+13)
as we know from B that k has a factor , yes we can see 2, 3 ,4 ,5 till 13 it has factor but hat about 17?

17 satisfies the criteria and it should also be a factor and if its not then it must be uncertain if p is factor of k or not?


PLEASE HELP
Show more

Forget about p. The question asks does a positive integer k, has a factor which is greater than 1 and less than k itself. As explained on previous pages this is the same as asking is k a prime number. If k is a prime number it won't have any such factor but if k is not a prime number, then it'll have such factor(s).
User avatar
oryahalom
User avatar
Joined: 18 May 2017
Last visit: 05 Nov 2017
Posts: 44
Own Kudos:
19
 [2]
Given Kudos: 125
Posts: 44
Kudos: 19
 [2]
Does the integer k have a factor p such that 1 < p < k ? 09 Jul 2017, 07:08
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel - i have subtracted 13! from each side of the inequality and got that k is equal or between 0 to 11. From this inequality i can't got the answer. Where am i wrong? By the way - i looked at the math book for inequality theory but haven't find something relevant. Is there any post that covers this topic?

Thanks in advance!
avatar
rudjlive
avatar
Joined: 10 Jul 2017
Last visit: 26 Jan 2018
Posts: 6
Own Kudos:
7
Given Kudos: 2
Posts: 6
Kudos: 7
Does the integer k have a factor p such that 1 < p < k ? 12 Nov 2017, 09:22
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hi Bunuel,

I have the same question as oryahalom.

Cant we subtract 13! from both sides of the inequality?

Thanks,
RD
 1   2   
Moderators:
Bunuel
Math Expert
105390 posts
kingbucky
496 posts