Check GMAT Club Decision Tracker for the Latest School Decision Releases https://gmatclub.com/AppTrack
GMAT Club

 It is currently 26 Mar 2017, 00:49

### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# Does the integer k have a factor p such that 1 < p <

 post reply Question banks Downloads My Bookmarks Reviews Important topics
Author Message
Intern
Joined: 03 Feb 2005
Posts: 28
Followers: 0

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

Does the integer k have a factor p such that 1 < p < [#permalink]

### Show Tags

07 Oct 2005, 05:48
This topic is locked. If you want to discuss this question please re-post it in the respective forum.

Does the integer k have a factor p such that 1 < p < k?
(1) k > 4!
(2) 13! + 2 <= k <= 13! + 13

A) Statement (1) Alone is sufficient, but statment (2) alone is not sufficient.
B) Statement (2) Alone is sufficient, but statment (1) alone is not sufficient.
C) Both statements together are sufficient, but neither statement alone is sufficient.
D) Each statement alone is sufficient.
E) Statements (1) and (2) together are not sufficient.

_________________

Make use of the socratic method...

Manager
Joined: 06 Oct 2005
Posts: 88
Location: Beantown
Followers: 1

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

### Show Tags

07 Oct 2005, 06:10
The question seems to be asking if integer k is a prime number. Afterall prime numbers only have the factors of 1 and itself. So

(1) Insuff. 4! = 24 but both k = 37 and k=36 could be true so no dice.

(2) Suff. You don't need to calculate since you know that the final number has factors 2-13, adding 2 through 13 will not produce a prime number.

ie. 2 + (13*12*11*10*9*8*7*6*5*4*3*2) will still be a factor of two

and similarly 13 + (13*12*11*10*9*8*7*6*5*4*3*2) will still be a factor of 13.

Both factors have to be less than the number itself.

So I would go with (B).

Brendan.
Intern
Joined: 30 Sep 2005
Posts: 20
Followers: 0

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

### Show Tags

07 Oct 2005, 07:52
bsmith75 wrote:
The question seems to be asking if integer k is a prime number. Afterall prime numbers only have the factors of 1 and itself. So

(1) Insuff. 4! = 24 but both k = 37 and k=36 could be true so no dice.

(2) Suff. You don't need to calculate since you know that the final number has factors 2-13, adding 2 through 13 will not produce a prime number.

ie. 2 + (13*12*11*10*9*8*7*6*5*4*3*2) will still be a factor of two

and similarly 13 + (13*12*11*10*9*8*7*6*5*4*3*2) will still be a factor of 13.

Both factors have to be less than the number itself.

So I would go with (B).

Brendan.

I agree with Brendan... exactly right...
VP
Joined: 22 Aug 2005
Posts: 1120
Location: CA
Followers: 1

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

Re: Integer Problem [#permalink]

### Show Tags

07 Oct 2005, 09:22
Does the integer k have a factor p such that 1 < p < k?
(1) k > 4!
(2) 13! + 2 <= k <= 13! + 13

A) Statement (1) Alone is sufficient, but statment (2) alone is not sufficient.
B) Statement (2) Alone is sufficient, but statment (1) alone is not sufficient.
C) Both statements together are sufficient, but neither statement alone is sufficient.
D) Each statement alone is sufficient.
E) Statements (1) and (2) together are not sufficient.

Question can be restated as :
B.

Is K prime?

(1) : k > 4! there are infinite primes. obviously there is one > 4!. Insufficient.

(2) as we know n! is divisible by all natural number from 1 through n. Now imagin adding any number 1 to n. The new numbers will be divisible by the number added. For example:

5! = 5 * 4 * 3 * 2 * 1
5! + 2 = (5 * 4 * 2 * 1) + 2. As both parts are divisible by 2, sum is divisible by 2.
Similarly,
5! + 3 is divisible by 3

or n! + n is divisible by n

Suffucient.
Re: Integer Problem   [#permalink] 07 Oct 2005, 09:22
Display posts from previous: Sort by

# Does the integer k have a factor p such that 1 < p <

 post reply Question banks Downloads My Bookmarks Reviews Important topics

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