DS: Remainder problem

This topic has expert replies
User avatar
Master | Next Rank: 500 Posts
Posts: 145
Joined: Tue Jan 31, 2012 6:50 am
Location: New Delhi
Thanked: 16 times
Followed by:2 members
GMAT Score:760

DS: Remainder problem

by nisagl750 » Sun Sep 02, 2012 10:34 pm
OA - B
Attachments
remainder.jpg
remainder problem

User avatar
Master | Next Rank: 500 Posts
Posts: 145
Joined: Tue Jan 31, 2012 6:50 am
Location: New Delhi
Thanked: 16 times
Followed by:2 members
GMAT Score:760

by nisagl750 » Sun Sep 02, 2012 10:35 pm
I didn't understand how statement 2 can help us?
Can anybody please explain?

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 3835
Joined: Fri Apr 02, 2010 10:00 pm
Location: Milpitas, CA
Thanked: 1854 times
Followed by:523 members
GMAT Score:770

by Anurag@Gurome » Mon Sep 03, 2012 12:46 am
The remainder of n/3 is 2 -> n = (3 * k1) + 2, where k1 =0,1,2....
when 10^z is divided by 3, remainder is 1.
10^z = 9 * k2 + 1, where k2 =0,1,2...
so, 10^m + n = (9 * k2 + 1) + 3*k1 + 2 = (9 * k2) + (3 * k1) + 3.
which is divisible by 3. hence, remainder is 0.
for a number is divided by 3. its remainder can be 0, 1, or 2.
But as the remainder of 10^m + n is 0. It will never be greater than remainder of (10^n + 3), which can be 0,1 or 2. it can be at most be equal to remainder of (10^n + 3).
is it larger can be answered by a no.
hence, it is B
Anurag Mairal, Ph.D., MBA
GMAT Expert, Admissions and Career Guidance
Gurome, Inc.
1-800-566-4043 (USA)

Join Our Facebook Groups
GMAT with Gurome
https://www.facebook.com/groups/272466352793633/
Admissions with Gurome
https://www.facebook.com/groups/461459690536574/
Career Advising with Gurome
https://www.facebook.com/groups/360435787349781/

User avatar
GMAT Instructor
Posts: 15539
Joined: Tue May 25, 2010 12:04 pm
Location: New York, NY
Thanked: 13060 times
Followed by:1906 members
GMAT Score:790

by GMATGuruNY » Tue Sep 04, 2012 12:49 am
nisagl750 wrote:I didn't understand how statement 2 can help us?
Can anybody please explain?
If the sum of the digits of integer x is a multiple of 3, then x itself is a multiple of 3.

10^m + N implies the following:
If m=1, then 10^m + N = 10 + N = 1N.
If m=2, then 10^m + N = 100 + N = 10N.
If m=3, then 10^m + N = 1000 + N = 100N.
And so on.

In each case:
The first digit is 1, the units digit is N, and the intervening digits are all 0.
Thus, the sum of the digits = 1+N.

Statement 2: The remainder of N/3 is 2.
In other words, N is 2 more than a multiple of 3:
N = 3k + 2 = 2, 5, 8, 11, 14...
Thus, the sum of the digits of 10^m + N = 1+N = 3, 6, 9, 12, 15...
Since in each case the sum of the digits is a multiple of 3, 10^m + N is a multiple of 3.
Thus, when 10^m + N is divided by 3, the remainder is 0.
Thus, the remainder of (10^m + N)/3 cannot be greater than the remainder of (10^n + m)/3.
SUFFICIENT.

The correct answer is B.
Private tutor exclusively for the GMAT and GRE, with over 20 years of experience.
Followed here and elsewhere by over 1900 test-takers.
I have worked with students based in the US, Australia, Taiwan, China, Tajikistan, Kuwait, Saudi Arabia -- a long list of countries.
My students have been admitted to HBS, CBS, Tuck, Yale, Stern, Fuqua -- a long list of top programs.

As a tutor, I don't simply teach you how I would approach problems.
I unlock the best way for YOU to solve problems.

For more information, please email me (Mitch Hunt) at [email protected].
Student Review #1
Student Review #2
Student Review #3

User avatar
Master | Next Rank: 500 Posts
Posts: 145
Joined: Tue Jan 31, 2012 6:50 am
Location: New Delhi
Thanked: 16 times
Followed by:2 members
GMAT Score:760

by nisagl750 » Tue Sep 04, 2012 4:36 am
Do we need to spend more time in putting different values for m & n to show that statement 1 is not sufficient Or there is some logic to rule out Statement 1?

P.S: Thanks for the explanations

GMAT/MBA Expert

User avatar
GMAT Instructor
Posts: 3835
Joined: Fri Apr 02, 2010 10:00 pm
Location: Milpitas, CA
Thanked: 1854 times
Followed by:523 members
GMAT Score:770

by Anurag@Gurome » Tue Sep 04, 2012 8:19 pm
nisagl750 wrote:Do we need to spend more time in putting different values for m & n to show that statement 1 is not sufficient Or there is some logic to rule out Statement 1?

P.S: Thanks for the explanations
we can have all the values of remainder of m or n when divided by 3, satisfying m > n.
so, it won`t help.
substituting simple values would be easy to rule out.
Anurag Mairal, Ph.D., MBA
GMAT Expert, Admissions and Career Guidance
Gurome, Inc.
1-800-566-4043 (USA)

Join Our Facebook Groups
GMAT with Gurome
https://www.facebook.com/groups/272466352793633/
Admissions with Gurome
https://www.facebook.com/groups/461459690536574/
Career Advising with Gurome
https://www.facebook.com/groups/360435787349781/