[phpBB Debug] PHP Notice: in file /includes/viewtopic_mods/timer.php on line 168: array_key_exists() expects parameter 2 to be array, null given [phpBB Debug] PHP Notice: in file /includes/viewtopic_mods/timer.php on line 169: array_key_exists() expects parameter 2 to be array, null given [phpBB Debug] PHP Notice: in file /includes/viewtopic_mods/timer.php on line 170: array_key_exists() expects parameter 2 to be array, null given
M09 Q16 : Retired Discussions [Locked]

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:

Important thing to not here is the hidden constraint positive numbers, if it was not the case then both statements would have been required.

Using hidden constraint X is positive we know that 10^x will be at least 10 , further remainder on division by 3, will always be 1.

Applying divisibility rule for 3 + remainder sum , we know that numerator will be divisible by 3 if sum of remainders is multiple of 3, since we know the remainder of 10^x (ie. 1) , we shall focus on the remainder of y when divided by 3.

Now we have enough information to crack the question , lets go to the statements

A. X >5 , since x is positive therefore it doesn't add any new information. we already know the remainder on division <however we shall stay alert if x wasn't given to be positive , then this statement would have provided valuable information to solve the question>.

B. Y =2 , remainder on division by 3 = 2. By remainder some theory , Combined remainder of 10^x+y = 1+2=3 Since the remainder sum is multiple of 3 , 10^X +Y is divisible by 3

Ans B sufficient alone _________________

Sun Tzu-Victorious warriors win first and then go to war, while defeated warriors go to war first and then seek to win.

If it's in the power of X then both can give the answer alone as 10, 100, 1000, 10000 or whatever + 2 gives an integer.

For S1, Y is unknown, so it could be 10^6 + 2, which is divisible or 10^6 +3, which is not. Because there is no Y value for S1, it is not sufficient. _________________

soln: ------ S1 is not sufficient. Whatever is, we can vary to make either divisible or not divisible by 3.

S2 is sufficient. The key thing to notice is that if S2 holds, then the sum of digits of is divisible by 3, as is the expression itself.

The correct answer is B.

--- how is it B ? From q stem (10X + Y)/3 ==> (10X+2)/3 ==> can be 12/3, 22/3,32/3..... taking values for X as 1,2,3....

am I missing anything ??

The Q can be easily understood by splitting the numerator into two parts.

Part-1: (10^X)/3 Irrespective of the value of X (since its given that both X & Y are +ve integers we can neglect the negative values), the fraction will always yield a remainder of 1.

Part-2: (Y/3) Based on the different values of Y, we can arrive at different values for the Remainder. If S2 is taken into consideration, i.e. Y=2, the above fraction will yield a remainder of 2.

By adding the remainders from Part-1 and Part-2, we get a remainder of 3 which in other words means that there is no remainder. So the entire statement is divisible by 3 and will yield an integer as the answer.

The answer would be Statement 2 alone is sufficient to answer the Q.

I am not getting it. Whats the official answer then? B?

B, exactly: Y=2 is sufficient.

to determine if (10^x+y)/3 is an integer, one just has to add all the digits of the numerator. if the numerator is a multiple of 3, then it can be divided by 3 with no remainder.

since 10^x is 10, 100, 1000, ... 10000000.... like this, 1 (on the left) adding y (y=2) equals 3 (1+2=3), (10^x+y)/3 is an integer.

Hi guys, I have a different approach, using rule of divisibility: Question is: {(10^X)+y}/3 an integer.

For this expression to be an integer {(10^X)+y} needs to be divisible by 3 i.e sum of all digits of the expression should be divisible by 3.

X>5 => {(10^X)+y} = 1000000+y or = 10000000+Y and so on ...... the sum depends on value of y. If it is 2 , 5 or 8 then the expression {(10^X)+y} is divisible by 3 and the given expression is an integer but if it is not any of those three digits then the expression is not integer. Hence A is not sufficient.

y= 2 - sufficient, since whatever the value of x is the total of all the digits of 10^X is 1, and (10^X)+y will therefore always have digits whose sum is 3. Hence {(10^X)+y} is always divisible by 3 and {(10^X)+y}/3 will always give an integer value.

Statement 1: with out the value of Y, it is not possible to say whether the resultant is an integer or not Statemnt 2: given the Y value, the resultant is an integer for any value of X

yes it is perfectly B.Divisibility by three is independent of x.and it will have its sum of digits as 1 and if y=2SUM OF DIGITS IS 3.hence completely divisible. _________________

Kingfisher The king of good times and a companion in bad ones......