REMAINDERS : GMAT Quantitative Section
Check GMAT Club Decision Tracker for the Latest School Decision Releases http://gmatclub.com/AppTrack

 It is currently 19 Jan 2017, 10:23

### 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

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

# Events & Promotions

###### Events & Promotions in June
Open Detailed Calendar

# REMAINDERS

Author Message
TAGS:

### Hide Tags

Math Expert
Joined: 02 Sep 2009
Posts: 36566
Followers: 7079

Kudos [?]: 93183 [37] , given: 10553

### Show Tags

24 Dec 2012, 07:48
37
KUDOS
Expert's post
120
This post was
BOOKMARKED
REMAINDERS

This post is a part of [GMAT MATH BOOK]

created by: Bunuel
edited by: bb, Bunuel

--------------------------------------------------------

Definition

If $$x$$ and $$y$$ are positive integers, there exist unique integers $$q$$ and $$r$$, called the quotient and remainder, respectively, such that $$y =divisor*quotient+remainder= xq + r$$ and $$0\leq{r}<x$$.

For example, when 15 is divided by 6, the quotient is 2 and the remainder is 3 since $$15 = 6*2 + 3$$.

Notice that $$0\leq{r}<x$$ means that remainder is a non-negative integer and always less than divisor.

This formula can also be written as $$\frac{y}{x} = q + \frac{r}{x}$$.

Properties

• When $$y$$ is divided by $$x$$ the remainder is 0 if $$y$$ is a multiple of $$x$$.
For example, 12 divided by 3 yields the remainder of 0 since 12 is a multiple of 3 and $$12=3*4+0$$.

• When a smaller integer is divided by a larger integer, the quotient is 0 and the remainder is the smaller integer.
For example, 7 divided by 11 has the quotient 0 and the remainder 7 since $$7=11*0+7$$

• The possible remainders when positive integer $$y$$ is divided by positive integer $$x$$ can range from 0 to $$x-1$$.
For example, possible remainders when positive integer $$y$$ is divided by 5 can range from 0 (when y is a multiple of 5) to 4 (when y is one less than a multiple of 5).

• If a number is divided by 10, its remainder is the last digit of that number. If it is divided by 100 then the remainder is the last two digits and so on.
For example, 123 divided by 10 has the remainder 3 and 123 divided by 100 has the remainder of 23.

Example #1 (easy)

If the remainder is 7 when positive integer n is divided by 18, what is the remainder when n is divided by 6?
A. 0
B. 1
C. 2
D. 3
E. 4

When positive integer n is dived by 18 the remainder is 7: $$n=18q+7$$.

Now, since the first term (18q) is divisible by 6, then the remainder will only be from the second term, which is 7. 7 divided by 6 yields the remainder of 1.

Answer: B. Discuss this question HERE.

Example #2 (easy)

If n is a prime number greater than 3, what is the remainder when n^2 is divided by 12 ?
A. 0
B. 1
C. 2
D. 3
E. 5

There are several algebraic ways to solve this question, but the easiest way is as follows: since we cannot have two correct answers just pick a prime greater than 3, square it and see what would be the remainder upon division of it by 12.

If $$n=5$$, then $$n^2=25$$. The remainder upon division 25 by 12 is 1.

Answer: B. Discuss this question HERE.

Example #3 (easy)

What is the tens digit of positive integer x ?
(1) x divided by 100 has a remainder of 30.
(2) x divided by 110 has a remainder of 30.

(1) x divided by 100 has a remainder of 30. We have that $$x=100q+30$$: 30, 130, 230, ... as you can see every such number has 3 as the tens digit. Sufficient.

(2) x divided by 110 has a remainder of 30. We have that $$x=110p+30$$: 30, 140, 250, 360, ... so, there are more than 1 value of the tens digit possible. Not sufficient.

Answer: A. Discuss this question HERE.

Example #4 (easy)

What is the remainder when the positive integer n is divided by 6?
(1) n is multiple of 5
(2) n is a multiple of 12

(1) n is multiple of 5. If n=5, then n yields the remainder of 5 when divided by 6 but if n=10, then n yields the remainder of 4 when divided by 6. We already have two different answers, which means that this statement is not sufficient.

(2) n is a multiple of 12. Every multiple of 12 is also a multiple of 6, thus n divided by 6 yields the remainder of 0. Sufficient.

Answer: B. Discuss this question HERE.

Example #5 (medium)

If s and t are positive integers such that s/t = 64.12, which of the following could be the remainder when s is divided by t ?
A. 2
B. 4
C. 8
D. 20
E. 45

