It is currently 22 Oct 2017, 20:15

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

# Coprimes below 'n'

Author Message
Intern
Joined: 11 Aug 2009
Posts: 8

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

### Show Tags

11 Aug 2009, 12:53
00:00

Difficulty:

(N/A)

Question Stats:

50% (03:23) correct 50% (01:43) wrong based on 3 sessions

### HideShow timer Statistics

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

Q) How many numbers exist below 2100 such that the only common factor between that number and 2100 is 1?
a) 480
b) 343
c) 326
d) 540
e) 700

The OA is given as
[Reveal] Spoiler:
A

Please explain how to proceed on this one.

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

Manager
Joined: 25 Jul 2009
Posts: 115

Kudos [?]: 262 [3], given: 17

Schools: NYU, NUS, ISB, DUKE, ROSS, DARDEN

### Show Tags

11 Aug 2009, 13:12
3
KUDOS
I guess you posted this query in the wrong thread!

Anyways, I dont think such a question will ever appear on the GMAT. This is a direct application of Euler-Totient Function (Refer http://2000clicks.com/MathHelp/NumberFa ... nction.htm)

To apply this function to the question posted, we will have to factorize 2100:
=> 2100 = 2^2 * 3 * 5^2 * 7
=> 2100 has 4 prime factors viz. 2,3,5 & 7

According to Euler-Totient Fn the number of numbers below 2100 that have 1 as the only common factor with 2100 are:
=> 2100 * (1 - 1/2) * (1 - 1/3) * (1 - 1/5) * (1 - 1/7)
=> 2100 * 1/2 * 2/3 * 4/5 * 6/7
=> 480

ANS: A

PS: Where did you get this question?
_________________

KUDOS me if I deserve it !!

My GMAT Debrief - 740 (Q50, V39) | My Test-Taking Strategies for GMAT | Sameer's SC Notes

Kudos [?]: 262 [3], given: 17

Intern
Joined: 11 Aug 2009
Posts: 8

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

### Show Tags

11 Aug 2009, 13:22
Thats brilliant! Thanks!

How can you bew so sure that such a question will never appear on the GMAT?

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

Manager
Joined: 10 Jul 2009
Posts: 164

Kudos [?]: 117 [0], given: 8

### Show Tags

11 Aug 2009, 13:36
Good explanation!!!

Kudos [?]: 117 [0], given: 8

Manager
Joined: 25 Jul 2009
Posts: 115

Kudos [?]: 262 [0], given: 17

Schools: NYU, NUS, ISB, DUKE, ROSS, DARDEN

### Show Tags

11 Aug 2009, 15:09
sergbov123 wrote:
Thats brilliant! Thanks!

How can you bew so sure that such a question will never appear on the GMAT?

Because there is no other way of solving this sum within 2 minutes and obviously GMAC does not expect the test taker to know about Euler-Totient Fn. I mean this isnt a Math Olympiad man!
_________________

KUDOS me if I deserve it !!

My GMAT Debrief - 740 (Q50, V39) | My Test-Taking Strategies for GMAT | Sameer's SC Notes

Kudos [?]: 262 [0], given: 17

Re: Coprimes below 'n'   [#permalink] 11 Aug 2009, 15:09
Display posts from previous: Sort by