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

It is currently 15 Dec 2018, 05:55

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 December
PrevNext
SuMoTuWeThFrSa
2526272829301
2345678
9101112131415
16171819202122
23242526272829
303112345
Open Detailed Calendar
  • Free GMAT Strategy Webinar

     December 15, 2018

     December 15, 2018

     07:00 AM PST

     09:00 AM PST

    Aiming to score 760+? Attend this FREE session to learn how to Define your GMAT Strategy, Create your Study Plan and Master the Core Skills to excel on the GMAT.
  • $450 Tuition Credit & Official CAT Packs FREE

     December 15, 2018

     December 15, 2018

     10:00 PM PST

     11:00 PM PST

    Get the complete Official GMAT Exam Pack collection worth $100 with the 3 Month Pack ($299)

If x, y and k are integers, is xy divisible by 3? (1) y =

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

Hide Tags

Senior Manager
Senior Manager
avatar
Status: Do and Die!!
Joined: 15 Sep 2010
Posts: 268
If x, y and k are integers, is xy divisible by 3? (1) y =  [#permalink]

Show Tags

New post Updated on: 24 Oct 2010, 11:54
1
7
00:00
A
B
C
D
E

Difficulty:

  95% (hard)

Question Stats:

32% (01:59) correct 68% (02:06) wrong based on 160 sessions

HideShow timer Statistics

If x, y and k are integers, is xy divisible by 3?

(1) y = 2^(16) - 1

(2) The sum of the digits of x equals 6^k

_________________

I'm the Dumbest of All !!


Originally posted by shrive555 on 24 Oct 2010, 11:34.
Last edited by shrive555 on 24 Oct 2010, 11:54, edited 1 time in total.
Manager
Manager
User avatar
Joined: 08 Sep 2010
Posts: 173
Location: India
WE 1: 6 Year, Telecom(GSM)
Re: integers divisibility  [#permalink]

Show Tags

New post 24 Oct 2010, 11:45
shrive555 wrote:
If x, y and k are integers, is xy divisible by 3?

(1) y = 216 - 1

(2) The sum of the digits of x equals 6k


(1) says y=215 Now xy=215*x So it depends on x whether is divisible or not ...> Insufficient
(2) says x is divisible by 3( condition of divisibility by 3 is the sum of the digits shud be divided by 3 and here it is 6k.)

Hence answer shud be B.

Consider KUDOS if its helpful.
Math Expert
User avatar
V
Joined: 02 Sep 2009
Posts: 51218
If x, y and k are integers, is xy divisible by 3? (1) y =  [#permalink]

Show Tags

New post 24 Oct 2010, 11:47
2
2
shrive555 wrote:
If x, y and k are integers, is xy divisible by 3?

(1) y = 216 - 1

(2) The sum of the digits of x equals 6k


shrive555 please check the questions when posting. The correct question is as follows:

If x, y and k are integers, is xy divisible by 3?

Now, \(xy\) will be divisible by 3 if either unknown is divisible by 3.

(1) y = 2^16 - 1 --> \(y =2^{16}-1=(2^8-1)(2^8+1)=(2^4-1)(2^4+1)(2^8+1)=15(2^4+1)(2^8+1)\), so \(y\) is a multiple of 3. Sufficient.

(2) The sum of the digits of x equals 6^k --> if \(k\geq{1}\) then \(x\) is divisible by 3 (as the sum of the digits of \(x\) will be multiple of 3) and the answer to the question will be YES but if \(k=0\) then \(x\) could be 1 and we won't be sure whether \(x\) is a multiple of 3. Not sufficient.

Answer: A.
_________________

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

Senior Manager
Senior Manager
avatar
Status: Do and Die!!
Joined: 15 Sep 2010
Posts: 268
Re: integers divisibility  [#permalink]

Show Tags

New post 24 Oct 2010, 11:53
sorry Bunel: i will take care of that
_________________

I'm the Dumbest of All !!

Manager
Manager
avatar
Joined: 06 Apr 2010
Posts: 70
GMAT ToolKit User
Re: integers divisibility  [#permalink]

Show Tags

New post 19 Apr 2011, 22:36
Bunuel wrote:
shrive555 wrote:
If x, y and k are integers, is xy divisible by 3?
(2) The sum of the digits of x equals 6^k --> if \(k\geq{1}\) then \(x\) is divisible by 3 (as the sum of the digits of \(x\) will be multiple of 3) and the answer to the question will be YES but if \(k=0\) then \(x\) could be 1 and we won't be sure whether \(x\) is a multiple of 3. Not sufficient.

Answer: A.


I need help understanding the red part.
I thought that if k=0, then the sum of digits of x will be zero (since the sum is a function of k), which implies that x is 0.
Maybe I am not reading the prompt correctly.
Thanks
Retired Moderator
avatar
B
Joined: 16 Nov 2010
Posts: 1425
Location: United States (IN)
Concentration: Strategy, Technology
Premium Member Reviews Badge
Re: integers divisibility  [#permalink]

Show Tags

New post 20 Apr 2011, 01:06
@Eden, any real number raised to 0 will be = 1, and 1 is not a multiple of 3.
_________________

Formula of Life -> Achievement/Potential = k * Happiness (where k is a constant)

GMAT Club Premium Membership - big benefits and savings

Manager
Manager
avatar
Joined: 09 Feb 2011
Posts: 229
Concentration: General Management, Social Entrepreneurship
Schools: HBS '14 (A)
GMAT 1: 770 Q50 V47
Re: integers divisibility  [#permalink]

Show Tags

New post 20 Apr 2011, 01:38
1
1. We can observe a pattern.
2^1 - 1 = 1 Not divisible
2^2 - 1 =3 Divisible
2^3 - 1 = 7 Not Divisible
2^4 - 1 =15 Divisible
2^6 - 1 = 63

2 rasied to even power minus one is always divisible by 3. Hence y= 2^16-1 is divisible. If y is divisible by 3, so is xy. Hence sufficient

2. If sum of digits of x is equal to 6^k, where k is an integer, k can be 0 or a positive integer. (cant be negative as that will lead to a fractional value for 6^k which cant be possible as the sum of the digits) now if k is a positive integer- 6^k is always going to be divisible by 3, and since sum of digits is divisible by 3, so will be x, and hence so will be xy. But what if k is 0? Then 6^0 becomes 1, and all info (2) gives us is that sum of digits of x is divisible by 1 - so what ? all numbers are divisible by 1. this cant give enough information to determine whether xy is divisible by 3 or not. hence insufficient.
Director
Director
avatar
Joined: 01 Feb 2011
Posts: 659
Re: integers divisibility  [#permalink]

Show Tags

New post 20 Apr 2011, 15:06
Eden,

when k>=1, statement 2 is true and divisible by 3.
but when k=0 ,the sum of the digits equals to 6^0 = 1 ( not zero) , which is not divisible by 3. Thats why option 2 is not sufficient as we dont know whether k >=1 or k =0 or k<0.

Eden wrote:
Bunuel wrote:
shrive555 wrote:
If x, y and k are integers, is xy divisible by 3?
(2) The sum of the digits of x equals 6^k --> if \(k\geq{1}\) then \(x\) is divisible by 3 (as the sum of the digits of \(x\) will be multiple of 3) and the answer to the question will be YES but if \(k=0\) then \(x\) could be 1 and we won't be sure whether \(x\) is a multiple of 3. Not sufficient.

Answer: A.


I need help understanding the red part.
I thought that if k=0, then the sum of digits of x will be zero (since the sum is a function of k), which implies that x is 0.
Maybe I am not reading the prompt correctly.
Thanks
Non-Human User
User avatar
Joined: 09 Sep 2013
Posts: 9163
Premium Member
Re: If x, y and k are integers, is xy divisible by 3? (1) y =  [#permalink]

Show Tags

New post 14 Aug 2018, 02:13
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

GMAT Club Bot
Re: If x, y and k are integers, is xy divisible by 3? (1) y = &nbs [#permalink] 14 Aug 2018, 02:13
Display posts from previous: Sort by

If x, y and k are integers, is xy divisible by 3? (1) y =

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


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