$$s$$ divided by $$t$$ yields the remainder of $$r$$ can always be expressed as: $$\frac{s}{t}=q+\frac{r}{t}$$ (which is the same as $$s=qt+r$$), where $$q$$ is the quotient and $$r$$ is the remainder.

Given that $$\frac{s}{t}=64.12=64\frac{12}{100}=64\frac{3}{25}=64+\frac{3}{25}$$, so according to the above $$\frac{r}{t}=\frac{3}{25}$$, which means that $$r$$ must be a multiple of 3. Only option E offers answer which is a multiple of 3

Answer. E. Discuss this question HERE.

Example #6 (medium)

Positive integer n leaves a remainder of 4 after division by 6 and a remainder of 3 after division by 5. If n is greater than 30, what is the remainder that n leaves after division by 30?
A. 3
B. 12
C. 18
D. 22
E. 28

Positive integer n leaves a remainder of 4 after division by 6: $$n=6p+4$$. Thus n could be: 4, 10, 16, 22, 28, ...
Positive integer n leaves a remainder of 3 after division by 5: $$n=5q+3$$. Thus n could be: 3, 8, 13, 18, 23, 28, ...

There is a way to derive general formula for $$n$$ (of a type $$n=mx+r$$, where $$x$$ is a divisor and $$r$$ is a remainder) based on above two statements:

Divisor $$x$$ would be the least common multiple of above two divisors 5 and 6, hence $$x=30$$.

Remainder $$r$$ would be the first common integer in above two patterns, hence $$r=28$$.

Therefore general formula based on both statements is $$n=30m+28$$. Hence the remainder when positive integer n is divided by 30 is 28.

Answer. E. Discuss this question HERE.

Example #7 (medium)

If x^3 - x = n and x is a positive integer greater than 1, is n divisible by 8?
(1) When 3x is divided by 2, there is a remainder.
(2) x = 4y + 1, where y is an integer.

$$x^3-x=x(x^2-1)=(x-1)x(x+1)$$, notice that we have the product of three consecutive integers. Now, notice that if $$x=odd$$, then $$x-1$$ and $$x+1$$ are consecutive even integers, thus one of them will also be divisible by 4, which will make $$(x-1)(x+1)$$ divisible by 2*4=8 (basically if $$x=odd$$ then $$(x-1)x(x+1)$$ will be divisible by 8*3=24).

(1) When 3x is divided by 2, there is a remainder. This implies that $$3x=odd$$, which means that $$x=odd$$. Therefore $$(x-1)x(x+1)$$ is divisible by 8. Sufficient.

(2) x = 4y + 1, where y is an integer. We have that $$x=even+odd=odd$$, thus $$(x-1)x(x+1)$$ is divisible by 8. Sufficient.

Answer: D. Discuss this question HERE.

Example #8 (medium)

If x^3 - x = n and x is a positive integer greater than 1, is n divisible by 8?
(1) When 3x is divided by 2, there is a remainder.
(2) x = 4y + 1, where y is an integer.

$$x^3-x=x(x^2-1)=(x-1)x(x+1)$$, notice that we have the product of three consecutive integers. Now, notice that if $$x=odd$$, then $$x-1$$ and $$x+1$$ are consecutive even integers, thus one of them will also be divisible by 4, which will make $$(x-1)(x+1)$$ divisible by 2*4=8 (basically if $$x=odd$$ then $$(x-1)x(x+1)$$ will be divisible by 8*3=24).

(1) When 3x is divided by 2, there is a remainder. This implies that $$3x=odd$$, which means that $$x=odd$$. Therefore $$(x-1)x(x+1)$$ is divisible by 8. Sufficient.

(2) x = 4y + 1, where y is an integer. We have that $$x=even+odd=odd$$, thus $$(x-1)x(x+1)$$ is divisible by 8. Sufficient.

Answer: D. Discuss this question HERE.

Example #9 (hard)

When 51^25 is divided by 13, the remainder obtained is:
A. 12
B. 10
C. 2
D. 1
E. 0

$$51^{25}=(52-1)^{25}$$, now if we expand this expression all terms but the last one will have $$52=13*4$$ in them, thus will leave no remainder upon division by 13, the last term will be $$(-1)^{25}=-1$$. Thus the question becomes: what is the remainder upon division -1 by 13? The answer to this question is 12: $$-1=13*(-1)+12$$.

Answer: A. Discuss this question HERE.

Example #10 (hard)

When positive integer x is divided by 5, the remainder is 3; and when x is divided by 7, the remainder is 4. When positive integer y is divided by 5, the remainder is 3; and when y is divided by 7, the remainder is 4. If x > y, which of the following must be a factor of x - y?
A. 12
B. 15
C. 20
D. 28
E. 35

