Find all School-related info fast with the new School-Specific MBA Forum

It is currently 26 May 2016, 02:40
GMAT Club Tests

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.

Events & Promotions

Events & Promotions in June
Open Detailed Calendar

p and q are integers. If p is divisible by 10^q and cannot

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  
Author Message
TAGS:

Hide Tags

Manager
Manager
avatar
Joined: 10 Feb 2011
Posts: 114
Followers: 1

Kudos [?]: 175 [0], given: 10

p and q are integers. If p is divisible by 10^q and cannot [#permalink]

Show Tags

New post 10 Feb 2011, 16:05
29
This post was
BOOKMARKED
00:00
A
B
C
D
E

Difficulty:

  55% (hard)

Question Stats:

58% (02:19) correct 42% (01:33) wrong based on 744 sessions

HideShow timer Statistics

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
[Reveal] Spoiler: OA

Last edited by Bunuel on 29 Oct 2013, 06:22, edited 1 time in total.
Added the OA.
Expert Post
5 KUDOS received
Veritas Prep GMAT Instructor
User avatar
Joined: 16 Oct 2010
Posts: 6573
Location: Pune, India
Followers: 1790

Kudos [?]: 10763 [5] , given: 211

Re: p and q are integers. If p is divisible by 10q and canno [#permalink]

Show Tags

New post 14 Jan 2014, 22:34
5
This post received
KUDOS
Expert's post
4
This post was
BOOKMARKED
Vidhi1 wrote:

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.
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Get started with Veritas Prep GMAT On Demand for $199

Veritas Prep Reviews

Expert Post
3 KUDOS received
Math Expert
User avatar
Joined: 02 Sep 2009
Posts: 33007
Followers: 5753

Kudos [?]: 70509 [3] , given: 9849

Re: p and q are integers. If p is divisible by 10q and canno [#permalink]

Show Tags

New post 10 Feb 2011, 16:43
3
This post received
KUDOS
Expert's post
10
This post was
BOOKMARKED
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.
_________________

New to the Math Forum?
Please read this: All You Need for Quant | PLEASE READ AND FOLLOW: 12 Rules for Posting!!!

Resources:
GMAT Math Book | Triangles | Polygons | Coordinate Geometry | Factorials | Circles | Number Theory | Remainders; 8. Overlapping Sets | PDF of Math Book; 10. Remainders | GMAT Prep Software Analysis | SEVEN SAMURAI OF 2012 (BEST DISCUSSIONS) | Tricky questions from previous years.

Collection of Questions:
PS: 1. Tough and Tricky questions; 2. Hard questions; 3. Hard questions part 2; 4. Standard deviation; 5. Tough Problem Solving Questions With Solutions; 6. Probability and Combinations Questions With Solutions; 7 Tough and tricky exponents and roots questions; 8 12 Easy Pieces (or not?); 9 Bakers' Dozen; 10 Algebra set. ,11 Mixed Questions, 12 Fresh Meat

DS: 1. DS tough questions; 2. DS tough questions part 2; 3. DS tough questions part 3; 4. DS Standard deviation; 5. Inequalities; 6. 700+ GMAT Data Sufficiency Questions With Explanations; 7 Tough and tricky exponents and roots questions; 8 The Discreet Charm of the DS; 9 Devil's Dozen!!!; 10 Number Properties set., 11 New DS set.


What are GMAT Club Tests?
Extra-hard Quant Tests with Brilliant Analytics

1 KUDOS received
Current Student
User avatar
Joined: 06 Sep 2013
Posts: 2035
Concentration: Finance
GMAT 1: 770 Q0 V
Followers: 43

Kudos [?]: 463 [1] , given: 355

GMAT ToolKit User
Re: p and q are integers. If p is divisible by 10^q and cannot [#permalink]

Show Tags

New post 05 Jan 2014, 06:58
1
This post received
KUDOS
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



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 :)
Expert Post
1 KUDOS received
Veritas Prep GMAT Instructor
User avatar
Joined: 16 Oct 2010
Posts: 6573
Location: Pune, India
Followers: 1790

Kudos [?]: 10763 [1] , given: 211

Re: p and q are integers. If p is divisible by 10^q and cannot [#permalink]

Show Tags

New post 14 Dec 2014, 04:09
1
This post received
KUDOS
Expert's post
sunilp wrote:
jlgdr 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



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.
_________________

Karishma
Veritas Prep | GMAT Instructor
My Blog

Get started with Veritas Prep GMAT On Demand for $199

Veritas Prep Reviews

Manager
Manager
avatar
Joined: 05 Nov 2012
Posts: 172
Followers: 1

Kudos [?]: 26 [0], given: 57

Re: p and q are integers. If p is divisible by 10q and canno [#permalink]

Show Tags

New post 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?
Intern
Intern
avatar
Joined: 25 Nov 2013
Posts: 19
Concentration: Marketing, International Business
GMAT Date: 02-14-2014
GPA: 2.3
WE: Other (Internet and New Media)
Followers: 1

Kudos [?]: 4 [0], given: 11

Re: p and q are integers. If p is divisible by 10^q and cannot [#permalink]

Show Tags

New post 14 Jan 2014, 22:05
jlgdr 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



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 :)


can you please explain this question.
Intern
Intern
avatar
Joined: 25 Nov 2013
Posts: 19
Concentration: Marketing, International Business
GMAT Date: 02-14-2014
GPA: 2.3
WE: Other (Internet and New Media)
Followers: 1

Kudos [?]: 4 [0], given: 11

Re: p and q are integers. If p is divisible by 10q and canno [#permalink]

Show Tags

New post 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.
Intern
Intern
avatar
Joined: 04 Dec 2014
Posts: 1
Concentration: Strategy, International Business
GMAT Date: 04-30-2015
Followers: 0

Kudos [?]: 0 [0], given: 53

GMAT ToolKit User
Re: p and q are integers. If p is divisible by 10^q and cannot [#permalink]

Show Tags

New post 11 Dec 2014, 06:45
jlgdr 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



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.
GMAT Club Legend
GMAT Club Legend
User avatar
Joined: 09 Sep 2013
Posts: 9627
Followers: 465

Kudos [?]: 120 [0], given: 0

Premium Member
Re: p and q are integers. If p is divisible by 10^q and cannot [#permalink]

Show Tags

New post 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.
_________________

GMAT Books | GMAT Club Tests | Best Prices on GMAT Courses | GMAT Mobile App | Math Resources | Verbal Resources

Expert Post
Math Revolution GMAT Instructor
User avatar
Joined: 16 Aug 2015
Posts: 1200
GPA: 3.82
Followers: 72

Kudos [?]: 553 [0], given: 0

Premium Member
Re: p and q are integers. If p is divisible by 10^q and cannot [#permalink]

Show Tags

New post 27 Jan 2016, 18:51
Expert's post
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.
_________________

MathRevolution: Finish GMAT Quant Section with 10 minutes to spare
The one-and-only World’s First Variable Approach for DS and IVY Approach for PS with ease, speed and accuracy.
Find a 10% off coupon code for GMAT Club members.
Unlimited Access to over 120 free video lessons - try it yourself
See our Youtube demo

Director
Director
User avatar
Joined: 12 Aug 2015
Posts: 686
Followers: 10

Kudos [?]: 63 [0], given: 160

GMAT ToolKit User CAT Tests
Re: p and q are integers. If p is divisible by 10^q and cannot [#permalink]

Show Tags

New post 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] 16 Mar 2016, 06:18
    Similar topics Author Replies Last post
Similar
Topics:
3 Experts publish their posts in the topic If P and Q are positive integers, is the product 3P^Q divisible by 2? Bunuel 5 30 Nov 2015, 04:22
7 Experts publish their posts in the topic If p is a positive integer, is p^2 divisible by 96? Bunuel 9 05 Jun 2015, 06:20
1 Experts publish their posts in the topic If p is an integer, is q an integer? enigma123 2 11 Feb 2012, 18:41
5 Experts publish their posts in the topic If P is divisible by 2, is Q + 5 an integer? (1) The median maheshsrini 8 02 Oct 2011, 15:45
4 Experts publish their posts in the topic If P, Q, R, and S are positive integers, and P/Q = R/S, is R divisible vd 12 02 Jul 2008, 22:20
Display posts from previous: Sort by

p and q are integers. If p is divisible by 10^q and cannot

  new topic post reply Question banks Downloads My Bookmarks Reviews Important topics  


GMAT Club MBA Forum Home| About| Terms and Conditions| GMAT Club Rules| Contact| Sitemap

Powered by phpBB © phpBB Group and phpBB SEO

Kindly note that the GMAT® test is a registered trademark of the Graduate Management Admission Council®, and this site has neither been reviewed nor endorsed by GMAC®.