GMAT Question of the Day - Daily to your Mailbox; hard ones only

It is currently 22 Feb 2019, 04:25

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
Events & Promotions in February
PrevNext
SuMoTuWeThFrSa
272829303112
3456789
10111213141516
17181920212223
242526272812
Open Detailed Calendar
  • Free GMAT RC Webinar

     February 23, 2019

     February 23, 2019

     07:00 AM PST

     09:00 AM PST

    Learn reading strategies that can help even non-voracious reader to master GMAT RC. Saturday, February 23rd at 7 AM PT
  • FREE Quant Workshop by e-GMAT!

     February 24, 2019

     February 24, 2019

     07:00 AM PST

     09:00 AM PST

    Get personalized insights on how to achieve your Target Quant Score.

M21-37

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

Hide Tags

 
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 53066
M21-37  [#permalink]

Show Tags

New post 16 Sep 2014, 00:15
00:00
A
B
C
D
E

Difficulty:

  95% (hard)

Question Stats:

37% (01:12) correct 63% (01:23) wrong based on 134 sessions

HideShow timer Statistics

If for any positive integer \(x\), \(d[x]\) denotes its smallest positive odd divisor and \(D[x]\) denotes its largest odd divisor, is \(x\) even?


(1) \(D[x] - d[x] = 0\)

(2) \(D[3x] = 3\)

_________________

New to the Math Forum?
Please read this: Ultimate GMAT Quantitative Megathread | 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

Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 53066
Re M21-37  [#permalink]

Show Tags

New post 16 Sep 2014, 00:15
2
1
Official Solution:


If for any positive integer \(x\), \(d[x]\) denotes its smallest positive odd divisor and \(D[x]\) denotes its largest odd divisor, is \(x\) even?

First of all note that the smallest positive odd divisor of any positive integer is 1. Thus \(d[x]=1\) for any positive integer \(x\).

(1) \(D[x] - d[x] = 0\). Since \(d[x]=1\), then \(D[x] - 1 = 0\), which gives \(D[x] = 1\). \(x\) can be 1, so odd or \(2^n\), (2, 4, 8, ...), so even. Not sufficient.

(2) \(D[3x] = 3\). Again \(x\) can be 1, so odd, as the largest odd divisor of \(3x=3\) is 3 or \(x\) can be \(2^n\) (2, 4, 8, ...), so even, as the largest odd divisor of \(3*2=6\) or \(2*4=12\) is 3. Not sufficient.

(1)+(2) From (1) and (2) we have that \(x\) can be either 1, so odd or \(2^n\), so even. Not sufficient.


Answer: E
_________________

New to the Math Forum?
Please read this: Ultimate GMAT Quantitative Megathread | 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

Intern
Intern
avatar
Joined: 24 Jun 2015
Posts: 46
GMAT ToolKit User
Re: M21-37  [#permalink]

Show Tags

New post 02 Jul 2015, 04:20
Hi,

Explanation seems good, but it look hard for me; could you develop with more examples or detail the answer?

Thanks a lot.

Luis Navarro
Looking for 700
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 53066
Re: M21-37  [#permalink]

Show Tags

New post 02 Jul 2015, 04:37
2
luisnavarro wrote:
Hi,

Explanation seems good, but it look hard for me; could you develop with more examples or detail the answer?

Thanks a lot.

Luis Navarro
Looking for 700


If for any positive integer x, d[x] denotes its smallest odd divisor and D[x] denotes its largest odd divisor, is x even?

First of all note that the smallest positive odd divisor of any positive integer is 1. Thus \(d[x]=1\) for any x.

(1) D[x] - d[x] = 0 --> \(D[x] - 1 = 0\) --> \(D[x] = 1\) --> x can be 1, so odd or \(2^n\), (2, 4, 8, ...), so even. Not sufficient.

(2) D[3x] = 3 --> again x can be 1, so odd, as the largest odd divisor of \(3x=3\) is 3 or x can be \(2^n\) (2, 4, 8, ...), so even, as the largest odd divisor of 3*2=6 or 2*4=12 is 3. Not sufficient.

(1)+(2) From (1) and (2) we have that x can be either 1, so odd or 2^n, so even. Not sufficient.

Answer: E.
_________________

New to the Math Forum?
Please read this: Ultimate GMAT Quantitative Megathread | 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

Intern
Intern
avatar
Joined: 24 Jun 2015
Posts: 46
GMAT ToolKit User
Re: M21-37  [#permalink]

Show Tags

New post 02 Jul 2015, 05:21
2
Bunuel wrote:
luisnavarro wrote:
Hi,

Explanation seems good, but it look hard for me; could you develop with more examples or detail the answer?

Thanks a lot.

Luis Navarro
Looking for 700


If for any positive integer x, d[x] denotes its smallest odd divisor and D[x] denotes its largest odd divisor, is x even?

First of all note that the smallest positive odd divisor of any positive integer is 1. Thus \(d[x]=1\) for any x.

(1) D[x] - d[x] = 0 --> \(D[x] - 1 = 0\) --> \(D[x] = 1\) --> x can be 1, so odd or \(2^n\), (2, 4, 8, ...), so even. Not sufficient.

(2) D[3x] = 3 --> again x can be 1, so odd, as the largest odd divisor of \(3x=3\) is 3 or x can be \(2^n\) (2, 4, 8, ...), so even, as the largest odd divisor of 3*2=6 or 2*4=12 is 3. Not sufficient.

(1)+(2) From (1) and (2) we have that x can be either 1, so odd or 2^n, so even. Not sufficient.

Answer: E.


Very interesting, great¡¡¡ Actually in my analysis I had not view the 2^n posibilities, and now it is clear to me: For all 2^n the smallest and greatest odd divisor are the same = 1. It is easy to understand when you actually see explanations like yours but, its hard to do "alone".

Thanks.

Luis Navarro
Looking for 700
Intern
Intern
avatar
B
Joined: 29 Jun 2017
Posts: 28
CAT Tests
Re: M21-37  [#permalink]

Show Tags

New post 29 Jan 2019, 00:33
[quote="Bunuel"]Official Solution:


If for any positive integer \(x\), \(d[x]\) denotes its smallest positive odd divisor and \(D[x]\) denotes its largest odd divisor, is \(x\) even?

First of all note that the smallest positive odd divisor of any positive integer is 1. Thus \(d[x]=1\) for any positive integer \(x\).

(1) \(D[x] - d[x] = 0\). Since \(d[x]=1\), then \(D[x] - 1 = 0\), which gives \(D[x] = 1\). \(x\) can be 1, so odd or \(2^n\), (2, 4, 8, ...), so even. Not sufficient.

(2) \(D[3x] = 3\). Again \(x\) can be 1, so odd, as the largest odd divisor of \(3x=3\) is 3 or \(x\) can be \(2^n\) (2, 4, 8, ...), so even, as the largest odd divisor of \(3*2=6\) or \(2*4=12\) is 3. Not sufficient.

(1)+(2) From (1) and (2) we have that \(x\) can be either 1, so odd or \(2^n\), so even. Not sufficient.


Hi Bunuel,
Can you please explain why we need to check for 2^n? Doesn't the problem end at x=1?


Thanks,
Megha.
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 53066
Re: M21-37  [#permalink]

Show Tags

New post 29 Jan 2019, 00:37
Megha1119 wrote:
Bunuel wrote:
Official Solution:


If for any positive integer \(x\), \(d[x]\) denotes its smallest positive odd divisor and \(D[x]\) denotes its largest odd divisor, is \(x\) even?

First of all note that the smallest positive odd divisor of any positive integer is 1. Thus \(d[x]=1\) for any positive integer \(x\).

(1) \(D[x] - d[x] = 0\). Since \(d[x]=1\), then \(D[x] - 1 = 0\), which gives \(D[x] = 1\). \(x\) can be 1, so odd or \(2^n\), (2, 4, 8, ...), so even. Not sufficient.

(2) \(D[3x] = 3\). Again \(x\) can be 1, so odd, as the largest odd divisor of \(3x=3\) is 3 or \(x\) can be \(2^n\) (2, 4, 8, ...), so even, as the largest odd divisor of \(3*2=6\) or \(2*4=12\) is 3. Not sufficient.

(1)+(2) From (1) and (2) we have that \(x\) can be either 1, so odd or \(2^n\), so even. Not sufficient.


Hi Bunuel,
Can you please explain why we need to check for 2^n? Doesn't the problem end at x=1?


Thanks,
Megha.


No. x can be 1 or 2, 4, 8, 16, 32, ... Notice that for all those numbers both statements hold true. For example, for all of them both smallest and largest odd divisors is 1.
_________________

New to the Math Forum?
Please read this: Ultimate GMAT Quantitative Megathread | 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

GMAT Club Bot
Re: M21-37   [#permalink] 29 Jan 2019, 00:37
Display posts from previous: Sort by

M21-37

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

Moderators: chetan2u, Bunuel



Copyright

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

Powered by phpBB © phpBB Group | Emoji artwork provided by EmojiOne

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