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 Your Progress

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

Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 500,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Re: If n is the greatest positive integer for which 2n is a fact [#permalink]

Show Tags

25 Dec 2012, 10:18

1

This post received KUDOS

In the questions where you are supposed to find out the maximum power of a prime factor which is a factor of n!, keep one only on thing in mind: Let the prime number you are looking for be x, then: \(n/x + n/x^2 + n/x^3.........n/x^k\) where \(x^k\) <=n. If you apply this rule here, \(10/2 +10/2^2 +10/2^3\) or 5+2+1=8. Hence maximum power of 2 in \(10!\) will be 8.
_________________

Re: If n is the greatest positive integer for which 2n is a fact [#permalink]

Show Tags

09 Jan 2014, 13:22

1

This post received KUDOS

1

This post was BOOKMARKED

If n is the greatest positive integer for which 2^n is a factor of 10!, then n =?

A. 2 B. 4 C. 6 D. 8 E. 10

Solution: On a closer look this Qs is asking how many 2s are there in multiplication of 10! Now, as we know 10! can be written as -- 10.9.8.7.6.5.4.3.2.1

As this is a small multiplication ( To review , not to do), we can check how many 2s we have in this.., So, 10-1 (no.of 2s), 8-3(no.of 2s), 6-1(no.of 2s),4-2(no.of 2s),2-1(no.of 2s)

Re: If n is the greatest positive integer for which 2n is a fact [#permalink]

Show Tags

14 May 2015, 15:05

Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________

Many Test Takers get these types of questions wrong because they move too quickly through the work and don't do enough work on their pads. It's a relatively straight-forward prompt though...

We're essentially asked to find all the "2"s inside 10!

The 'key' to this question is to realize that some values have MORE THAN ONE 2 in them....

10! = (10)(9)(8)(7)(6)(5)(4)(3)(2)(1)

10 = 5x2 --> one 2 8 = 2x2x2 --> three 2s 6 = 3x2 --> one 2 4 = 2x2 --> two 2s 2 = 1x2 --> one 2

After days of waiting, sharing the tension with other applicants in forums, coming up with different theories about invites patterns, and, overall, refreshing my inbox every five minutes to...

I was totally freaking out. Apparently, most of the HBS invites were already sent and I didn’t get one. However, there are still some to come out on...

In early 2012, when I was working as a biomedical researcher at the National Institutes of Health , I decided that I wanted to get an MBA and make the...