Last visit was: 19 Nov 2025, 11:05 It is currently 19 Nov 2025, 11:05
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
User avatar
zisis
Joined: 16 Feb 2010
Last visit: 01 Jul 2012
Posts: 122
Own Kudos:
1,724
 [227]
Given Kudos: 16
Posts: 122
Kudos: 1,724
 [227]
15
Kudos
Add Kudos
211
Bookmarks
Bookmark this Post
Most Helpful Reply
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,390
Own Kudos:
Given Kudos: 99,977
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,390
Kudos: 778,310
 [51]
29
Kudos
Add Kudos
22
Bookmarks
Bookmark this Post
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 19 Nov 2025
Posts: 16,267
Own Kudos:
76,997
 [6]
Given Kudos: 482
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,267
Kudos: 76,997
 [6]
6
Kudos
Add Kudos
Bookmarks
Bookmark this Post
General Discussion
User avatar
jpr200012
Joined: 30 May 2010
Last visit: 10 Oct 2011
Posts: 137
Own Kudos:
835
 [22]
Given Kudos: 32
Posts: 137
Kudos: 835
 [22]
18
Kudos
Add Kudos
4
Bookmarks
Bookmark this Post
To determine if a number is divisible by 3, add the digits and if they are divisible by 3, then the entire number is also.

We are given m and n are positive integers. The sum of the digits of 10 to any positive power will always be 1.

From statement 2, we are told the remainder of \(n/3\) will be 2.

For \((10^m + n)/3\), the \(10^m\) part will always give you 1 in the sum of the digits, and the n part will always give you 2 in the digits of the numerator. Therefore, this will always be divisible by 3 (have a remainder of 0).

The question asked if (10^m + n)/3 will ever have a larger remainder than \((10^n + m)/3\). Remainders can't be negative, therefore we know it will never be larger. There is no need to evaluate possible remainders of \((10^n + m)/3\).
User avatar
catty2004
Joined: 30 May 2008
Last visit: 01 Nov 2016
Posts: 35
Own Kudos:
Given Kudos: 26
Posts: 35
Kudos: 966
Kudos
Add Kudos
Bookmarks
Bookmark this Post
crystal clear! Just hope that my brain will remember this on the test day!
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 19 Nov 2025
Posts: 16,267
Own Kudos:
76,997
 [74]
Given Kudos: 482
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,267
Kudos: 76,997
 [74]
53
Kudos
Add Kudos
21
Bookmarks
Bookmark this Post
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
avatar
raingary
Joined: 22 Jan 2012
Last visit: 07 Oct 2012
Posts: 25
Own Kudos:
83
 [2]
Posts: 25
Kudos: 83
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
I have a doubt why B is sufficient to answer the question.
I understood the solution but if we take only the statement B then there is nothing to prove that m is not equal to n.
As in the given statement m and n are positive integers but what is the relation between them is not provided whether m >n , m<n or m=n .

Also ,by B we are only able to prove that remainder will not be lesser but what if equal or greater.
avatar
nomis
Joined: 11 May 2011
Last visit: 01 Aug 2015
Posts: 6
Own Kudos:
Given Kudos: 1
Location: United States (NY)
Concentration: Real Estate, Finance
GMAT 1: 720 Q48 V40
GMAT 1: 720 Q48 V40
Posts: 6
Kudos: 7
Kudos
Add Kudos
Bookmarks
Bookmark this Post
to rephrase the question is x greater than y ( here x and y are the remainders).
If x is greater than y, answer is yes but if x is not greater than y the answer is no.

If x is 0 and y is 0 ----No
If x is 1 or 2 and y is 0 , the Yes

Why is the answer not E?

If the question is reversed -- is the remainder of 10^n +m/3 larger than the remainder of 10^m+n/3 ? then the answer would be B as
0 can never be greater than 0, 1 or 2.
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 19 Nov 2025
Posts: 16,267
Own Kudos:
Given Kudos: 482
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,267
Kudos: 76,997
Kudos
Add Kudos
Bookmarks
Bookmark this Post
nomis
to rephrase the question is x greater than y ( here x and y are the remainders).
If x is greater than y, answer is yes but if x is not greater than y the answer is no.

If x is 0 and y is 0 ----No
If x is 1 or 2 and y is 0 , the Yes

Why is the answer not E?

If the question is reversed -- is the remainder of 10^n +m/3 larger than the remainder of 10^m+n/3 ? then the answer would be B as
0 can never be greater than 0, 1 or 2.

Because you find that a = 0 (the remainder of the first expression is 0). Hence under no condition can 'a' be greater than 'b'. Hence, it is sufficient to answer with an emphatic 'No'.
User avatar
newyork2012
Joined: 22 Sep 2014
Last visit: 23 Apr 2023
Posts: 122
Own Kudos:
Given Kudos: 51
Location: United States (CA)
Posts: 122
Kudos: 51
Kudos
Add Kudos
Bookmarks
Bookmark this Post
i don;t understand ....the answer is a NO ....why is the correct answer is B ? not E?
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,390
Own Kudos:
778,310
 [2]
Given Kudos: 99,977
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,390
Kudos: 778,310
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
newyork2012
i don;t understand ....the answer is a NO ....why is the correct answer is B ? not E?

There are two types of data sufficiency questions:

1. YES/NO DS Questions:

In a Yes/No Data Sufficiency questions, statement(s) is sufficient if the answer is “always yes” or “always no” while a statement(s) is insufficient if the answer is "sometimes yes" and "sometimes no".


