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:
p and q are integers. If p is divisible by 10^q and cannot be divisible by 10^(q + 1), what is the value of q? (1) p is divisible by 2^5, but is not divisible by 2^6. (2) p is divisible by 5^6, but is not divisible by 5^7
p is divisible by 10^q and cannot be divisible by 10^(q + 1) means that # of trailing zeros of p is q (p ends with q zeros).
(1) p is divisible by 2^5, but is not divisible by 2^6 --> # of trailing zeros, q, is less than or equal to 5: \(q\leq{5}\) (as for each trailing zero we need one 2 and one 5 in prime factorization of p then this statement says that there are enough 2-s for 5 zeros but we don't know how many 5-s are there). Not sufficient.
(2) p is divisible by 5^6, but is not divisible by 5^7 --> # of trailing zeros, q, is less than or equal to 6: \(q\leq{6}\) (there are enough 5-s for 6 zeros but we don't know how many 2-s are there). Not sufficient.
(1)+(2) 2-s and 5-s are enough for 5 trailing zeros: \(q=5\) (# of 2-s are limiting factor). Sufficient.
Re: p and q are integers. If p is divisible by 10q and canno [#permalink]
Show Tags
15 Nov 2012, 12:28
Bunuel wrote:
banksy wrote:
p and q are integers. If p is divisible by 10^q and cannot be divisible by 10^(q + 1), what is the value of q? (1) p is divisible by 2^5, but is not divisible by 2^6. (2) p is divisible by 5^6, but is not divisible by 5^7
p is divisible by 10^q and cannot be divisible by 10^(q + 1) means that # of trailing zeros of p is q (p ends with q zeros).
(1) p is divisible by 2^5, but is not divisible by 2^6 --> # of trailing zeros, q, is less than or equal to 5: \(q\leq{5}\) (as for each trailing zero we need one 2 and one 5 in prime factorization of p then this statement says that there are enough 2-s for 5 zeros but we don't know how many 5-s are there). Not sufficient.
(2) p is divisible by 5^6, but is not divisible by 5^7 --> # of trailing zeros, q, is less than or equal to 6: \(q\leq{6}\) (there are enough 5-s for 6 zeros but we don't know how many 2-s are there). Not sufficient.
(1)+(2) 2-s and 5-s are enough for 5 trailing zeros: \(q=5\) (# of 2-s are limiting factor). Sufficient.
Answer: C.
From condition 1 and condition 2 it we got \(q\leq{5}\) and \(q\leq{6}\) so possible cases can be \(q\leq{5}\) so q can be anything 5,4,3,2,...... So both together aren't sufficient right?
Re: p and q are integers. If p is divisible by 10q and canno [#permalink]
Show Tags
14 Jan 2014, 22:08
Bunuel wrote:
banksy wrote:
p and q are integers. If p is divisible by 10^q and cannot be divisible by 10^(q + 1), what is the value of q? (1) p is divisible by 2^5, but is not divisible by 2^6. (2) p is divisible by 5^6, but is not divisible by 5^7
p is divisible by 10^q and cannot be divisible by 10^(q + 1) means that # of trailing zeros of p is q (p ends with q zeros).
(1) p is divisible by 2^5, but is not divisible by 2^6 --> # of trailing zeros, q, is less than or equal to 5: \(q\leq{5}\) (as for each trailing zero we need one 2 and one 5 in prime factorization of p then this statement says that there are enough 2-s for 5 zeros but we don't know how many 5-s are there). Not sufficient.
(2) p is divisible by 5^6, but is not divisible by 5^7 --> # of trailing zeros, q, is less than or equal to 6: \(q\leq{6}\) (there are enough 5-s for 6 zeros but we don't know how many 2-s are there). Not sufficient.
(1)+(2) 2-s and 5-s are enough for 5 trailing zeros: \(q=5\) (# of 2-s are limiting factor). Sufficient.
Answer: C.
How do we know the question is asking us to use the concept of trailing zeroes. I understand the concept but how do we know that we have to apply trailing zeroes concept.
How do we know the question is asking us to use the concept of trailing zeroes. I understand the concept but how do we know that we have to apply trailing zeroes concept.
Isn't that the core challenge of GMAT? The concepts tested are quite basic. Why then, does everyone not get Q50? Because you really need to understand them very well to be able to see which particular concept is used in a particular question. Here, when you see
"If p is divisible by 10^q and cannot be divisible by 10^(q + 1)" you should understand that p has q trailing 0s (that's how it is will be divisible by 10^q) but it does not have q+1 trailing 0s. This means it has exactly q trailing 0s.
If p has q trailing 0s, it must have at least q 2s and at least q 5s (but both 2s and 5s cannot be more than q) Statement 1 tells you about the 2s but not about the 5s. Statement 2 tells you about the 5s but not about the 2s. Both statements together tell you that you can make five 0s. and hence q must be 5.
_________________
p and q are integers. If p is divisible by 10^q and cannot be divisible by 10^(q + 1), what is the value of q?
(1) p is divisible by 2^5, but is not divisible by 2^6. (2) p is divisible by 5^6, but is not divisible by 5^7
Yeah right on, what the question is really asking is what is the maximum number of trailing zeroes that P can have
With both statements together we get that the maximum number must be 5
Hence C is the correct answer
Hope it helps Cheers! J
Hi, I did not get part where you said it is asking for maximum number of trailing zeros. Is it because of statement 1) ? thanks in advance.
What is the meaning of trailing zeroes?
102000 has 3 trailing zeroes i.e. 3 zeroes at the end. 1920040 has only 1 trailing zero. Trailing zeroes means the number of zeroes at the end - after a non zero number.
Now think, 19200 = 192*100 So 19200 is divisible by 100 but not by 1000 or 10000 etc. Since 19200 has 2 trailing zeroes, it will be divisible by 10^2 but not by 10^3 or 10^4 or 10^5 etc.
The question stem tells you that p is divisible by 10^q but not by 10^(q+1); this means that p has exactly q trailing zeroes. For every 0 at the end, you need the number to be a multiple of 10 i.e. a 2 and a 5. Stmt 1 tells you that p has 5 2s and stmnt 2 tells you that p has 6 5s. Together, you can make only 5 10s. So q must be 5.
_________________
Re: p and q are integers. If p is divisible by 10^q and cannot [#permalink]
Show Tags
26 Jan 2016, 16:14
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.
_________________
Forget conventional ways of solving math questions. In DS, Variable approach is the easiest and quickest way to find the answer without actually solving the problem. Remember equal number of variables and independent equations ensures a solution.
p and q are integers. If p is divisible by 10^q and cannot be divisible by 10^(q + 1), what is the value of q?
(1) p is divisible by 2^5, but is not divisible by 2^6. (2) p is divisible by 5^6, but is not divisible by 5^7
In the original condition, there are 2 variables(p,q), which should match with the number of equations. So you need 2 equations. For 1) 1 equation, for 2) 1 equation, which is likely to make C the answer. When 1) & 2), they become p=5(10^5)k(k is 2 or 5, which are not prime factors but integer). So, only q=5 is possible, which is unique and sufficient. For 1), just like p=5(2^5), 5^2(2^5), it is not unique and not sufficient. For 2), just like p=2(5^6), 2^2(5^6), it is not unique and not sufficient. Therefore, the answer is C.
--> For cases where we need 2 more equations, such as original conditions with “2 variables”, or “3 variables and 1 equation”, or “4 variables and 2 equations”, we have 1 equation each in both 1) and 2). Therefore, there is 70% chance that C is the answer, while E has 25% chance. These two are the majority. In case of common mistake type 3,4, the answer may be from A, B or D but there is only 5% chance. Since C is most likely to be the answer using 1) and 2) separately according to DS definition (It saves us time). Obviously there may be cases where the answer is A, B, D or E.
_________________
Re: p and q are integers. If p is divisible by 10^q and cannot [#permalink]
Show Tags
16 Mar 2016, 06:18
Excellent Question here we need to work on the values of q clearly combination statement is sufficient as q=5 else q=no specific value in individual statements hence C
_________________
Re: p and q are integers. If p is divisible by 10^q and cannot [#permalink]
Show Tags
28 Feb 2017, 12:52
2
This post received KUDOS
from 1
we can see 2^5 can divide p but not 2^6. so can conclude that q is at most 5 or less(q<=5) depending upon no. of 5's available.(5*2=10) so not sufficient.
from 2
we can see 5^6 can divide p but not 5^7. so can conclude that q is at most 6 or less(q<=6) depending upon no. of 2's available.(5*2=10) so not sufficient.
Now taking both (1) & (2) maximum no. of 2's available is 5 and maximum no. of 5's available is 6. so we can take five 2's and 5's i.e (2*5) five times. hence sufficient.
gmatclubot
Re: p and q are integers. If p is divisible by 10^q and cannot
[#permalink]
28 Feb 2017, 12:52
There’s something in Pacific North West that you cannot find anywhere else. The atmosphere and scenic nature are next to none, with mountains on one side and ocean on...
This month I got selected by Stanford GSB to be included in “Best & Brightest, Class of 2017” by Poets & Quants. Besides feeling honored for being part of...
Joe Navarro is an ex FBI agent who was a founding member of the FBI’s Behavioural Analysis Program. He was a body language expert who he used his ability to successfully...
close
57% (02:17) correct
3