When the positive integer x is divided by 5 and 7, the remainder is 3 and 4, respectively: $$x=5q+3$$ (x could be 3, 8, 13, 18, 23, ...) and $$x=7p+4$$ (x could be 4, 11, 18, 25, ...).

We can derive general formula based on above two statements the same way as for the example above:

Divisor will be the least common multiple of above two divisors 5 and 7, hence 35.

Remainder will be the first common integer in above two patterns, hence 18. So, to satisfy both this conditions x must be of a type $$x=35m+18$$ (18, 53, 88, ...);

The same for y (as the same info is given about y): $$y=35n+18$$;

$$x-y=(35m+18)-(35n+18)=35(m-n)$$. Thus $$x-y$$ must be a multiple of 35.

Answer: E. Discuss this question HERE.

Example #11 (hard)

If p, x, and y are positive integers, y is odd, and p = x^2 + y^2, is x divisible by 4?
(1) When p is divided by 8, the remainder is 5
(2) x – y = 3

(1) When p is divided by 8, the remainder is 5. This implies that $$p=8q+5=x^2+y^2$$. Since given that $$y=odd=2k+1$$, then $$8q+5=x^2+(2k+1)^2$$ --> $$x^2=8q+4-4k^2-4k=4(2q+1-k^2-k)$$.

So, $$x^2=4(2q+1-k^2-k)$$. Now, if $$k=odd$$ then $$2q+1-k^2-k=even+odd-odd-odd=odd$$ and if $$k=even$$ then $$2q+1-k^2-k=even+odd-even-even=odd$$, so in any case $$2q+1-k^2-k=odd$$ --> $$x^2=4*odd$$ --> in order $$x$$ to be multiple of 4 $$x^2$$ must be multiple of 16 but as we see it's not, so $$x$$ is not multiple of 4. Sufficient.

(2) x – y = 3 --> $$x-odd=3$$ --> $$x=even$$ but not sufficient to say whether it's multiple of 4.

Answer: A. Discuss this question HERE.

Example #12 (hard)

$$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

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

Answer: B. Discuss this question HERE.
______________________________________________
Check more DS questions on remainders HERE.
Check more PS questions on remainders HERE.
_________________
MBA Section Director
Joined: 19 Mar 2012
Posts: 3544
Location: India
GPA: 3.8
WE: Marketing (Energy and Utilities)
Followers: 1511

Kudos [?]: 11833 [1] , given: 1861

### Show Tags

24 Dec 2012, 08:35
1
KUDOS
Expert's post
1
This post was
BOOKMARKED
this just keeps getting better and better!
_________________
BSchool Forum Moderator
Joined: 27 Aug 2012
Posts: 1196
Followers: 129

Kudos [?]: 1465 [0], given: 142

### Show Tags

26 Dec 2012, 00:05
Wonderful...! Kudos for another Masterpiece from the Master...

Cheers..
_________________
Intern
Joined: 17 Jul 2011
Posts: 38
Followers: 0

Kudos [?]: 3 [1] , given: 6

### Show Tags

26 Dec 2012, 23:03
1
KUDOS
Bunuel wrote:
REMAINDERS

This formula can also be written as $$\frac{y}{x} = x + \frac{r}{x}$$

Hi Bunuel

many thanks for this.I may have found a typo.Correct me if i am wrong, the first term to the right of the equality should be q right, instead of x?

Regards,
Anurag
Math Expert
Joined: 02 Sep 2009
Posts: 36566
Followers: 7079

Kudos [?]: 93183 [0], given: 10553

### Show Tags

27 Dec 2012, 01:09
anuragbytes wrote:
Bunuel wrote:
REMAINDERS

This formula can also be written as $$\frac{y}{x} = x + \frac{r}{x}$$

Hi Bunuel

many thanks for this.I may have found a typo.Correct me if i am wrong, the first term to the right of the equality should be q right, instead of x?

Regards,
Anurag

Edited the typo. Thank you. +1.
_________________
GMAT Club Legend
Joined: 09 Sep 2013
Posts: 13456
Followers: 575

Kudos [?]: 163 [0], given: 0

### Show Tags

28 Dec 2013, 17:03
Hello from the GMAT Club BumpBot!

Thanks to another GMAT Club member, I have just discovered this valuable topic, yet it had no discussion for over a year. I am now bumping it up - doing my job. I think you may find it valuable (esp those replies with Kudos).

Want to see all other topics I dig out? Follow me (click follow button on profile). You will receive a summary of all topics I bump in your profile area as well as via email.
_________________
Math Expert
Joined: 02 Sep 2009
Posts: 36566
Followers: 7079

