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.

It appears that you are browsing the GMAT Club forum unregistered!

Signing up is free, quick, and confidential.
Join other 350,000 members and get the full benefits of GMAT Club

Registration gives you:

Tests

Take 11 tests and quizzes from GMAT Club and leading GMAT prep companies such as Manhattan GMAT,
Knewton, and others. All are free for GMAT Club members.

Applicant Stats

View detailed applicant stats such as GPA, GMAT score, work experience, location, application
status, and more

Books/Downloads

Download thousands of study notes,
question collections, GMAT Club’s
Grammar and Math books.
All are free!

Thank you for using the timer!
We noticed you are actually not timing your practice. Click the START button first next time you use the timer.
There are many benefits to timing your practice, including:

Re: If x, y and k are integers, is xy divisible by 3? [#permalink]
20 Sep 2009, 18:55

00:00

A

B

C

D

E

Difficulty:

(N/A)

Question Stats:

0% (00:00) correct
0% (00:00) wrong based on 0 sessions

I believe the correct answer is D.

Basically, in order for xy to be divisible by 3, x or y HAVE TO be divisible by 3 on their own, since 3 is a prime number.

Statement 1: y = 2^(16) - 1: The key here is knowing that 2^(odd integer) = 3n + 2, and 2^(even integer) = 3n + 1 (where n is a non-negative integer). Since 16 is an even integer, 2^16 will be equal to 3n + 1. Therefore 2^16 - 1 = 3n + 1 - 1 = 3n. Therefore y is divisible by 3, and Statement 1 is sufficient.

The reason that this rule works for 2^n when considering divisibility by 3 is as follows (sorry if this is confusing): if you take a number in the form of 3n + 1, and multiply it by 2, you get 6n + 2, which can be rewritten in the form 2*3n + 2 = 3m + 2. Multiplied again by 2, you get 6m + 4, which can be rewritten in the form 6(m+1) + 1 = 3p + 1. The number 2 (being 2^1) is in the form 3n + 2. Subsequently all numbers in the form 2^(odd number) can be written as 3n + 2, and all numbers in the form 2^(even number) can be written as 3n + 1. I remember learning this somewhere years ago, there might be a better explanation out there on the internet.

Statement 2: The sum of the digits of x equals 6^k : For x to be divisible by 3, the sum of its digits must also be divisible by 3. It is given that the sum of the digits of x equals 6^k.

\(6^k = 3^k*2^k\) and therefore x is definitely divisible by 3. Therefore Statement 2 is also sufficient.

Since both Statement 1 and 2 are both sufficient by themselves, the correct answer is D.

Type of Visa: You will be applying for a Non-Immigrant F-1 (Student) US Visa. Applying for a Visa: Create an account on: https://cgifederal.secure.force.com/?language=Englishcountry=India Complete...

I started running back in 2005. I finally conquered what seemed impossible. Not sure when I would be able to do full marathon, but this will do for now...