Events & Promotions
|
|
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
Track
Your Progress
Practice
Pays
Not interested in getting valuable practice questions and articles delivered to your email? No problem, unsubscribe here.
Nov 2007:30 AM PST
-08:30 AM PST
Learn what truly sets the UC Riverside MBA apart and how it helps in your professional growth
Nov 1912:30 PM EST
-01:30 PM EST
Learn how Keshav, a Chartered Accountant, scored an impressive 705 on GMAT in just 30 days with GMATWhiz's expert guidance. In this video, he shares preparation tips and strategies that worked for him, including the mock, time management, and more
Nov 2001:30 PM EST
-02:30 PM IST
Learn how Kamakshi achieved a GMAT 675 with an impressive 96th %ile in Data Insights. Discover the unique methods and exam strategies that helped her excel in DI along with other sections for a balanced and high score.
Nov 2211:00 AM IST
-01:00 PM IST
Do RC/MSR passages scare you? e-GMAT is conducting a masterclass to help you learn – Learn effective reading strategies Tackle difficult RC & MSR with confidence Excel in timed test environment- Nov 23
11:00 AM IST
-01:00 PM IST
Attend this free GMAT Algebra Webinar and learn how to master the most challenging Inequalities and Absolute Value problems with ease. 
Nov 2407:00 PM PST
-08:00 PM PST
Full-length FE mock with insightful analytics, weakness diagnosis, and video explanations!
Nov 2510:00 AM EST
-11:00 AM EST
Prefer video-based learning? The Target Test Prep OnDemand course is a one-of-a-kind video masterclass featuring 400 hours of lecture-style teaching by Scott Woodbury-Stewart, founder of Target Test Prep and one of the most accomplished GMAT instructors.
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
75%
(hard)
Question Stats:
40% (01:09) correct
60%
(01:10)
wrong
based on 672
sessions
History
Date
Time
Result
Not Attempted Yet
If \(n\) is a positive integer, what is the smallest value of \(n\) for which \(n!\) is divisible by 1,000?
A. 8
B. 10
C. 15
D. 20
E. 25
A. 8
B. 10
C. 15
D. 20
E. 25
Experience GMAT Club Test Questions
Yes, you've landed on a GMAT Club Tests question
Craving more? Unlock our full suite of GMAT Club Tests here
Want to experience more? Get a taste of our tests with our free trial today
Rise to the challenge with GMAT Club Tests. Happy practicing!
08 Jan 2015, 08:32
Kudos
Bookmarks
iNumbv
In order n! to be divisible by 1,000, it should have at least 3 trailing zeros. A trailing 0 in factorial of a number is produced by 2 and 5 in it: 2*5 = 10. So, we need 10 to be in n! at least in power of 3.
5! = 120 has 1 trailing zeros.
10! will have 2 trailing zeros.
15! will have 3 trailing zeros.
Answer: C.
For similiar questions check Trailing Zeros Questions and Power of a number in a factorial questions in our Special Questions Directory.
Theory on Trailing Zeros: https://gmatclub.com/forum/everything-a ... 85592.html
Hope this helps.
General Discussion
12 Aug 2023, 06:59
Kudos
Bookmarks
If \(n\) is a positive integer, what is the smallest value of \(n\) for which \(n!\) is divisible by 1,000?
A. 8
B. 10
C. 15
D. 20
E. 25
Trailing zeros:
Trailing zeros are a sequence of 0's in the decimal representation of a number, after which no other digits follow. For example, 125,000 has 3 trailing zeros.
The number of trailing zeros in \(n!\), the factorial of a non-negative integer \(n\), can be determined with this formula:
\(\frac{n}{5} + \frac{n}{5^2} + \frac{n}{5^3} + ... + \frac{n}{5^k}\), where \(k\) must be chosen such that \(5^{(k+1)} > n\).
It's easier if we consider an example:
How many zeros are at the end (after which no other digits follow) of \(32!\)?
\(\frac{32}{5} + \frac{32}{5^2} = 6 + 1 = 7\). Notice that the last denominator (\(5^2\)) must be less than 32. Also note that we take into account only the quotient of the division, that is \(\frac{32}{5} = 6\). So there are 7 zeros at the end of \(32!\).
Another example: how many trailing zeros does \(125!\) have?
\(\frac{125}{5} + \frac{125}{5^2} + \frac{125}{5^3} = 25 + 5 + 1 = 31\). So there are 31 zeros at the end of \(125!\).
The formula actually counts the number of factors of 5 in \(n!\), but since there are at least as many factors of 2, this is equivalent to the number of factors of 10, each of which contributes one more trailing zero.
Back to the original question:
According to the above, for \(n!\) to be divisible by 1,000, it must have at least 3 trailing zeros. To achieve this, \(n\) must have at least 3 factors of 5. Therefore, the answer is 15, since \(\frac{15}{5} = 3\).
Answer: C
A. 8
B. 10
C. 15
D. 20
E. 25
Trailing zeros:
Trailing zeros are a sequence of 0's in the decimal representation of a number, after which no other digits follow. For example, 125,000 has 3 trailing zeros.
The number of trailing zeros in \(n!\), the factorial of a non-negative integer \(n\), can be determined with this formula:
\(\frac{n}{5} + \frac{n}{5^2} + \frac{n}{5^3} + ... + \frac{n}{5^k}\), where \(k\) must be chosen such that \(5^{(k+1)} > n\).
It's easier if we consider an example:
How many zeros are at the end (after which no other digits follow) of \(32!\)?
\(\frac{32}{5} + \frac{32}{5^2} = 6 + 1 = 7\). Notice that the last denominator (\(5^2\)) must be less than 32. Also note that we take into account only the quotient of the division, that is \(\frac{32}{5} = 6\). So there are 7 zeros at the end of \(32!\).
Another example: how many trailing zeros does \(125!\) have?
\(\frac{125}{5} + \frac{125}{5^2} + \frac{125}{5^3} = 25 + 5 + 1 = 31\). So there are 31 zeros at the end of \(125!\).
The formula actually counts the number of factors of 5 in \(n!\), but since there are at least as many factors of 2, this is equivalent to the number of factors of 10, each of which contributes one more trailing zero.
Back to the original question:
According to the above, for \(n!\) to be divisible by 1,000, it must have at least 3 trailing zeros. To achieve this, \(n\) must have at least 3 factors of 5. Therefore, the answer is 15, since \(\frac{15}{5} = 3\).
Answer: C
