|
|
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.
Posts: 22
Updated on: 21 Oct 2019, 07:34
Originally posted by arjunrampal on 29 Dec 2009, 09:00.
Last edited by Bunuel on 21 Oct 2019, 07:34, edited 2 times in total.
Last edited by Bunuel on 21 Oct 2019, 07:34, edited 2 times in total.
Edited the question and added the OA.
Be sure to select an answer first to save it in the Error Log before revealing the correct answer (OA)!
Difficulty:
55%
(hard)
Question Stats:
57% (01:35) correct
43%
(01:47)
wrong
based on 1940
sessions
History
Date
Time
Result
Not Attempted Yet
If k is an integer greater than 1, is k equal to 2^r for some positive integer r?
(1) k is divisible by 2^6.
(2) k is not divisible by any odd integer greater than 1.
(1) k is divisible by 2^6.
(2) k is not divisible by any odd integer greater than 1.
Pure algebraic questions like this one are no longer part of the GMAT Data Sufficiency syllabus.
For relevant Data Sufficiency questions, please check the Data Sufficiency forum:
Data Sufficiency Forum
Data Sufficiency Forum
s1 is insufficient because k is at least 64 if it is divisible by 2^6. so, k cannot equal to 2, 2^2 (4), 2^3 (8), 2^4 (16), and 2^5 (32). However, it can equal to 2^6, 2^7, 2^8 ....
s2 is sufficient because if k is larger than 1 and cannot divisible by any odd number, then 2 and any power of 2 are the only factors of k. Therefore, k can equal to any power of 2.
s2 is sufficient because if k is larger than 1 and cannot divisible by any odd number, then 2 and any power of 2 are the only factors of k. Therefore, k can equal to any power of 2.
If k is an integer greater than 1, is k equal to 2^r for some positive integer r?
Given: \(k=integer>1\), question is \(k=2^r\).
Basically we are asked to determine whether \(k\) has only 2 as prime factor in its prime factorization.
(1) k is divisible by 2^6 --> \(2^6*p=k\), if \(p\) is a power of 2 then the answer is YES and if \(p\) is the integer other than 2 in any power (eg 3, 5, 12...) then the answer is NO.
(2) k is not divisible by any odd integers greater then 1. Hence \(k\) has only power of 2 in its prime factorization. Sufficient.
Answer: B.
You can check Gmat Club Math Book link below for quant topics.
_________________
Given: \(k=integer>1\), question is \(k=2^r\).
Basically we are asked to determine whether \(k\) has only 2 as prime factor in its prime factorization.
(1) k is divisible by 2^6 --> \(2^6*p=k\), if \(p\) is a power of 2 then the answer is YES and if \(p\) is the integer other than 2 in any power (eg 3, 5, 12...) then the answer is NO.
(2) k is not divisible by any odd integers greater then 1. Hence \(k\) has only power of 2 in its prime factorization. Sufficient.
Answer: B.
You can check Gmat Club Math Book link below for quant topics.
_________________
New to the GMAT Club?
- • Questions: Question Bank | Bunuel's Signature Collection
• Tests: GMAT Club Tests | Forum Quiz
• Guides: Quantitative | Critical Reasoning | Reading Comprehension | Ultimate Quant Guide | All You Need for Quant
• Rules: Quantitative | Verbal
Posts: 22
Bunuel - you rock man!
Kudos!
Kudos!
(1) k is divisible by 2^6 - NOT SUFFICIENT - I Agree
(2) k is not divisible by any odd integer greater than 1 - SUFFICIENT - I disagree
This means k is divisible by 2,4,6,8,10,12,14 and so on.
so k can have 2,3,5,7 in its prime factors.
If k can only have 2's or it can have 2's and 3/5/7
So, this is NOT SUFFICIENT.
Please reply if I am missing something here.
(2) k is not divisible by any odd integer greater than 1 - SUFFICIENT - I disagree
This means k is divisible by 2,4,6,8,10,12,14 and so on.
so k can have 2,3,5,7 in its prime factors.
If k can only have 2's or it can have 2's and 3/5/7
So, this is NOT SUFFICIENT.
Please reply if I am missing something here.
nizam
OA for this question is B: please read the solution above.
Also red part in your reasoning is not correct.
Statement (2): \(k\) is not divisible by any odd integers greater then 1, so how it can be divisible by 6=2*3 or 10=2*5 or 12=4*3 or 14=2*7?
For example if it's divisible by 6 then it would mean that it's divisible by every factor of 6 too, so by 3 as well, but we are told that \(k\) is not divisible by any odd integers greater then 1 so it can not be divisible by 6. The above statement means that \(k\) is not divisible by any number which has an odd factor greater than 1, so 2 is only prime factor of \(k\).
Hope it's clear.
_________________
New to the GMAT Club?
- • Questions: Question Bank | Bunuel's Signature Collection
• Tests: GMAT Club Tests | Forum Quiz
• Guides: Quantitative | Critical Reasoning | Reading Comprehension | Ultimate Quant Guide | All You Need for Quant
• Rules: Quantitative | Verbal
Hi Bunuel,
Suppose if \(k=64\) and \(r=2\). In such case \(k=2^r\) does not hold true.
What I was thinking that we must have to get value of r in order to prove this..
Please, comment.
Cheers!
Suppose if \(k=64\) and \(r=2\). In such case \(k=2^r\) does not hold true.
What I was thinking that we must have to get value of r in order to prove this..
Please, comment.
Cheers!
samark
I'm not sure I understand your question. If k=64 why it's necessary r to equal to 2?
From (2) we have that the only prime factor of \(k\) is 2 which means \(k=2^r\), for some integer \(r\geq{1}\) --> \(k=64=2^6\), so in this case \(r=6\).
_________________
New to the GMAT Club?
- • Questions: Question Bank | Bunuel's Signature Collection
• Tests: GMAT Club Tests | Forum Quiz
• Guides: Quantitative | Critical Reasoning | Reading Comprehension | Ultimate Quant Guide | All You Need for Quant
• Rules: Quantitative | Verbal
kpali
Joined: 22 May 2013
Last visit: 20 Dec 2014
Posts: 35
Concentration: General Management, Technology
Schools: Tippie '16 Sloan '16 Tepper '16 Duke '16
GPA: 3.9
WE:Information Technology (Computer Software)
Schools: Tippie '16 Sloan '16 Tepper '16 Duke '16
Posts: 35
arjunrampal
Question: Its a YES or NO question.
Either k=2^r or not, we need to get a definite answer thats all, r>0
(1) k is divisible by 2^6.
2^6 * x =k
x could be anything, 1,2,3,4 etc =>Not sufficient
(2) k is not divisible by any odd integer greater than 1.
well okay, so 3,5,7 etc are all out of the loop, anything that involves odd no's, then that leaves us only even no's to work with.
and even no's are all multiple of 2, so yeah, for some positive r? k=2^r is possible.
Sufficient.
Ans: B
shahrukh0603
Joined: 19 Aug 2015
Last visit: 21 Mar 2017
Posts: 4
Schools: Mannheim"17 LBS '19 Insead July'17 Hult '18 IMD '17
Schools: Mannheim"17 LBS '19 Insead July'17 Hult '18 IMD '17
Posts: 4
If k is an integer greater than 1, is k equal to 2^r for some positive integer r? (D)
(1) k is divisible by 2^6
(2) k is not divisible by any odd integer greater than 1
Now here we have the word "some".
Stmnt 1 is true for some values of r = 7,8,etc
So why is it insufficient ?
(1) k is divisible by 2^6
(2) k is not divisible by any odd integer greater than 1
Now here we have the word "some".
Stmnt 1 is true for some values of r = 7,8,etc
So why is it insufficient ?
shahrukh0603
Joined: 19 Aug 2015
Last visit: 21 Mar 2017
Posts: 4
Schools: Mannheim"17 LBS '19 Insead July'17 Hult '18 IMD '17
Schools: Mannheim"17 LBS '19 Insead July'17 Hult '18 IMD '17
Posts: 4
shahrukh0603
I know it gives you different answers but the question also says "some". Not getting this discrepancy.
Posts: 4,475
shahrukh0603
Dear shahrukh0603,
I'm happy to respond.
My friend, this is a very specialized use of the word "some," a use quite different from the use in ordinary language, but a use typical of mathematics.
When a problem is specifying a precise mathematical condition, it uses the term "some value" to mean "a unique and in existence but currently unknown value." That is the sense of the word in this problem. You see, not in GMAT math, but in higher mathematics, many many proofs are "existence proofs." For example, if you have taken calculus, the Mean Value Theorem is an existence theorem: it merely guarantees that a particular value, the mean value, exists----it doesn't give us any concrete ideas about how to find that value. With the Mean Value Theorem, it's relatively simple to do the calculation to solve, but with many problem in levels of math far beyond calculus, all we have is the proof of existence: we have no way to know how to find the value whose existence is guaranteed.
This prompt question uses the word "some" in the sense of mathematical existence, not in the ordinary colloquial sense. In other words, it is saying,
If k is an integer greater than 1, does there exist a particular positive integer r, such that k = 2^r?
The problem with Statement #1 is that it gives a maybe answer to this precise question.
If k = 2^8, then r = 8, the unique value exists. Answer = Yes.
If k = 5(2^8), then there is no possible positive integer value of r such that k = 2^r (the value of r would be 8 + ln(5)/ln(2) = 10.32192809..., which is not an integer---you do not need to know how to find that expression or value for the GMAT). Answer = No.
Since both a yes and a no answer are possible, this statement is insufficient.
Does all this make sense?
Mike
_________________
Mike McGarry
Magoosh Test Prep
Education is not the filling of a pail, but the lighting of a fire. — William Butler Yeats (1865 – 1939)
Magoosh Test Prep
Education is not the filling of a pail, but the lighting of a fire. — William Butler Yeats (1865 – 1939)
Automated notice from GMAT Club BumpBot:
A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.
This post was generated automatically.
_________________
A member just gave Kudos to this thread, showing it’s still useful. I’ve bumped it to the top so more people can benefit. Feel free to add your own questions or solutions.
This post was generated automatically.
_________________
Moderator:
Announcements
How to Tell If Your GMAT Prep Resources Are Actually Helping You
Subscribe to GMAT Club for New Podcast Episodes, Debriefs, & Insightful Sessions on GMAT Preparation
Subscribe to GMAT Club for New Podcast Episodes, Debriefs, & Insightful Sessions on GMAT Preparation
Tuck at Dartmouth
AI at Dartmouth Tuck: How the School Is Preparing Leaders for the Age of Artificial Intelligence
Inside the courses, research, and hands-on learning defining wise, decisive leadership in an AI-driven world.
Read More
Inside the courses, research, and hands-on learning defining wise, decisive leadership in an AI-driven world.
Read More
Top 5 GMAT Debrief Videos
Success stories and strategies from high-scoring candidates.