It is currently 17 Nov 2017, 12:53

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

# If m and n are positive integers, and if p and q are

Author Message
Manager
Joined: 01 Sep 2003
Posts: 72

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

Location: NYC
If m and n are positive integers, and if p and q are [#permalink]

### Show Tags

20 Dec 2003, 21:56
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.

If m and n are positive integers, and if p and q are different prime number, do p/q and n/m represent different number?

1. Neither n nor m is a prime number.

2. m is not divisible by q

>>> the correct answer is B >>>

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

Manager
Joined: 12 Oct 2003
Posts: 247

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

Location: USA

### Show Tags

20 Dec 2003, 23:06
PLEASE DO NOT INCLUDE THE CORRECT ANSWER IN THE ORIGINAL POST. It kills the fun. I saw an ans in some other post by you too, so ....

Quote:
If m and n are positive integers, and if p and q are different prime number, do p/q and n/m represent different number?

1. Neither n nor m is a prime number.

Case 1: p=2; q=3; n=4; m=6; p/q = n/m
Case 2 n=4; m=5; p/q <> n/m
So insufficient.

Quote:
2. m is not divisible by q

According to (1)Case 1 - we can prove that p/q=n/m. But for this to be true n & m need to be multiple of p & q respectively. Then only the division will lead to an equivalent number. But if, as stated in (2), m is not divisible by q, there is no way that you shall ever get p/q = n/m, because p & q are prime numbers and so the division result can be recreated only by their multiples.

So from 2 we conclude that p/q <> n/m and so it is sufficient.

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

20 Dec 2003, 23:06
Display posts from previous: Sort by