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:

In expression \(10^X + Y\) , the sum of digits of \(10^X\) is always 1 and it is the value of Y that determines the remainder of \(\frac{10^X + Y}{3}\) . We can make sure that S1 is not sufficient by plugging \(m = 2\) , \(n = 1\) (the answer is YES) and \(m = 3\) , \(n = 2\) (the answer is NO).

If the remainder of \(\frac{n}{3}\) is 2, as S2 states, then \(n\) is 2, 5, or 8 and the sum of digits of \(\frac{10^m + n}{3}\) is divisible by 3. Therefore, the remainder of \(\frac{10^m + n}{3}\) is 0, which cannot be bigger that the remainder of \(\frac{10^n + m}{3}\) no matter what \(m\) is. The correct answer is B.

When we evaluate S2, isn't there a possibility that m = n in which case the remainders will be equal? Also, if we take S1+S2, there is a possibility that m/3 has a remainder of 2 as well. IMO the correct answer should be E. Any thoughts?

I understand how statement 2 can be rewritten as 3n+2, leaving R=0. But you know nothing about M, so how can you assume that B is the correct answer?

\(m\) and \(n\) are positive integers. Is the remainder of \(\frac{10^m + n}{3}\) bigger than the remainder of \(\frac{10^n + m}{3}\) ?

First of all any positive integer can yield only three remainders upon division by 3: 0, 1, or 2.

Since, the sum of the digits of \(10^m\) and \(10^n\) is always 1 then the remainders of \(\frac{10^m + n}{3}\) and \(\frac{10^n + m}{3}\) are only dependant on the value of the number added to \(10^m\) and \(10^n\). There are 3 cases: If the number added to them is: 0, 3, 6, 9, ... then the remainder will be 1 (as the sum of the digits of \(10^m\) and \(10^n\) will be 1 more than a multiple of 3); If the number added to them is: 1, 4, 7, 10, ... then the remainder will be 2 (as the sum of the digits of \(10^m\) and \(10^n\) will be 2 more than a multiple of 3); If the number added to them is: 2, 5, 8, 11, ... then the remainder will be 0 (as the sum of the digits of \(10^m\) and \(10^n\) will be a multiple of 3).

(1) \(m \gt n\). Not sufficient.

(2) The remainder of \(\frac{n}{3}\) is \(2\) --> \(n\) is: 2, 5, 8, 11, ... so we have the third case. Which means that the remainder of \(\frac{10^m + n}{3}\) is 0. Now, the question asks whether the remainder of \(\frac{10^m + n}{3}\), which is 0, greater than the reminder of \(\frac{10^n + m}{3}\), which is 0, 1, or 2. Obviously it cannot be greater, it can be less than or equal to. So, the answer to the question is NO. Sufficient.

you have to read the question really hard, with b the remainder of (10^m + N)/3 has to be zero, meaning m/3's remainder can only be equal or more than, therefore, (10^m + N)/3 's remainder cannot be bigger than (10^n + M)/3, only equal. So the answer to the question is no, regardless of if they are equal or not. Very tricky question, answer definitely helped

\(\frac{10^m}{3} and \frac{10^n}{3}\) will always have the same remainder. and if 2 fractions are added then there remainders can also be added as long as excess remainder is adjusted.

So now \(\frac{m}{3} and \frac{n}{3}\) will actually decide which remainder is bigger.

S1. M > N doesn't help coz if M = 3 and N 2 then remainder is 1 and if M = 6 and N = 2 or 3 then remainder is 0. S2. The remainder of N/3 is 2 ===> since the remainder of any integer divided by N can be any value between 0 to N-1 but can never be equal to or greater than N. Hence for any value of M, M/3 will never have remainder greater than 2. Hence Sufficient since remainder of \(\frac {10^N + M}{3}\) will consist of X + 0 or 1 or 2 and \(\frac {10^M + N}{3}\) consists of X + 2. So 1^st expression can never have remainder greater than the 2^nd expression.

It's clear, that 1st stmt is insufficient. The second stmt means, that n = 3k +2, where k is natural. 10^m = 99...9 +1 (the number of 9's is m). So 10^m + n = 99...9 + 1 + 3k + 2 = 3( 33...3 + k + 1) is divisible by 3 and the ramainder is 0 which cannot bigger than 0, 1 or 2 - the posiible remaiders by division by 3. B

1. m > n doesn't give any sufficient information, to prove this you can assume values.

2. n/3 has remainder 2, that means \(\frac{(10^m +n)}{3}\) will always have remainder as 0. Thus this must be smaller than the other value given, as 0 can be the smallest remainder. _________________

\(m\) and \(n\) are positive integers. Is the remainder of \(\frac{10^m + n}{3}\) bigger than the remainder of \(\frac{10^n + m}{3}\) ?

1. \(m \gt n\) 2. The remainder of \(\frac{n}{3}\) is \(2\)

(C) 2008 GMAT Club - m17#8

In expression \(10^X + Y\) , the sum of digits of \(10^X\) is always 1 and it is the value of Y that determines the remainder of \(\frac{10^X + Y}{3}\) . We can make sure that S1 is not sufficient by plugging \(m = 2\) , \(n = 1\) (the answer is YES) and \(m = 3\) , \(n = 2\) (the answer is NO).

