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.
Apr 2212:30 AM EDT
-01:30 AM EDT
At one point, she believed GMAT wasn’t for her. After scoring 595, self-doubt crept in and she questioned her potential. But instead of quitting, she made the right strategic changes. The result? A remarkable comeback to 695. Check out how Saakshi did it.
Apr 1612:00 PM EDT
-11:59 PM EDT
You’re first to know: Save $200 on GMAT prep starting tomorrow, 4/13. Get 6 official practice tests and study with real questions. Be ready to save!
Apr 2301:30 AM EDT
-02:30 AM EDT
Struggling with GMAT Verbal as a non-native speaker? Harsh improved his score from 595 to 695 in just 45 days—and scored a 99 %ile in Verbal (V88)! Learn how smart strategy, clarity, and guided prep helped him gain 100 points.
Apr 2308:00 PM PDT
-09:00 PM PDT
Video explanations + diagnosis of 10 weakest areas + 150+ short videos + study plan!
Apr 2610:00 AM EDT
-11:00 AM EDT
The Target Test Prep course represents a quantum leap forward in GMAT preparation, a radical reinterpretation of the way that students should study. Try before you buy with a 5-day, full-access trial of the course for FREE!
Apr 2711:00 AM EDT
-12:00 PM EDT
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
Apr 2808:00 AM PDT
-11:00 AM PDT
Whether you are just beginning your MBA journey or fine-tuning your path to a 700+ score, GMAT Day is designed to give you a competitive edge.
C
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
65%
(hard)
Question Stats:
45% (01:11) correct
55%
(01:11)
wrong
based on 729
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
