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

It is currently 23 May 2013, 00:58
Customize  |  Hide

what is the least N such that N! is divisible by 1000? a)

  Question banks Downloads My Bookmarks Reviews  
Author Message
TAGS:
Intern
Intern
Joined: 03 Apr 2006
Posts: 46
Followers: 0

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

GMAT Tests User
what is the least N such that N! is divisible by 1000? a) [#permalink] New post 30 May 2007, 11:43
00:00

Question Stats:

0% (00:00) correct 0% (00:00) wrong based on 0 sessions
what is the least N such that N! is divisible by 1000?

a) 8
b)10
c) 15
d) 20
e)25

explanation please.... OA will follow
VP
VP
User avatar
Joined: 08 Jun 2005
Posts: 1172
Followers: 5

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

GMAT Tests User
 [#permalink] New post 30 May 2007, 11:48
Factor (1000) = 2,5,2,5

we need N! to include at least all numbers 2,5,2*5=10, so N! has to be equal to or grater then 10!

the answer is (B)

:-D
Intern
Intern
Joined: 04 Feb 2007
Posts: 40
Followers: 1

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

GMAT Tests User
 [#permalink] New post 30 May 2007, 12:06
prime factors (1000)=5*5*5*2*2*2

N! to include min. of three 5s and a min. of three 2s for becming divisible by 1000.

min. (N!) = 15! ==15......*10......*8........5.....
=5.........5*2.......2*2*2........5 (suff.)
Intern
Intern
Joined: 03 Apr 2006
Posts: 46
Followers: 0

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

GMAT Tests User
 [#permalink] New post 30 May 2007, 12:45
OA is C

any other explanations?
VP
VP
User avatar
Joined: 08 Jun 2005
Posts: 1172
Followers: 5

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

GMAT Tests User
 [#permalink] New post 30 May 2007, 12:48
vidyasagar wrote:
prime factors (1000)=5*5*5*2*2*2

N! to include min. of three 5s and a min. of three 2s for becming divisible by 1000.

min. (N!) = 15! ==15......*10......*8........5.....
=5.........5*2.......2*2*2........5 (suff.)


Yes ! my mistake , I factored 1000 as 2,2,5,5

well done vidyasagar

-----------------------------

another way to explain is:

Factor (1000) = 2,2,2,5,5,5

10! = 2*3*4*5*6*7*8*9*10

2*3*4*5*6*7*8*9*10/2*2*2*5*5*5 = we can cancel out to get:

(3*6*7*8*9*2)/5 = not an integer

15! = 2*3*4*5*6*7*8*9*10*11*12*13*14*15

(2*3*4*5*6*7*8*9*10*11*12*13*14*15)/(2*2*2*5*5*5)

3*6*7*8*9*2*11*12*13*14*3 = an integer

:)
Senior Manager
Senior Manager
Joined: 11 Jun 2006
Posts: 254
Followers: 2

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

GMAT Tests User
 [#permalink] New post 30 May 2007, 13:06
Clearly (C)

When you prime factor 1000 you get Three 5's... 15 is the least number that will give you Three 5's.
Intern
Intern
User avatar
Joined: 30 Nov 2006
Posts: 20
Followers: 0

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

Ans C [#permalink] New post 30 May 2007, 14:37
Prime Factor for 1000:
5*5*5*2*2*2

This goes to the Denominator.
So in the numerator we need to have all of this to arrive at the least possible number. That would be 15.

I.e.:
Numerator:
2*3*(2*2)*5*(3*2)*7*(2*2*2)*(3*3)*(5*2)*11*(3*2*2)*13*(7*2)*(3*5)

This is nothing but trying out numbers till I get to the one where all of the denominator gets reduced to 1.

Denom:
5*5*5*2*2*2

So the least is 15. You dont have to expand all of the numbers though.
Director
Director
User avatar
Joined: 03 Sep 2006
Posts: 910
Followers: 5

Kudos [?]: 29 [0], given: 33

CAT Tests
Re: Divisible PS... [#permalink] New post 30 May 2007, 21:06
hsk wrote:
what is the least N such that N! is divisible by 1000?

a) 8
b)10
c) 15
d) 20
e)25

explanation please.... OA will follow


I don't know how to explain this one! I just tried a few values and 15 seems to be the answer. Is there some short cut or trick which can be used?
VP
VP
User avatar
Joined: 08 Jun 2005
Posts: 1172
Followers: 5

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

GMAT Tests User
Re: Divisible PS... [#permalink] New post 30 May 2007, 21:29
LM wrote:
hsk wrote:
what is the least N such that N! is divisible by 1000?

a) 8
b)10
c) 15
d) 20
e)25

explanation please.... OA will follow


I don't know how to explain this one! I just tried a few values and 15 seems to be the answer. Is there some short cut or trick which can be used?


just think about the least value you need , if you know that Factor (1000) is 2,2,2,5,5,5, on the face of it N! has to include at least 5?

since 5! = (5*4*3*2*1) and (5*4*3*2*1)/2*2*2*5 = 3

but you still have 5,5, left !! so using the same logic we can say that N! has to be at least 10! = 10*9*8*7*6*5*4*3*2*1

since the next number that can be canceled out by 5 is 10 , and that leave us with the last five , that can only be canceld out with 15

so the least N! is 15!

:-D
Re: Divisible PS...   [#permalink] 30 May 2007, 21:29
    Similar topics Author Replies Last post
Similar
Topics:
Popular new posts EXPERTS_POSTS_IN_THIS_TOPIC What is the least N such that N! is divisible by 1000? 8 10 bmwhype2 10 25 Oct 2007, 12:06
New posts If n is a pos. integer, is n is divisible by at least six el1981 1 27 Jan 2008, 13:59
New posts What is the least N such that N! is divisible by 1000? 8 10 sondenso 6 10 May 2008, 18:46
New posts 2 If n is a positive integer, is n divisible by at least six robinzheng722 3 29 Jul 2010, 11:08
This topic is locked, you cannot edit posts or make further replies. New EXPERTS_POSTS_IN_THIS_TOPIC 227. If 990 is divisible by l23 … n, what is the least p banksy 1 02 Mar 2011, 03:24
Display posts from previous: Sort by

what is the least N such that N! is divisible by 1000? a)

  Question banks Downloads My Bookmarks Reviews  


cron

GMAT Club MBA Forum Home| About| Privacy Policy| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

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