If the remainder of \(\frac{n}{3}\) is 2, as S2 states, then \(n\) is 2, 5, or 8 and the sum of digits of \(\frac{10^m + n}{3}\) is divisible by 3. Therefore, the remainder of \(\frac{10^m + n}{3}\) is 0, which cannot be bigger that the remainder of \(\frac{10^n + m}{3}\) no matter what \(m\) is. The correct answer is B.

When we evaluate S2, isn't there a possibility that m = n in which case the remainders will be equal? Also, if we take S1+S2, there is a possibility that m/3 has a remainder of 2 as well. IMO the correct answer should be E. Any thoughts?

B. Since (10^m)/3 has always 1 reminder and n/3 has 2 reminder. So \(\frac{10^m + n}{3}\) has 0 reminder. Therefore, the reminder of \(\frac{10^m + n}{3}\) cannot be greater than the reminder of \(\frac{10^n + m}{3}\). _________________

I think ans is C, B doesn't eliminate the scenario when m=n; its not mentioned in question if they are distinct number so we need A m>n so I think ans should be C

I can assure one thing, we might not learn any new concept by these questions but will certainly learn a lot from our mistakes.

beauty of these type of questions is, they just asked about the equality/inequality i.e. whether 1st is greater than 2nd or not.

Now consider a case when m/3 also gives remainder 2, most of us will feel since remainder is 0, both are equal thus we cannot solve this question as we have two cases.

even if 2nd gives remainder as 0, the answer to the question remains NO....

Golden Rule : We take so much time in solving the question , always spare 5 seconds to verify what exactly has been asked in DS question- whether it is yes/no question or value question. _________________

(10 ^m + n)/3 , (10^n +m)/3 I'll be using modular arithmetic notation: 10 = 1 mod(3) 100 = 1 (mod3) 1000 = 1 (mod3) hence 10 ^m,n = 1 (mod3) problem boils down to n/3 and m/3 remainder can be 0,1,or 2. n=2 (mod3) + the Rem 1 from 1st term implies total rem=3 or 0. B Lets see if 1 is sufficient. according to 1: m = R1 mod(3) n = R2 mod(3) m > n doesnt help. Ex: 7, 5 remainders (1,2) ; 8,4 remainders (2,1) Hence B.

I think ans is C, B doesn't eliminate the scenario when m=n; its not mentioned in question if they are distinct number so we need A m>n so I think ans should be C

what do you think?

it is B....i also thought it is C but if you read carefully you ll realise it is not asking "which one is bigger?"....

the question is can it be bigger? the answer using B is NO because even if m=n then none is bigger than the other

\(m\) and \(n\) are positive integers. Is the remainder of \(\frac{10^m + n}{3}\) bigger than the remainder of \(\frac{10^n + m}{3}\) ?

1. \(m \gt n\) 2. The remainder of \(\frac{n}{3}\) is \(2\)

(C) 2008 GMAT Club - m17#8

In expression \(10^X + Y\) , the sum of digits of \(10^X\) is always 1 and it is the value of Y that determines the remainder of \(\frac{10^X + Y}{3}\) . We can make sure that S1 is not sufficient by plugging \(m = 2\) , \(n = 1\) (the answer is YES) and \(m = 3\) , \(n = 2\) (the answer is NO).

If the remainder of \(\frac{n}{3}\) is 2, as S2 states, then \(n\) is 2, 5, or 8 and the sum of digits of \(\frac{10^m + n}{3}\) is divisible by 3. Therefore, the remainder of \(\frac{10^m + n}{3}\) is 0, which cannot be bigger that the remainder of \(\frac{10^n + m}{3}\) no matter what \(m\) is. The correct answer is B.

When we evaluate S2, isn't there a possibility that m = n in which case the remainders will be equal? Also, if we take S1+S2, there is a possibility that m/3 has a remainder of 2 as well. IMO the correct answer should be E. Any thoughts?

B. Since (10^m)/3 has always 1 reminder and n/3 has 2 reminder. So \(\frac{10^m + n}{3}\) has 0 reminder. Therefore, the reminder of \(\frac{10^m + n}{3}\) cannot be greater than the reminder of \(\frac{10^n + m}{3}\).

I agree that m can equal n. Therefore the answer must be C as prompt one makes equivalency impossible.

I hope GMAC does not hire the person who made this question. . Else we are doomed.

Just kidding. Beautiful question again.

could not solve this in timed mode, however came up with an elegant solution after having a look at it for 5 min in review.

statement B can be simplified as 3n+2 for any value of N. thus the values at n={1,2,3} are {5,8,11} and so on. Hence the remainder of the 1st expression is always 0. hence the answer. _________________

Cheers !!

Quant 47-Striving for 50 Verbal 34-Striving for 40

This is a very nice debatable question. i think answer is B, however my answer in the test was E . In my view question is asking if remainder of 1st expression is greater than remainder of 2nd expression.

So as per 2nd equation, if you choose value of n = 5, 8, 11... and m = 1, 2, 3, 4, 6,... (m <> n) remainder of 1st expression is less than remainder of 2nd expression.

But if you consider m = n, remainders of both expressions are equal i.e. = 0. in any case remainder of expression 1 is not greater than remainder of expression 2.

appreciate if someone validate if this understanding is correct?