Kudos [?]: 93183 [0], given: 10553

### Show Tags

28 May 2014, 03:23
Expert's post
1
This post was
BOOKMARKED
Check out all important topics we have in Main Math forum HERE.

Important topics in PS forums.

Important topics in DS forums.
_________________
Intern
Joined: 10 Mar 2013
Posts: 15
Followers: 0

Kudos [?]: 1 [0], given: 17

### Show Tags

18 Jun 2014, 14:54
I have reviewed this theory but am still having a hard time understanding a couple of things. I will be using the following 2 examples:

Example #1 & 6.

From Example 1: "Now, since the first term (18q) is divisible by 6, then the remainder will only be from the second term, which is 7. 7 divided by 6 yields the remainder of 1." I don't understand why it matters if 18q is divisible by 6 or not and how do you determine if the remainder comes from the second term or not.

From Example 2: Why are we trying to derive an LCM of 5 & 6?

Greatly appreciate the assistance.
Math Expert
Joined: 02 Sep 2009
Posts: 36566
Followers: 7079

Kudos [?]: 93183 [2] , given: 10553

### Show Tags

21 Jun 2014, 06:33
2
KUDOS
Expert's post
I have reviewed this theory but am still having a hard time understanding a couple of things. I will be using the following 2 examples:

Example #1 & 6.

From Example 1: "Now, since the first term (18q) is divisible by 6, then the remainder will only be from the second term, which is 7. 7 divided by 6 yields the remainder of 1." I don't understand why it matters if 18q is divisible by 6 or not and how do you determine if the remainder comes from the second term or not.

From Example 2: Why are we trying to derive an LCM of 5 & 6?

Greatly appreciate the assistance.

18q can be divided equally into 6 groups, so it will leave the remainder of 0. So, the remainder when 18q+1 is divided by 6 will come only from the second term, which is 1.

For example:
18 + 1 = 19 divided by 6 gives the remainder of 1;
18*2 + 1 = 37 divided by 6 gives the remainder of 1;
18*3 + 1 = 55 divided by 6 gives the remainder of 1;
...

Hope it's clear.
_________________
Manager
Joined: 22 Jul 2014
Posts: 128
Location: India
Concentration: General Management, Finance
GMAT 1: 590 Q V
GMAT 2: 670 Q48 V34
WE: Engineering (Energy and Utilities)
Followers: 0

Kudos [?]: 222 [1] , given: 197

### Show Tags

15 Aug 2014, 22:26
1
KUDOS
1
This post was
BOOKMARKED
Amazing stuff/.

Just a suggestion. If there was an attachment for remainders, where all questions are collected in a document 'level-wise' and chapter-wise, it would be amazing. In fact it would also help referring that document to check on the errors
Just a suggestion though.
Intern
Joined: 27 Aug 2014
Posts: 30
GMAT Date: 09-27-2014
Followers: 1

Kudos [?]: 10 [2] , given: 25

### Show Tags

27 Aug 2014, 04:52
2
KUDOS
2
This post was
BOOKMARKED
I would like to add the following shortcuts:

1)
Remainder of (ax + 1)^n / a = 1

Example: 46^3578 / 9 will have a remainder of 1.

2)
Similarly, remainder of (ax - 1)^n / a = 1 (if n is even) or -1 (if n is odd)

Example: 27^79 / 14 will have a remainder of -1 or 13.
Intern
Joined: 27 Aug 2014
Posts: 30
GMAT Date: 09-27-2014
Followers: 1

Kudos [?]: 10 [0], given: 25

### Show Tags

27 Aug 2014, 08:48
3
This post was
BOOKMARKED
Another tip which may be handy.

(Fermat's theorem)

If ‘p’ is a prime number and ‘a’ and ‘p’ are co-primes:

1)
Remainder of (a^p)/p = a
(a^p – a) will be divisible by p.

Example: remainder of (10^13)/13 = 13

2)
Remainder of [a^(p-1)]/p = 1

Example: remainder of (10^12)/13 = 1
Intern
Joined: 14 Jul 2014
Posts: 5
Followers: 0

Kudos [?]: 0 [0], given: 1

### Show Tags

01 Sep 2014, 06:28
Hey guys,

Is it just me or ex 7 and 8 are the same?

Best,
A
Math Expert
Joined: 02 Sep 2009
Posts: 36566
Followers: 7079

Kudos [?]: 93183 [0], given: 10553

### Show Tags

01 Sep 2014, 06:34
Aitken wrote:
Hey guys,

Is it just me or ex 7 and 8 are the same?

Best,
A

