On further simplifying the question, we get is (1+n)/3 > (1+m)/3. Cant we further simplify the question stem to Is n > m using following 2 steps - (a) multiply both sides by 3, and (b) subtracting 1 from both sides? Accordingly, statement 1 also becomes sufficient since it answers in sufficiently no.
zisis
If \(m\) and \(n\) are positive integers, is the remainder of \(\frac{10^m + n}{3}\) larger than the remainder of \(\frac{10^n + m}{3}\) ?
1. \(m \gt n\)
2. The remainder of \(\frac{n}{3}\) is \(2\)
You can also use binomial theorem here. Again, let me reiterate that there are many concepts which are not essential for GMAT but knowing them helps you get to the answer quickly.
The moment I see \(\frac{10^m + n}{3}\) here, my mind sees \(\frac{(9+1)^m + n}{3}\)
So I say that \(\frac{10^m}{3}\) and \(\frac{10^n}{3}\) give remainder 1 in any case (m and n are positive integers). I just need to worry about n/3 and m/3.
1. \(m \gt n\)
Doesn't tell me about the remainder when m and n are divided by 3.
2. The remainder of \(\frac{n}{3}\) is \(2\)
If n/2 gives a remainder of 2, total remainder of \(\frac{10^m + n}{3}\) is 1+2 = 3 which is equal to 0. So no matter what the remainder of \(\frac{m}{3}\), the remainder of \(\frac{10^n + m}{3}\) will never be less than 0. Hence sufficient.
Answer B