It is currently 23 Oct 2017, 19:43

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

# What is the value of the integer n? (1) N!= (N-1)!*N (2)

Author Message
TAGS:

### Hide Tags

Manager
Joined: 16 May 2011
Posts: 203

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

Concentration: Finance, Real Estate
GMAT Date: 12-27-2011
WE: Law (Law)
What is the value of the integer n? (1) N!= (N-1)!*N (2) [#permalink]

### Show Tags

06 Jun 2011, 10:39
00:00

Difficulty:

25% (medium)

Question Stats:

81% (01:02) correct 19% (01:38) wrong based on 67 sessions

### HideShow timer Statistics

What is the value of the integer n?
(1) N!= (N-1)!*N

(2) N^3+3N^2+2N is divisible by 3

ANY HELP WILL BE WELCOMED
[Reveal] Spoiler: OA

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

Senior Manager
Joined: 24 Mar 2011
Posts: 439

Kudos [?]: 215 [1], given: 20

Location: Texas

### Show Tags

06 Jun 2011, 12:36
1
KUDOS
St 1 doesnt provide any information. Its just another way of expressing N!.

St 2 - solving the equation we get N (N+1) (N+2) is divisible by 3. N can have lot of values like 4,5,6,7.. etc.
so not sufficient.

together also we dont get a unique value of N.

So E.

I am not sure if this is GMAT Q. Does Gmat provide a sufficiency statement like 1? What is the source of the Q.

Kudos [?]: 215 [1], given: 20

Manager
Joined: 16 May 2011
Posts: 203

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

Concentration: Finance, Real Estate
GMAT Date: 12-27-2011
WE: Law (Law)

### Show Tags

06 Jun 2011, 14:24
it's taken from manhattan archive- which includes some of the hardest i have seen and frankly i believe that only som GC legends will be able to solve some of them under 4 minutes.

by the way, how do you decide to prefer E (which is correct) and not C

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

Intern
Joined: 28 Mar 2011
Posts: 22

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

GMAT 1: 720 Q50 V39

### Show Tags

06 Jun 2011, 14:39
1/ N! = N(N-1)(N-2).... = N[(N-1)(N-2)....] = N*(N-1)! so there is no new info brought by this by 1/. It is just another expression of N!

2/ N^3+3N^2+2N is divisible by 3: You can find endless integers fulfilling this condition.

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

Senior Manager
Joined: 24 Mar 2011
Posts: 439

Kudos [?]: 215 [1], given: 20

Location: Texas

### Show Tags

06 Jun 2011, 14:59
1
KUDOS
dimri10 wrote:
it's taken from manhattan archive- which includes some of the hardest i have seen and frankly i believe that only som GC legends will be able to solve some of them under 4 minutes.

by the way, how do you decide to prefer E (which is correct) and not C

Vow, MGMAT? i guess than must be to trick people.

Basically, if you combine A and B, there is no additional info other than what we have achieved in B. Because remember that A doesn't provide any other info other than its just different way of expressng N!.

Kudos [?]: 215 [1], given: 20

Re: FRACTIONS   [#permalink] 06 Jun 2011, 14:59
Display posts from previous: Sort by