Yes, they are the same. Will replace one of them.
_________________
Manager
Joined: 30 Mar 2013
Posts: 137
Followers: 0

Kudos [?]: 41 [0], given: 196

### Show Tags

01 Sep 2014, 13:20
bazc wrote:
I would like to add the following shortcuts:

1)
Remainder of (ax + 1)^n / a = 1

Example: 46^3578 / 9 will have a remainder of 1.

2)
Similarly, remainder of (ax - 1)^n / a = 1 (if n is even) or -1 (if n is odd)

Example: 27^79 / 14 will have a remainder of -1 or 13.

Thank you, but could you explain why I'm wrong:
let's make a cycle for 6: so that will only have 6 in the units place. therefore 6/9. Now since the divisor is greater than the number being divided, the remainder is the number being divided, which is 6?

Same for the second case. I made the cycle for powers of 7, which give me 7 9 3 1.
7^79 will have a units digit of 3, so 3/14 should give an answer of R=3?
Manager
Joined: 30 Mar 2013
Posts: 137
Followers: 0

Kudos [?]: 41 [0], given: 196

### Show Tags

01 Sep 2014, 13:23
bazc wrote:
Another tip which may be handy.

(Fermat's theorem)

If ‘p’ is a prime number and ‘a’ and ‘p’ are co-primes:

1)
Remainder of (a^p)/p = a
(a^p – a) will be divisible by p.

Example: remainder of (10^13)/13 = 13

2)
Remainder of [a^(p-1)]/p = 1

Example: remainder of (10^12)/13 = 1

Intern
Joined: 07 Apr 2015
Posts: 1
Followers: 0

Kudos [?]: 0 [0], given: 0

### Show Tags

07 Apr 2015, 16:39
Hi Bunuel,
I came across this DS question I couldn't solve nor find a similar problem.
It was (more or less) as follows.
I'm quite lost here, so I'm sorry if this does not make any sense:

What is the value of k?

1) The remainder of (k+32)/k is 8.
2) The remainder of (k+46)/k is 6.

I guess this is a C, but I have no clue how to "justify" this.
Intern
Joined: 15 Feb 2015
Posts: 11
Followers: 0

Kudos [?]: 0 [0], given: 18

### Show Tags

09 Apr 2015, 15:08
FrancoGMATtester wrote:
What is the value of k?

1) The remainder of (k+32)/k is 8.
2) The remainder of (k+46)/k is 6.

I also saw a similar problem in a test.

Bunuel could you or some other expert please clarify?

Much appreciated.
Francisco
Current Student
Joined: 11 Oct 2013
Posts: 124
Concentration: Marketing, General Management
GMAT 1: 600 Q41 V31
Followers: 1

Kudos [?]: 51 [0], given: 137

### Show Tags

14 Dec 2015, 03:56
Alternative solution to #6

Positive integer n leaves a remainder of 4 after division by 6 and a remainder of 3 after division by 5. If n is greater than 30, what is the remainder that n leaves after division by 30?
A. 3
B. 12
C. 18
D. 22
E. 28

We have -
1) n - 4 = 6t and
2) n - 3 = 5k

We need to find
3) n - R = 30x

Multiply (1) by 5 and (2) by 6
1) 5n - 20 = 30t
2) 6n - 18 = 30k

(2) - (1)
n + 2 = 30(t - k)

t and k are positive integers. So we can assume them as x fro m(3)
Thus R = -2 or 30-2 = 28.

+Kudos, if this helped
_________________

Its not over..

Current Student
Joined: 11 Oct 2013
Posts: 124
Concentration: Marketing, General Management
GMAT 1: 600 Q41 V31
Followers: 1

Kudos [?]: 51 [1] , given: 137

### Show Tags

14 Dec 2015, 05:58
1
KUDOS
Bunuel wrote:
[/size]

$$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

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

Answer: B. Discuss this question HERE.
______________________________________________
Check more DS questions on remainders HERE.
Check more PS questions on remainders HERE.

Hi Bunuel

Link to 10th question's discussion, seems to be broken
_________________

Its not over..

Re: REMAINDERS   [#permalink] 14 Dec 2015, 05:58

Go to page    1   2    Next  [ 25 posts ]

Similar topics Replies Last post
Similar
Topics:
7 Find the remainder when 12^190 is divided by 1729 ? 5 23 Sep 2013, 10:37
1 Cyclicity and remainders 2 18 Sep 2013, 12:38
Remainder 3 10 Sep 2013, 16:53
Remainders 3 31 Jan 2012, 18:00
2 Remainder question 12 21 Mar 2011, 11:40
Display posts from previous: Sort by