2. VALUE DS QUESTIONS:

When a DS question asks about the value of some variable, then the statement(s) is sufficient ONLY if you can get the single numerical value of this variable.

This question is a VALUE question, so a statement to be sufficient it should give the single numerical value of the units digit. As you said, from (1) it could be 1 or 6, so (1) is not sufficient.

Hope it's clear.
User avatar
AlwaysImproving
Joined: 20 Nov 2020
Last visit: 03 Mar 2024
Posts: 62
Own Kudos:
Given Kudos: 228
Location: India
Concentration: Finance, Entrepreneurship
GMAT 1: 770 Q50 V44 (Online)
GPA: 3.13
Products:
GMAT 1: 770 Q50 V44 (Online)
Posts: 62
Kudos: 13
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Hi VeritasKarishma,

The question didn't specify whether m=n. What if m=n? Doesn't the statement 1 hold relevance in such event?

Thanks.
User avatar
KarishmaB
Joined: 16 Oct 2010
Last visit: 19 Nov 2025
Posts: 16,267
Own Kudos:
76,997
 [2]
Given Kudos: 482
Location: Pune, India
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 16,267
Kudos: 76,997
 [2]
2
Kudos
Add Kudos
Bookmarks
Bookmark this Post
NareshGargMBA
Hi VeritasKarishma,

The question didn't specify whether m=n. What if m=n? Doesn't the statement 1 hold relevance in such event?

Thanks.

Question:
Is remainder of x larger than the remainder of y?

We can answer this in two ways:
1. Yes. Remainder of x is larger than remainder of y.
2. No. Remainder of x is same as remainder of y. Or remainder of x is less than remainder of y.
If the remainders are equal or remainder of x is smaller, we will answer it with an emphatic "No" only. In both cases answer is "No". Hence it doesn't matter.
If remainder of x is 0, then it cannot be GREATER than remainder of y in any case. It may be equal or small. Hence, answer will remain "No".

So statement I is not needed.
User avatar
road2gmat
Joined: 05 Aug 2024
Last visit: 13 Jul 2025
Posts: 3
Given Kudos: 56
Posts: 3
Kudos: 0
Kudos
Add Kudos
Bookmarks
Bookmark this Post
I just came across this question, but I am having a hard time understanding the explanation. Why do we assume that "the sum of the digits of 10^m and 10^n is always equal to 1"? Is this a general rule or is it implied from the problem in any way?

Thank you in advance!­
User avatar
Bunuel
User avatar
Math Expert
Joined: 02 Sep 2009
Last visit: 19 Nov 2025
Posts: 105,390
Own Kudos:
778,310
 [1]
Given Kudos: 99,977
Products:
Expert
Expert reply
Active GMAT Club Expert! Tag them with @ followed by their username for a faster response.
Posts: 105,390
Kudos: 778,310
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
road2gmat
I just came across this question, but I am having a hard time understanding the explanation. Why do we assume that "the sum of the digits of 10^m and 10^n is always equal to 1"? Is this a general rule or is it implied from the problem in any way?

Thank you in advance!­
­10^m, where m is a positive integer, is a 1 followed by m zeros. Therefore, the sum of the digits of 10^m is always 1. For example, 10^1 = 10, 10^2 = 100, 10^3 = 1,000, and so on. The sum of the digits in each case is 1.
avatar
ManifestDreamMBA
Joined: 17 Sep 2024
Last visit: 19 Nov 2025
Posts: 1,284
Own Kudos:
785
 [1]
Given Kudos: 236
Products:
Posts: 1,284
Kudos: 785
 [1]
1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
Edit: I have answer to the question I posted before, in case someone else also had the same question.

The trick to the question is to remember it's about the remainder. After we get this: is (1+n)/3 > (1+m)/3, we need to consider n/3 and m/3 values. here's why.

Say n = 2 and m = 1, the respective remainders become 0 and 1, which makes R(1+n)/3 < R(1+m)/3.
However if n = 1 and m = 0, then the remainders become 2 and 1, which makes R(1+n)/3 > R(1+m)/3

Hope this helps!

Initial Q
I have a doubt. Wouldn't first express be a remainder of n+1 using binomial? Say (9+1)^m gives a remainder 1 and n is getting added, so the remainder is 1+n. Similarly the next expression gives a remainder of 1+m. Therefore if I know m>n, I know the remainder of second expression is greater than the first? I am trying to understand the gap in this approach.
KarishmaB
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
User avatar
ArpitaG
Joined: 24 Mar 2024
Last visit: 30 Aug 2025
Posts: 3
Own Kudos:
Given Kudos: 3
Location: India
Posts: 3
Kudos: 1
Kudos
Add Kudos
Bookmarks
Bookmark this Post
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.

KarishmaB
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
avatar
ManifestDreamMBA
Joined: 17 Sep 2024
Last visit: 19 Nov 2025
Posts: 1,284
Own Kudos:
Given Kudos: 236
Products:
Posts: 1,284
Kudos: 785
Kudos
Add Kudos
Bookmarks
Bookmark this Post
The trick to the question is to remember it's about the remainder. After we get this: is (1+n)/3 > (1+m)/3, we need to consider n/3 and m/3 values. here's why.

Say n = 2 and m = 1, the respective remainders become 0 and 1, which makes R(1+n)/3 < R(1+m)/3.
However if n = 1 and m = 0, then the remainders become 2 and 1, which makes R(1+n)/3 > R(1+m)/3

Hope this helps!

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

KarishmaB
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
Moderators:
Math Expert
105390 posts
496 posts