Find all School-related info fast with the new School-Specific MBA Forum

 It is currently 28 Jun 2016, 21:13

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

# (2P)!=|P+1| simply and elegantly, isn't it

Author Message
SVP
Joined: 03 Feb 2003
Posts: 1603
Followers: 8

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

(2P)!=|P+1| simply and elegantly, isn't it [#permalink]

### Show Tags

20 Jun 2003, 08:04
00:00

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions

### HideShow timer Statistics

This topic is locked. If you want to discuss this question please re-post it in the respective forum.

(2P)!=|P+1|

simply and elegantly, isn't it?
SVP
Joined: 03 Feb 2003
Posts: 1603
Followers: 8

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

### Show Tags

20 Jun 2003, 12:19
seems OK, but post your solution, not guessing!
Manager
Joined: 25 May 2003
Posts: 54
Followers: 1

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

### Show Tags

21 Jun 2003, 14:54
no method, just T&E
SVP
Joined: 03 Feb 2003
Posts: 1603
Followers: 8

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

### Show Tags

23 Jun 2003, 00:07
Nevertheless, a method does exist:

When you see a factorial, think about positive integers no less than one.

(2P)!=|P+1|

draw two graphs and see intersections. there are two intersections P={0 and 1}
Display posts from previous: Sort by