Last visit was: 08 Jul 2025, 19:45 It is currently 08 Jul 2025, 19:45
Close
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

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.
Close
Request Expert Reply
Confirm Cancel
User avatar
banksy
Joined: 10 Feb 2011
Last visit: 01 Apr 2011
Posts: 86
Own Kudos:
1,881
 [167]
Given Kudos: 10
Posts: 86
Kudos: 1,881
 [167]
10
Kudos
Add Kudos
155
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 08 Jul 2025
Posts: 102,594
Own Kudos:
Given Kudos: 97,452
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,594
Kudos: 739,579
 [75]
21
Kudos
Add Kudos
54
Bookmarks
Bookmark this Post
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 08 Jul 2025
Posts: 16,101
Own Kudos:
74,209
 [28]
Given Kudos: 475
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,101
Kudos: 74,209
 [28]
18
Kudos
Add Kudos
10
Bookmarks
Bookmark this Post
General Discussion
User avatar
Amateur
Joined: 05 Nov 2012
Last visit: 17 Nov 2015
Posts: 117
Own Kudos:
117
 [3]
Given Kudos: 57
Posts: 117
Kudos: 117
 [3]
3
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
banksy
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?
User avatar
jlgdr
Joined: 06 Sep 2013
Last visit: 24 Jul 2015
Posts: 1,316
Own Kudos:
2,717
 [2]
Given Kudos: 355
Concentration: Finance
Posts: 1,316
Kudos: 2,717
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
banksy
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 :)
avatar
Vidhi1
Joined: 25 Nov 2013
Last visit: 13 May 2014
Posts: 9
Own Kudos:
Given Kudos: 11
Concentration: Marketing, International Business
GMAT Date: 02-14-2014
GPA: 2.3
WE:Other (Internet and New Media)
Posts: 9
Kudos: 13
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
banksy
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.
avatar
sunilp
Joined: 04 Dec 2014
Last visit: 13 Jan 2015
Posts: 1
Given Kudos: 53
Concentration: Strategy, International Business
GMAT Date: 04-30-2015
Posts: 1
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
jlgdr
banksy
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.
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 08 Jul 2025
Posts: 16,101
Own Kudos:
74,209
 [5]
Given Kudos: 475
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,101
Kudos: 74,209
 [5]
3
Kudos
Add Kudos
2
Bookmarks
Bookmark this Post
sunilp
jlgdr
banksy
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.
avatar
amitsah
Joined: 25 Sep 2016
Last visit: 25 Sep 2019
Posts: 13
Own Kudos:
9
 [2]
Given Kudos: 8
Posts: 13
Kudos: 9
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.
User avatar
chloe2m
Joined: 21 Sep 2023
Last visit: 20 Nov 2024
Posts: 13
Given Kudos: 39
GMAT 1: 610 Q47 V28
GMAT 1: 610 Q47 V28
Posts: 13
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
banksy
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.

Hi Bunuel, I understand this reasoning but I don't understand how the # of 2s could be the limiting factor ? Indeed I thought that 5s were always the limiting factor considering that there were always enough 2s. Therefore at first I said that statement 2 ALONE was sufficient. Thank you for your explanation !
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 08 Jul 2025
Posts: 102,594
Own Kudos:
739,579
 [1]
Given Kudos: 97,452
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 102,594
Kudos: 739,579
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
chloe2m
Bunuel
banksy
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.

Hi Bunuel, I understand this reasoning but I don't understand how the # of 2s could be the limiting factor ? Indeed I thought that 5s were always the limiting factor considering that there were always enough 2s. Therefore at first I said that statement 2 ALONE was sufficient. Thank you for your explanation !

Given that p is divisible by 10^q but not by 10^(q+1), the number of trailing zeros in p, which will be q, is determined by the lesser of the count of 2s and 5s in its prime factorization, since 10 = 2*5. In many cases, like when calculating the number of trailing zeros in p!, 2s are more common and thus 5s become the limiting factor. However, in this specific problem, we are dealing with p, not p!.

Statement (1) tells us that p is divisible by 2^5 but not by 2^6, meaning there are exactly five 2s in p's prime factorization. However, we don't know the number of 5's

Statement (2) says that p is divisible by 5^6 but not by 5^7, indicating there are exactly six 5s in p's prime factorization. However, we don't know the number of 2's.

When considering the statements together, the 2s are the limiting factor for the number of trailing zeros in p. Therefore, q equals 5, as there aren’t enough 2s to pair with all the 5s for more than five zeros.

Hope it's clear.
User avatar
chloe2m
Joined: 21 Sep 2023
Last visit: 20 Nov 2024
Posts: 13
Given Kudos: 39
GMAT 1: 610 Q47 V28
GMAT 1: 610 Q47 V28
Posts: 13
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Bunuel
chloe2m
Hi Bunuel, I understand this reasoning but I don't understand how the # of 2s could be the limiting factor ? Indeed I thought that 5s were always the limiting factor considering that there were always enough 2s. Therefore at first I said that statement 2 ALONE was sufficient. Thank you for your explanation !

Given that p is divisible by 10^q but not by 10^(q+1), the number of trailing zeros in p, which will be q, is determined by the lesser of the count of 2s and 5s in its prime factorization, since 10 = 2*5. In many cases, like when calculating the number of trailing zeros in p!, 2s are more common and thus 5s become the limiting factor. However, in this specific problem, we are dealing with p, not p!.

Statement (1) tells us that p is divisible by 2^5 but not by 2^6, meaning there are exactly five 2s in p's prime factorization. However, we don't know the number of 5's

Statement (2) says that p is divisible by 5^6 but not by 5^7, indicating there are exactly six 5s in p's prime factorization. However, we don't know the number of 2's.

When considering the statements together, the 2s are the limiting factor for the number of trailing zeros in p. Therefore, q equals 5, as there aren’t enough 2s to pair with all the 5s for more than five zeros.

Hope it's clear.

Yes ! Thank you that was very clear. I got indeed mistaken because I assumed p was a factorial and generalized that 5 would be the limiting factor. But as you said in this case 2 is the limiting factor and thus there are 5 trailing zeros (q = 5).
User avatar
bumpbot
User avatar
Non-Human User
Joined: 09 Sep 2013
Last visit: 04 Jan 2021
Posts: 37,358
Own Kudos:
Posts: 37,358
Kudos: 1,010
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.
Moderator:
Math Expert
102594 posts