Remainder based problems

https://www.mbatious.com/topic/61/remainder-theorem-for-cat

Remainder theorem is a very important topic in number system and

can be learnt easily. We will try to learn some interesting concepts
regarding remainders with examples. Here we go!

Definition of remainder

If a and d are natural numbers, with d # 0, it can be proved that there exist uniq
integers q and r, such that a = qd + r and 0 ≤ r < d. The number q is called the qu
while r is called the remainder.

Dividend = Divisor × Quotient + Remainder.

if r = 0 then we say that a is perfectly divisible by d or d is a factor of a. For example, we say 8 is a

factor of 40 because 40 leaves a remainder 0 with 8.

By definition remainder cannot be negative.

Now just to give an example, 17 = 3 * 5 + 2, which means 17 when

divided by 5 will give 2 as remainder. Well that was simple!

Find Remainder[ (12 * 13 * 14) / 5 ]

Remainder [ (12 * 13 * 14) / 5 ]

= Remainder [2184/5] = 4. But this method is not the right one for us :)

In order to find the remainder of an expression find the individual remainder an

each term with the respective remainders.

Eg: Remainder[(100 + 30 * 4 - 8 ) / 7]

= Remainder[(Remainder[100/7] + Remainder[30/7] * Remainder[4/7] - Remainde

7]

= Remainder[(2 + 2 * 4 - 1)/7] = Remainder[9/7] = 2

In the above case 12, 13 and 14 will give remainders 2, 3 and 4

respectively when divided by 5. So replace them with the
respective remainders in the expression and find the remainder
again.
Remainder [ (12 * 13 * 14) / 5 ] = Remainder[(2 * 3 * 4) / 5] =
Remainder[ 24 / 5 ] = 4.

Note:

One common mistake while dealing with remainders is when we

have common factors in both dividend and divisor. Example, what
is the remainder when 15 is divided by 9

15 / 9 is same as 5 / 3, remainder 2. Correct? No 15/9 will give a

remainder of 6.

Where we slipped?

Always remember that if we find remainder after cancelling

common terms make sure we multiply the remainder obtained with
the common factors we removed.

In previous case we will get correct answer (6) when we multiply

the remainder obtained (2) with the common factor we removed (3).

What is the remainder of 1421 * 1423 * 1425 when divided by 12 ?

( CAT 2000 )

1421, 1423 and 1425 gives 5, 7 and 9 as remainders respectively

when divided by 12.

Remainder [ (1421 * 1423 * 1425 ) / 12 ] = Remainder [ (5 * 7 * 9) ] /

12, gives a remainder of 3.

Find the reminder when 1! + 2! + 3! + . . . . .. . .. 99! + 100! is divided

by the product of first 7 natural numbers

From 7! the remainder will be zero. Why ? because 7! is nothing but

product of first 7 natural numbers and all factorial after that will
have 7! as one of the factor. so we are concerned only factorials till
7!, i.e, 1! + 2! + 3! + 4! + 5! + 6!

1! + 2! + 3! + 4! + 5! + 6! = 873 and as 7! > 873 our remainder will be

873

What is the remainder when 64999 is divided by 7? (GMAT Type

Question)

Many of us get intimidated with such numbers, always remember

that the key to crack quant is a strong hold of basic concepts.

Remainder [64999 / 7 ] = Remainder[ 64 * 64 * …. 64 (999 times) / 7 ]

Remainder[64/7] = 1, hence Remainder [64999 / 7 ] = Remainder [ 1 999
/
7]= 1

What is the remainder when 444444 ^ 444 is divided by

7 ? (GMAT Type Question)

Remainder[444/7] = 3

Remainder[ 444 444 ^ 444

/ 7 ] = Remainder [ 3 444 ^ 444
/7]

= Remainder [ ( 32 ) 222 ^ 444 / 7 ] = Remainder [ 2222 ^ 444 / 7 ] ( As

Remainder [ 32 / 7 ] = 2 )

= Remainder [ ( 23 ) 74 ^ 444 / 7] = Remainder [ 1 74 ^ 444

/ 7 ] = 1 ( As
Remainder [ 23 / 7 ] = 1 )

Concept of negative remainder

We saw earlier that by definition remainder cannot be negative. But

considering negative remainder is a very useful exam trick.

For example,

What is the remainder when 211 divided by 3?

The easiest method for this one will be using the concept of
negative remainders.

Here 2 when divided by 3 gives a remainder of -1. (Say)

2 = 3 * 1 + (-1), remainder is -1, which is theoretically incorrect but

let’s cheat!

So we are asked to find (-1) * (-1) * … 11 times divided by 3.

Which is Remainder[-1/3] = -1.

Whenever you are getting negative number as a remainder,

make it positive by adding the divisor to the negative remainder.

Here required answer is 3 + (-1) = 2.

Remainder when (41 * 42) is divided by 43

Use negative remainder concept,

Remainder [ 41 * 42 / 13 ] = Remainder[(-2) * (-1) / 43 ]( as 41 = 43 *

1 – 2 and 42 = 43 * 1 – 1)
= Remainder [ 2 /43 ] = 2 (here we got a positive remainder itself, so
no need of correction)

Some useful concepts while dealing with remainder are given below.

Remainder[(ax + 1)n / a] = 1 for all values of n.

Find the remainder when 100 99 is divided by 11

Remainder[10099 / 11 ] = Remainder[(11* 9 + 1)99 / 11] = 1.

Remainder[(ax - 1)n / a ] = 1 when n is even

Remainder[(ax - 1)n / a ] = (a-1) when n is odd.

Find the remainder when 21875 is divided by 17.

Remainder[21 / 17] = 4, so we need to find Remainder[4875/ 17]

42 = 16 = (17 – 1), we can write the expression as Remainder[(42)437 *

4 / 17]

= Remainder[(17 – 1)437 * 4 / 17] = Remainder[(17-1) * 4 / 17] = Remainder[64 / 17] = 13.

Remainder[(an + bn) / (a + b) ] = 0 when n is odd.

Remainder[(2101 + 3101) / 5 ] = 0

What is the remainder when 1523 + 2323 is divided by 19 ? ( CAT

2004 )

1523 + 2323 is divisible by 15 + 23 = 38 ( as 23 is odd).

So Rem[(1523 + 2323)/19] = 0

Remainder[(an + bn + cn + ...) / (a + b + c + ...) ] = 0 if ( a + b + c + ... are in Arithme

progression and n is odd

What is the remainder when 163 + 173 + 183 + 193 is divided by 70 ?

( CAT 2005 )

Apply the above funda. Here n =3 ( odd ), 16 + 17 + 18 + 19 = 70 and 16,17,18 and 19 are in AP.
Remainder is 0

Remainder[(an - bn) / (a + b) ] = 0 when n is even.

Remainder[(5100 – 2100) / 7] = 0

Remainder [(an - bn) / (a - b) ] = 0

Now we can say Remainder[(10175 – 7675) / 25] = 0 in no time..!

The remainder when f(x) = a + bx + cx2+ dx3+ … is divided by (x-a) is f(a)

Rem [(3x2 + 4x + 1) / (x-2)] = f(2) = 3 * 22 + 4 * 2 + 1 = 21

Cyclic property of remainders

Sometimes it is easy to find the remainder by using the cyclic property of remainders, remainders
forming a pattern.

As a thumb rule if we divide pn with q, the remainder will follow a pattern.

For example,

Remainder [ 21 / 3 ] = 2, Remainder [ 22 / 3 ] = 1, Remainder [ 23 / 3 ] =

2, Remainder [ 24 / 3 ] = 1 and so on.

Pattern repeats in cycles of 2. Remainder [ 2n / 3 ] = 2 when n is odd

and 1 when n is even.

With this information, we can find Remainder [ 23276 / 3 ] = 1 very

quickly.

One more, Remainder [ 91 / 11 ] = 9, Remainder [ 92 / 11 ] = 4,

Remainder [ 93 / 11 ] = 3 , Remainder [ 94 / 11 ] = 5

Remainder [ 95 / 11 ] = 1, Remainder [ 96 / 11 ] = 9, Remainder [ 97 / 11

] = 4, Remainder [ 98 / 11 ] = 3

Pattern repeats in cycles of 5. So if we are asked to find Remainder

[ 9100 / 11 ]， we know it is 1. (100 is in the form 5n and we know
remainder for 5 is 1.. cool right ?)

Note:

Remainder [93/11] = Remainder [Remainder [92/11] * Remainder

[92/11] ) / 11] = Remainder [ 4 * 9 / 11] = 3.

This funda comes very handy in scenarios like this. Like we dont
have to solve Rem [98 /11] because we already know Rem[94 /11] as
5..

Rem [98 /11] = Remainder [ 94 * 94 /11 ] = Remainder [ (5 * 5) / 11 ] = 3

Also, Remainder [97 /11] = Remainder [93 * 94 / 11 ] = Remainder [ ( 3 *

5 ) / 11 ] = 4 ( as Rem [93 /11] = 3 and Rem [94 /11] = 5 )

What is the remainder when 7100 is divided by 4?

Remainder[ 71 / 4 ] = 3, Remainder[ 72 / 4 ] = 1, Remainder[ 73 / 4 ] = 3,
Remainder[ 74 / 4 ] = 1 and so on...

Pattern repeats in cycles of 2. Remainder [ 7n / 4 ] is 3 when n is

odd and is 1 when n is even.

7100 when divided by 4 gives a remainder of 1.

(Same can be solved using other methods also)

Find the remainder when 399^99 is divided by 7

Find the pattern of remainder when 3n is divided by 7.

Remainder [ 31 / 7 ] = 3, Remainder [ 32 / 7 ] = 2

Remainder [ 33 / 7 ] = 6 (Don’t calculate Rem[33/7] we already have

Rem[31/7] & Rem[32/7])

Remainder [ 34 / 7 ] = 4 (using Rem[32/7])

Remainder [ 35 / 7 ] = 5 (using Rem[33/7] and Rem[32/7] )

Remainder [ 36 / 7 ] = 1 (using Rem[33/7])

Remainder [ 37 / 7 ] = 3 (using Rem[33/7] and Rem[34/7] )

Remainder [ 38 / 7 ] = 2 (using Rem[34/7])

Pattern repeats in cycles of 6. (We can do this easily from Euler’s

theorem, as φ(7) = 6, hence Remainder [36/7] = 1. Explained just to
get the idea of patterns in remainders)

Now our task is to find Remainder [ 9999/ 6 ]

Remainder [9999/6] = Remainder [399/6]

Remainder [ 31 / 6 ] = 3, Remainder [ 32 /6 ] = 3, Remainder [ 33 / 6 ] =

3 and so on..!

Hence 9999 can be written as 6n + 3.

Remainder [ 399^99 / 7 ] = Remainder [ 3(6n + 3)/ 7 ]

we have found out the pattern of 3 divided by 7 repeats in cycles of

6. So we need to find the Remainder [ 33 / 7 ] to get the answer
which is equal to 6

Euler’s Remainder Theorem

We say two numbers ( say a and b ) are co-prime to each other when HCF(a,b) = 1,
i.e, no divisor divide both of them completely at the same time.
Eg: 21 and 8 are co primes because they don't have any common factors except 1

In number theory, Euler's totient or phi function, φ(n) is an arithmetic

function that counts the number of positive integers less than or equal to n

that are relatively prime to n.

Take n = 9, then 1, 2, 4, 5, 7 and 8, are relatively prime to 9.

Therefore, φ(9) = 6.

How to find Euler’s totient?

Say n = P1a x P2b x P3c x ... ( where P1 P2, P3 ... are prime factors of n )

φ(n) = n x (1 - 1/P1) x (1 - 1/P2) x (1 - 1/P3) x ....

If n is prime then φ(n) = n - 1

φ(100) = 100 x (1-1 / 2) x (1- 1 / 5) = 100 x 1 / 2 x 4 / 5 = 40

φ(9) = 9 x (1 – 1/3) = 6

Euler’s Remainder theorem states that for co prime numbers M and N,

Remainder [Mφ(N) / N] = 1

Always check whether the numbers are co primes are not. Euler’s theorem

is applicable only for co prime numbers

What is the remainder when 21865 is divided by 17

Remainder[21/17] = 4

Remainder [ 21865/ 17 ] = Remainder [ 4865/ 17 ]

4 and 17 are co prime numbers. ( A prime number is always

coprime to any other number)

φ(17) = 17 x ( 1 – 1 / 17) = 16.

So Euler’s theorem says Remainder [ 416/ 17 ] = 1

To use this result in the given problem we need to write 865 in 16n
+ r form.

865 = 16 * 54 + 1, so 4865 can be written as 416 * 54 x 4

Remainder[4865/17] = Remainder[ 416*54/17] * Remainder[4/17] = 1 * 4 =
4

What is the remainder when 99999999 is divided by 23

Remainder[99/23] = 7

Remainder[99999999/23] = Remainder[7999999/23]

7 and 23 are co prime numbers

Here 23 is prime, so φ(23) = 22

So by applying Euler's theorem we can say that Remainder[722/23] =

1

In order to use this result in our problem we need to write 999999

in 22n + r form. Before rushing into dividing 999999 by 22, just
think whether we have any better way to do that. We know, 999999
= 22n + r , 0 ≤ r < 22. 999999 is divisible by 11 and so is 22. which
means r is also a multiple of 11. Only numbers which are less than
22 and is a multiple of 11 is 11 and 0. But as 999999 is odd and 22n
is even, r should be odd. so r = 11. Saved our time right ? ;)

999999 = 22n + 11

Remainder[7999999/23] = Remainder[722n/23] * Remainder[711/23] = 1 *

Remainder[711/23] = Remainder[72 * 5* 7/23]

= Remainder[ 35 * 7/23] ( as Remainder[72/23] = 3 )

= Remainder[33 * 32 * 7/23] = Remainder[4 * 9 * 7/23] = Remainder[28

* 9/23] = Remainder[45/23] = 22

Find the remainder when 97 97 ^ 97

is divided by 11

Remainder [97/11] = 9

So, Remainder [9797^97/11] = Remainder [9 97^97/11]

From Euler’s theorem, Remainder [910/11] = 1

97 and 10 are again co primes. So φ(10) = 10 (1-1/2) (1-1/5) = 4

Remainder [974/11] = 1

97 = 4n + 1, So Remainder [9797/11] = Remainder [97/10] = 7

Means 9797 can be written as 10n + 7

 Now our original question,

Remainder [997^97/11] = Remainder [910n+7/11] = Remainder [97/11] = 4 :)

Fermat’s little theorem

Euler’s theorem says that if p is a prime numberand a and p are co-

primes then aφ(p) / p always gives a remainder of 1.

Now we know for any prime number p, φ(p) = p - 1

Remainder of a( p – 1 )/ p is 1, which is Fermat’s little theorem

We can derive other useful results like

 Remainder of ap / p is a.

 (ap – a) is always divisible by a.

Wilson’s theorem

Remainder[(p-1)! / p ] = (p-1), if p is a prime number.

We can also derive some useful results like

 Remainder of [(p-1)! + 1] / p is zero.

 Remainder of (p-2)! / p is 1.

Example:

Remainder of [22!/23] = 22

Remainder of [21!/23] = 1

https://gradestack.com/General-Aptitude/Operations-on-Numbers/Remainder-Theorem/15288-
3083-6496-study-wtw

https://gmatclub.com/forum/compilation-of-tips-and-tricks-to-deal-with-remainders-86714.html

lease read this first :

1) Take your time with these points. Some of them might be a little difficult
to follow in the first reading, but don't give up. The concepts are fairly
simple.
2) These tips if mastered will be extremely valuable in the GMAT to help
solve a variety of questions not limited specifically to remainders. I have
been using them for quite a while now and they have not only helped me
improve my accuracy but also my speed.
3) If you have any doubts, please do not hesitate to ask (no matter how
stupid you might think them to be!). If you do not ask, you will never learn.
4) Lastly, have fun while trying to understand these tips and tricks as that,
according to me, is the best possible way to learn.

All the best!

-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-x-
x-x-x-x-x-x-x-
NOTE: Where ever you see R of 'x' it just stands for Remainder of x.

1) The possible remainders when a number is divided by ‘n’ can range from
0 to (n-1).
Eg. If n=10, possible remainders are 0,1,2,3,4,5,6,7,8 and 9.

2) 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.
This is good for questions such as : ' What is the last digit of.....' or ' What are
the last two digits of.....' .

3) If a number leaves a remainder ‘r’ (the number is the divisor), all its
factors will have the same remainder ‘r’ provided the value of ‘r’ is less than
the value of the factor.
Eg. If remainder of a number when divided by 21 is 5, then the remainder of
that same number when divided by 7 (which is a factor of 21) will also be
5.

If the value of ‘r’ is greater than the value of the factor, then we have to take
the remainder of ‘r’ divided by the factor to get the remainder.
Eg. If remainder of a number when divided by 21 is 5, then the remainder of
that same number when divided by 3 (which is a factor of 21) will be
remainder of 5/3, which is 2.

4) Cycle of powers : This is used to find the remainder of nxnx, when

divided by 10, as it helps us in figuring out the last digit of nxnx.

The cycle of powers for numbers from 2 to 10 is given below:

2: 2, 4, 8, 6 → all 24x24x will have the same last digit.

3: 3, 9, 7, 1 → all 34x34x will have the same last digit.

4: 4, 6 → all 42x42x will have the same last digit.

5: 5 → all 5x5x will have the same last digit.

6: 6 → all 6x6x will have the same last digit.

7: 7, 9, 3, 1 → all 74x74x will have the same last digit.

8: 8, 4, 2, 6 → all 84x84x will have the same last digit.

9: 9, 1 → all 92x92x will have the same last digit.

10: 0 → all 10x10x will have the same last digit.

5) Many seemingly difficult remainder problems can be simplified using the

following formula :
Rofx∗yn=Rof(Rofxn)∗(Rofyn)nRofx∗yn=Rof(Rofxn)∗(Rofyn)n

Eg. Rof20∗2725=Rof(Rof2025)∗(Rof2725)25=Rof(20)∗(2)25=Rof4025=15
Rof20∗2725=Rof(Rof2025)∗(Rof2725)25=Rof(20)∗(2)25=Rof4025=15

Eg. Rof22513=Rof(15)∗(15)13=Rof(2)∗(2)13=Rof413=4Rof22513=Rof(15)
∗(15)13=Rof(2)∗(2)13=Rof413=4

6) Rofx∗ynRofx∗yn , can sometimes be easier calculated if we take it

as Rof(Rof(x−n)n)∗(Rof(y−n)n)nRof(Rof(x−n)n)∗(Rof(y−n)n)n
Especially when x and y are both just slightly less than n. This can be easier
understood with an example:

Eg. \(R of \frac{(19)*(21)}{25} = R of \frac{(-6)*(-4)}{25} = 24\)

NOTE: Incase the answer comes negative, (if x is less than n but y is greater
than n) then we have to simply add the remainder to n.
Eg. Rof(23)∗(27)25=Rof(−2)∗(2)25=−4.Rof(23)∗(27)25=Rof(−2)∗(2)25=−4
. Now, since it is negative, we have to add it to 25.R=25+(−4)=21R=25+
(−4)=21

[Note: Go here to practice two good problems where you can use some of
these concepts explained : http://gmatclub.com/forum/numbers-
86325.html]

7) If you take the decimal portion of the resulting number when you divide
by "n", and multiply it to "n", you will get the remainder. [Special thanks to
h2polo for this one]

Note: Converse is also true. If you take the remainder of a number when
divided by 'n', and divide it by 'n', it will give us the remainder in decimal
format.

Eg. 85=1.685=1.6

In this case, 0.6∗5=30.6∗5=3

Therefore, the remainder is 33.

This is important to understand for problems like the one below:

If s and t are positive integer 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

OA :
Spoiler: ::

Here is another important property about reminders that everyone should

understand:

If you take the decimal portion of the resulting number when you divide by
"n", and multiply it to "n", you will get the remainder.

For example, 8/5 = 1.6

.6 * 5 = 3

Therefore, the remainder is 3.

This is important to understand for problems like the one below:

If s and t are positive integer 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

If s and t are positive integer 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

Ans: Using the technique: remainder = 0.12*t => the answer is multiple of
12. but none of the options match...did i miss something or is my
understanding wrong

ctrlaltdel wrote:
If s and t are positive integer 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

Ans: Using the technique: remainder = 0.12*t => the answer is multiple of
12. but none of the options match...did i miss something or is my
understanding wrong
Don't worry. This question is not that straightforward but understanding it
will really help you for any other such question.

The answer is a multiple of 0.12.

However, If we consider it to be a multiple of 12, then we have to multiply

each of the answers by 100 and then check.

Try working it out now.

You should get the answer to be (E). If you face any further difficulties then
feel free to ask again!
_________________

If s and t are positive integer 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

Ans: Using the technique: remainder = 0.12*t => the answer is multiple of
12. but none of the options match...did i miss something or is my
understanding wrong

http://a4academics.com/careers-guidance-jobs/68-quantitative-aptitude/550-tips-and-tricks-to-
solve-quantitative-aptitude-test-questions-on-cyclicity-of-numbers

Cyclicity of Numbers Aptitude Test Questions - Concepts

Formulas Tips




 

43 Votes
Last Updated: Monday, 09 January 2017 Hits: 58814

In most of the quantitative aptitude tests you might have faced questions like what’s
the units digit of 9290 or 23512 etc. Needless to say, it’s practically impossible to do the
direct calculation to find the answer considering the time constraint of quantitative
aptitude exams. But if you notice, you can clearly see that there exists a pattern
when you apply same mathematical operation continuously on a number. This is
called cyclicity of numbers. In this paper we will have a look at top Cyclicity of
Numbers aptitude questions, concepts and shortcuts on how to solve units digit
problems quickly using concepts of number cyclicity

Problems based on cyclicity of numbers are common in most MBA entrance

examinations like CAT, MAT, XAT, GMAT and other competitive exams like BANK
tests. Questions related to number cyclicity have also started appearing in career
recruitment tests or placement tests conducted by various companies. Since last few
years TCS has redesigned their quantitative aptitude test patterns which include
questions based on cyclicity of numbers. Questions like 'find the units digit in the
result of ab 'are difficult to solve if you do them manually.

Instead if you apply theory of cyclicity of numbers, these questions does not take
much of your time to solve them. Remember time is a constraint all competitive
exams. So picking up concepts of cyclicity of numbers is definitely a bonus. Take the
online test provided at the end to check your understanding level once you complete
this tutorial on number cyclicity.

You can also try

 Tricks to crack aptitude questions on Numbers

 Important formulas and Tips to solve percentage aptitude questions

Important Concepts and Shortcuts of Cyclicity of

Numbers
Types of questions based on cyclicity of numbers
There are mainly 3 categories of questions which fall under cyclicity of numbers, that include

1. How to find units digit of ab

2. How to find units digit of ab * cd * ef

3. How to find units digit of abc

 Let's see how to solve these questions using the concept of cyclicity of numbers, with
examples.

Find units digit of ab

Given ab, units place digit of the result depends on units place digit of a and the divisibility of
power b.
Consider powers of 2
As we know,

21 =2
22 = 4
23 = 8
24 = 16
25 = 32
26 = 64
27 = 128.. and so on

What do you observe here? We can see that the units place digit for powers of 2 repeat in an
order: 2, 4, 8, 6. So the "cyclicity" of number 2 is 4 (that means the pattern repeats after 4
occurrences) and the cycle pattern is 2, 4, 8, 6. From this you can see that to find the units
place digit of powers of 2, you have to divide the exponent by 4.

Let's check the validity of above formula with an example.

Example

 Find the units place digit of 299?

Using the above observation of cyclicity of powers of 2, divide the exponent by 4. 99/4 gives
reminder as 3. That means, units place digit of 299 is the 3rd item in the cycle which is 8.

Shortcuts to solve problems related to units place digit of ab

 Case 1: If b is a multiple of 4
o
If a is an even number, ie: 2, 4, 6 or 8 then the units place digit is 6
o
If a is an odd number, ie: 1, 3, 7 or 9 then the units place digit is 1

 Case 2: If b is not a multiple of 4

o
Let r be the reminder when b is divided by 4, then units place of ab will be equal
to units place of ar

Let's call it the general rule of cyclicity. Using these rules you can solve all the problems
related to cyclicity of numbers.

Here we have captured the cyclicity of numbers upto 9 in the below table.
 Number ^1 ^2 ^3 ^4 Cyclicity

2 2 4 8 6 4

3 3 9 7 1 4

4 4 6 4 6 2

5 5 5 5 5 1

6 6 6 6 6 1

7 7 9 3 1 4

8 8 4 2 6 4

9 9 1 9 1 2

Find units digit for numbers of the form ab * cd

Question of this type is similar to first category.

 First find the unit digit of ab and cd separately. Let the answers be x and y
 Then unit digit of ab * cd = units digit of x * y

Find units digit of abc

Questions of this type have to be approached on a case by case basis.

 Case 1: If cyclicity of units place digit of a is 4 then we have to divide the exponent of
a by 4 and find out the remainder. Depending on the value of remainder we can apply the
general rule of cyclicity given above and reach the solution.
 Case 2: If cyclicity of units place digit of a is 2, only extra information we need to find
is if the exponent will be even or odd. Then we can apply the general rule of cyclicity given
above and reach the solution.
 Let's see application of these rules with help of examples

Example 1:

Find the units place digit of 24344

1. Here cyclicity of units place digit is 4 (Units place digit is 2, from the above table we
can see the cyclicity of 2 is 4). Hence case 1 is applicable.

2. Now we have to find the remainder when exponent of 2 is divided by 4, that is the
remainder when 4344 is divided by 4.

3. Remainder of 4344/4 = Remainder of (44 – 1)44/4

4. Using the binomial theorem, (as explained in number system tutorial) we can see that
there is only one term in the expansion of (44 – 1)44 which is not divisible by 4.

5. The term is 144/4

6. Remainder of 144/4 = 1

7. Now we can apply the general rules of cyclicity, (since reminder is 1, case 2 of
general rule of cyclicity is applicable) which says, units place of 24344 = units place of
21 = 2.

Example 2:

Find the units place digit of 293945

1. Here cyclicity of units place digit of a, that is cyclicity of 9 is 2. Hence case 2 is

applicable

2. Next step is we need to find if 3945 is even or odd

3. 3945 will always result in an odd number, because we are multiplying an odd number
39, odd number of times (45).

4. Now we can apply the general rule of cyclicity described in the first section. General
rule says, first check if exponent is divisible by 4. Since the exponent here is odd,
it's not divisible by 4.

5. Again according to general rule, if exponent is not divisible by 4, find the reminder
when exponent is divided by 4.

6. Since the exponent is odd here, the possible reminders when it's divided by 4 are 1
and 3.

7. This means, the units place digit of number will be 1st or 3rd element in the cyclicity
of units place digit of a.

In this case 1st and 3rd elements of 9 (units place digit of 29) is 9.
Hence units place digit of 2293945 is 9.

Frequently Asked Questions on Cyclicity of Numbers


Find the unit digit of xy

Find the unit digit of xy + ab

Find the unit digit of xy - ab

Find the unit digit of xy * ab

Find the unit digit of xyz

https://www.careerbless.com/qna/discuss.php?questionid=1400

Question

What is the remainder of 1374+143111374+14311

(0) (0) Comment Answer

numbers

3 years ago,

mukesh

<="" ins="" data-adsbygoogle-status="done" style="display: inline-block;

width: 728px; height: 90px;">
1 Answer

See my answer for Q.1234 before reading further. I am providing two

different solutions for this problem. Suggest the students to understand
both the solutions clearly.

Ans: 10.

Solution 1

Remainder of (1374+14311)(1374+14311) = Remainder of ⎡⎢

⎢
⎢
⎢
⎢
⎢⎣remainder of (137411)+remainder of (14311)11⎤⎥
⎥
⎥
⎥
⎥
⎥⎦[remainder of (137411)+remainder of (14311)11] ...(eq 1)

13 = 1×11 + 2
Therefore, remainder of 137411137411 = remainder of 2741127411
(proof of same is provided in the solution given for Q.1234)

Let's take a look at the remainders when powers of 2 are divided by 11.
21 ÷ 11 : remainder = 2
22 ÷ 11 : remainder = 4
23 ÷ 11 : remainder = 8
24 ÷ 11 : remainder = 5
25 ÷ 11 : remainder = 10
26 ÷ 11 : remainder = 9
27 ÷ 11 : remainder = 7
28 ÷ 11 : remainder = 3
29 ÷ 11 : remainder = 6
210 ÷ 11 : remainder = 1
211 ÷ 11 : remainder = 2
212 ÷ 11 : remainder = 4
213 ÷ 11 : remainder = 8
214 ÷ 11 : remainder = 5
...

We can see the pattern is (2,4,8,5,10,9,7,3,6,1) which repeats itself after

every 10 numbers.

Since 74 = 7×10 + 4, remainder of 2741127411 = 5

i.e., Remainder of 137411137411 = 5 ...(R1)

14 = 1×11 + 3
Therefore, remainder of 1431114311 = remainder of 3311=53311=5 ...(R2)

From (eq:1), (R1) and (R2),

Remainder of (1374+14311)(1374+14311)
= Remainder of ⎡⎢
⎢⎣remainder of (137411)+remainder of (14311)11⎤⎥
⎥⎦[remainder of (137411)+remainder of (14311)11]
= Remainder of (5+511)(5+511)
= Remainder of (1011)(1011)
=10

Solution 2

For this problem, we can apply Fermat's Little Theorem and get answer
easily. We will first understand this theorem and go to the solution.

Fermat's Little theorem can be stated in two ways

Statement-1
If pp is a prime number and aa is an integer which is not divisible by pp,
then ap−1≡1(modp)ap−1≡1(modp)

[The above expression means, (ap−1−1)(ap−1−1) is divisible by pp.

Reference: Congruence_relation]

Statement-2
If pp is a prime number and aa is an integer,
then ap≡a(modp)ap≡a(modp)

[i.e., (ap−a)(ap−a) is divisible by pp]

Both these statements are essentially the same. (note: See Euler's Totient
Theorem for a generalization of Fermat's little theorem)

As seen in Statement-1,
13(11−1)≡1(mod11)13(11−1)≡1(mod11)
⇒1310≡1(mod11)⇒1310≡1(mod11)
i.e., if 13101310 is divided by 11, remainder = 1 ...(eq:1)

Remainder of (137411)(137411)
= Remainder of (13(7×10+4)11)(13(7×10+4)11)
= Remainder of (13(7×10)×13411)(13(7×10)×13411)
= Remainder of ⎛⎝(1310)7×13411⎞⎠((1310)7×13411)
= Remainder of (1×13411)(1×13411) (∵ from eq:1, we get, remainder
of ⎛⎝(1310)711⎞⎠=1)((1310)711)=1)
= Remainder of (13411)(13411)
= Remainder of (2411)(2411) (∵ as 13 = 1 × 11 + 2)
= 5 ...(R1)

Remainder of (14311)(14311)
= Remainder of (3311)(3311) ( ∵ 14 = 1 × 11 + 3)
= 5 ...(R2)

From (R1) and (R2),

required remainder = remainder of (5+511)=10

https://mrunal.org/2013/01/aptitude-remainder-one-number-and-two-divisors-number-theory.html

[Aptitude] Remainder: One number and two

divisors (Number Theory)
SubscribeAptitude52 Comments6 years Ago

1. Intro. question
2. DemoQ: 13s

3. Demo Q: 19s

4. DemoQ: 31s (with shortcut)

5. Complex situation: higher number

6. Mock questions

Intro. question
If a number divided by 56, leaves remainder 29. If the same number is divided by 8,
then what will be the remainder? This type of questions is quite common in SSC
exam.

Suppose we divide 9 by 4, then what will be the situation? We know that 4 x 2=8
And 8 +1=9. Therefore,
(4 x 2) + 1 =9. It means “1” is the remainder.
Similarly, if unknown number “N” is divided by 58 and we are getting 29 as
remainder, we can write this as

(56 x q) + 29 = N

Distribute these things into green and red buckets in following manner.

Green Red Total (Green + Red)

56 x q 29 N

Now forget the last column (total N).

Just concentrate on green and red bucket. Assume they’re filled with chocolates.
 There is only one rule:
Whatever number of chocolates can be perfectly divided by 8, must stay in green bucket.
Everything else goes in red bucket.
First check the green bucket itself.
Divide 56 x q by 8.
We know that 56 = 8 x 7. Therefore 56 x q will always be divisible by 8.

Green Red Total (Green + Red)

8x7xq 29 N

Perfectly divisible by 8

How about red bucket: 29 chocolates? Divide them with 8 you get
29 = (8 x 3) + Remainder 5
So shift (8 x 3) number of chocolates from red bucket to green bucket.

Green Red Total (Gr

8x7xq+8x3 5 N

Perfectly divisible by 8 This is our remainder!

We are left with only 5 chocolates in red bucket. Therefore final answer= 5.

DemoQ: 13s
Q. A number when divided by 65 gives the remainder of 43. If this same number is
divided by 13, what’ll be the remainder?

Ans. if an unknown number “N” is divided by 65 and we are getting 43 as remainder, we can
write it as (65 x q)+ 43=N
again, Visualize there are two buckets: green bucket and red bucket.

Green Red Total (Green + Red)

65xq 43 N

There is only one rule: Whatever number of chocolates are perfectly divisible by 8, must stay
in green bucket. Everything else goes in red bucket.
But I know that 65=13 x 5

Green Red

13 x 5 x q 43

Perfectly Divisible by 13 Yet to check

Now check the red bucket. Divide it with 13

but 43= (13 x3)+4= (if you’re unsure, just divide 43 by 13 and get the remainder).
it means 13×3 number of chocolates can be shifted from red to green bucket.

Green Red

(13 x 5 x q) + (13 x 3) 4

Divisible by 13 Not divisible by 13.

That’s it. Red bucket is our remainder = “4”.

Let’s try one more
Demo Q: 19s
If a number divided by 114, leaves remainder 21. If the same number is divided by 19, then
the remainder will be
(114 x q) + 21 = unknown number N

Green Red Total (Green + Red)

114 x q 21 N

Divide these buckets with 19. Whatever number of chocolates are perfectly divisible by 19,
must stay in green bucket.
First the green bucket itself.
114 = 19 x 6

Green Red Total (Green + Red)

19 x 6 x q 21 N

Perfectly divisible by 19

How about red bucket: 21 chocolates? Divide them with 19 you get
21 = (19 x 1) + Remainder 2
So shift (19 x 1) number of chocolates from red bucket to green bucket.

Green Red Total (G

19 x 6 x q + 19 x 1 2 N

Perfectly divisible by 19 This is our remainder!

So what’s the “theme/trend/moral” of these type of questions?

You’ve three numbers A > B > C
If A is perfectly divisible by C
Then just divide “B” by C and whether remainder you get, is your answer.

DemoQ: 31s (with shortcut)

A Number divided by 899 leaves remainder of 65. When this number is divided by
31, what will be the remainder?
Arrange A> B> C
899 > 65 > 31
Check: is 899 perfectly divisible by 31? Yes. 31 x 29 =899. (if you’re not comfortable
with such two digit division, go through previous article click me)
Now divide 65 (B) by 31 and whatever remainder you get, is your answer.
65 = (31 x 2) + 3
Therefore, final answer (remainder is 3)
Let’s complicate the situation

Complex situation: higher number

A number when divided by 31, leaves a remainder of 29. Find the remainder when
same number is divided by 62

a. 29
b. 60

c. Either a or b

d. None of above.

We’ll have go back to red bucket, green bucket concept.

Question says A number when divided by 31 gives 29 remainder
Therefore: (31 x q) + 29 = N

Green Red Total (Green + Red)

31 x q 29 N

Now divide both buckets with 62. Whatever if perfectly divisible by 62, must be shifted to
green bucket.
First check the green bucket, is it perfectly divisible by 62?

Green Red To

31 x q 29 N

Can’t say unless we know the value of “q” Not divisible

Two things can happen: either q=1 or q=2,3,…..or some big number.
If q=1

Situation 1: q=1
Green Red Total (Gree

31 x 1 29 N

But this is not divisible by 62! Not divisible

Since 31 is not divisible by 62, it cannot stay in green bucket.

It must be shifted to red bucket.

Green Red Total (Green + Red)

0 29+31=60 N

Not divisible by 62

Thus in first situation (when q=1) we get remainder 60.

Situation#2: q=2
Green Red Total

31 x 2=62 29 N

This is perfectly divisible by 62. Not divisible by 62

In this case, you get remainder =29.

Similarly, in any other situation like q=3 or q=5, 7, 9…you get remainder 29. Note:
you’ll get same remainder 29, if q=0.
Therefore, two remainders are possible: Either 60 or 29

Mock questions
1. If a number divided by 27, leaves remainder 23. If the same number is divided by 9,
then what will be the remainder? This type of questions is quite common in SSC exam.
2. If a number divided by 30, leaves remainder 17. If the same number is divided by 15,
then what will be the remainder? This type of questions is quite common in SSC exam.

3. A number when divided by 551, leaves a remainder of 31. Find the remainder when
same number is divided by 29

4. A number when divided by 9, leaves a remainder of 7. Find the remainder when the
same number is divided by 18

5. A number when divided by 11, leaves a remainder of 5. Find the remainder when the
same number is divided by 33

6. A number when divided by 13, leaves a remainder of 5. Find the remainder when the
same number is divided by 52

7. A number when divided by 28, leaves a remainder of 7. Find the remainder when the
same number is divided by 35.

Answers
Q.No. Answer

1 5

2 2

3 2

4 7 or 16

5 5, 16 or 27

6 5, 18, 31 or 44

7 0, 7, 14, 21 or 28

https://www.hitbullseye.com/Quant/Remainder-Theorem.php

Remainder Theory
In this article, you will learn the basics, tricks and shortcuts to solve
questions on remainders.
Rate Us
 Views:2446

Related: HOME

The basic remainder formula is:

 Dividend = Divisor* Quotient + Remainder

If remainder = 0, then it the number is perfectly divisible by divisor and divisor is

a factor of the number e.g. when 8 divides 40, the remainder is 0, it can be said
that 8 is a factor of 40.

Formulas Based Concepts for Remainder:

 (an + bn) is divisible by (a + b), when n is odd.

 (an - bn) is divisible by (a + b), when n is even.
 (an - bn) is always divisible by (a - b), for every n.

Concept of Negative Remainder:

By definition, remainder cannot be negative. But in certain cases, you can

assume that for your convenience. But a negative remainder in real sense means
that you need to add the divisor in the negative remainder to find the real
remainder.

Cyclicity in Remainders:

Cyclicity is the property of remainders, due to which they start repeating

themselves after a certain point.

Cyclicity Table:

Number Cyclicity

1 1

2 4

3 4

4 2

5 1

6 1

7 4

8 4
 9 2

10 1

Role of Euler’s Number in Remainders:

Euler’s Remainder theorem states that, for co-prime numbers M and N,

Remainder [ME(N) / N] = 1, i.e. number M raised to Euler number of N will leave a
remainder 1 when divided by N. Always check whether the numbers are co-
primes are not as Euler’s theorem is applicable only for co-prime numbers.

Important Points

 The sum of consecutive five whole numbers is always divisible by 5.

 The square of any odd number when divided by 8 will leave 1 as the
remainder.
 The product of any three consecutive natural numbers is divisible by 8.
 The unit digit of the product of any nine consecutive numbers is always
zero.
 For any natural number n, 10n-7 is divisible by 3.
 Any three-digit number having all the digits same will always be divisible
by 37.

https://www.pagalguy.com/articles/cat-2012-quantitative-aptitude-the-cyclicity-of-remainders-2-
13955

CAT 2012 Quantitative Aptitude: The Cyclicity of

Remainders
Posted on April 6, 2012 by Ravi Handa

Editors note: Our oracle on CAT Quantitative Aptitude Ravi Handa is back! But unlike
last years article series which introduced rather advanced quant tricks, the series
running starting now would take it a little easy and try to be useful to those who are
preparing for CAT 2012 and want to strengthen their arsenal with some intermediate
conceptual understanding and shortcuts. Feel free to suggest topics to him and he will
try to respond with the right article on those topics. Meanwhile, you can also go
through his last years article series here.
———
In this post I would like to discuss some of the really fundamental ideas that can be
used to solve questions based on remainders. If you have just started your
preparation for CAT 2012, you might find this article helpful. On the other hand, if
you are looking for some advance stuff, I suggest that you check out some of my
posts from last year on the same topic.
First of all,
Rem = 0 to d-1
What I am trying to say above is that if you divide an by d, the remainder can be any
value from 0 to d-1.
Not only that, if you keep on increasing the value of n, you would notice that the
remainders are cyclical in nature. The pattern of the remainders would repeat. See
this example,
4^1 divided by 9, leaves a remainder of 4.
4^2 divided by 9, leaves a remainder of 7. {Rem(16/9) = 7}
4^3 divided by 9, leaves a remainder of 1. {Rem (64/9) = 1}
4^4 divided by 9, leaves a remainder of 4. {Rem (256/9) = 4}
4^5 divided by 9, leaves a remainder of 4. {Rem (1024/9) = 7}
4^6 divided by 9, leaves a remainder of 4. {Rem (4096/9) = 1}
4^(3k+1) leaves a remainder of 4
4^(3k+2) leaves a remainder of 7
4^3k leaves a remainder of 1
As you can see above, the remainder when 4n is divided by 9 is cyclical in nature. The
remainders obtained are 4,7,1, 4,7,1, 4,7,1 and so on. They will always follow the same
pattern.
Funda 1: an when divided by d, will always give remainders which will have a
pattern and will move in cycles of r such that r is less than or equal to d.
With the help of the above idea, you can solve a large number of remainder
questions. All you need to do is to figure out the cycle or pattern in which the
remainders are moving, and it will lead you to the answer.
Example,
What will be the remainder when 4143 is divided by 9?
Based on the calculations that I did in the beginning of the post, I know that,
Remainders of 4n when divided by 9, move in a cycle of 3.
So, I need to express 143 = 3k + x and that would lead to the answer.
I know that 143 = 141 + 2
(since 141 is divisible by 3)
So, my answer would be the 2nd value in the list, which is 7.
In the questions where you have to find out the remainder of an by d, as a rule you
can follow this process,
Step 1: Find out the cycle of remainders when an is divided by d and make a listof
those values.
Step 2: Find out the cyclicity, say r
Step 3: Find out the remainder when the power is divided by the cyclicity, that
is Rem = p
Step 4: The answer would be the pth value in the list. {If p = 0, it would be the last
value in the list}
Funda 2: While trying to find the cycle or pattern of remainders when an is
divided by d, just multiply the previous remainder with a to get the next value.
If you notice in the example mentioned in the beginning of this post, I have
calculated 45 and 46 and then found out the remainder. As you might have realized
by now that it is a long and tedious process. But the good part is, you can avoid that
tedious process by just multiplying the previous remainder. In that example instead
of calculating 45 and then dividing by 9, I could have just multiplied the previous
remainder, which was 4 with 4 to get 16, which would have directly given me a
remainder of 7.
Confused? Well, let us look at a new example.
Find out the cyclicity of remainders when 3n is divided by 11.
Solution,
Rem = 3
Rem = 3
Rem = Rem = 5
As you can see that till here there is no problem in calculating the remainders.
Rem = 5 * 3 = 15 = 4
{In this case instead of using 34 = 81, I took the previous remainder, which was 5 and
multiplied it with 3 to get 15, which lead to my current remainder = 4}
Rem = 4 * 3 = 11 = 1
{In this case instead of using 35 = 243, I took the previous remainder, which was 4 and
multiplied it with 3 to get 12, which lead to my current remainder = 1}
Rem = 1 * 3 = 3
{In this case instead of using 36 = 729, I took the previous remainder, which was 1 and
multiplied it with 3 to get my current remainder = 3}
As you might have noticed, the remainder 3 repeated itself and so the cycle or
pattern of remainders was -> 3, 9, 5, 4, 1 and the cyclicity was 5.
Let us try and solve a slightly more complicated problem with this idea.
Find out the remainder when 3232^32 is divided by 7.
Rem = Rem
Step 1: Find out the cycle / pattern of remainders when 4n is divided by 7.
Rem = 4
Rem = 2
Rem = 1
So, the cycle/pattern is 4, 2, 1.
Step 2:
The cyclicity is 3.
Step 3:
Rem = Rem = (-1)
32
=1
Step 4:
The answer is the 1
st
value in the list, which is
4.
I hope you found this post useful. Suggestions for future posts are more than
welcome.
Watch the video version of this article below.
Ravi Handa, an alumnus of IIT Kharagpur, has been teaching for CAT and various
other competitive exams for around a decade. He currently runs an online CAT
coaching and CAT Preparation course on his websitehttp://www.handakafunda.com
https://www.examrace.com/Study-Material/Aptitude/Quantitative-Reasoning/Solving-LCM-HCF-
Remainder-Problems.html

Copyright © www.www.examrace.com

Remainder Problems with HCF and LCM Recap Method: Prime Factorization
Divisibility tests Problem Keywords LCM: Minimum number, least amount, smallest
duration etc. HCF: Maximum number, most amount, longest duration etc. HCF
Remainder Problems 4 Types Greatest Number Which Divides X, Y and Z? HCF Type
1 (Simple) Let’s start with a simple example: 12, 18, and 30 Greatest Number
Which Divides X, Y and Z Leaves Same Remainder R (Given)?HCF Type 2 (Same
Remainder- Given) Let’s find a number which divides all 14, 20 and 32 leaving
remainder 2 Greatest Number Which Divides X, Y and Z Leaves Same Remainder R
(Not Given)?HCF Type 3 (Same Remainder- Not Given) Number which divides all 14,
20 and 32 leaving same remainder Greatest Number Which Divides X, Y and Z,
Leaving Remainders a, B and C (Respectively) HCF Type 4 (Different Remainder-
Given) Number which divides 12, 18 and 30 leaving remainder 2, 3 and 0. HCF
Problems – 4 Types Summary Understand and Remember Greatest number which
divides x, y and z = HCF (x, y, z) Greatest number which divides x, y and z and
leaves remainder r = HCF(x - r, y - r, z - r) Greatest number which divides x, y and
z and leaves same remainder = HCF (|�−�|, |�−�|, |�−�|) Greatest number which
divides x, y and z and leaves remainder a, b, c = HCF(x - a, y - b, z - c) LCM
Remainder Problems 4 Types Smallest Number Divisible by X, Y and Z? LCM Type 1
(Simple) Let’s start with a simple example: 6, 9, and 12 Smallest/Largest Number of
N Digits Divisible by X, Y, Z? LCM Type 2 (Multiples of LCM) Smallest/Largest
number of 3 digits divisible by 6, 9, 12 Smallest Number when Divided by X, Y and Z
Leaves Same Remainder R (Given)?LCM Type 3 (Same Remainder) Number divisible
by 6, 9, and 12 leaves remainder 2 Smallest Number when Divided by X, Y and Z
Leaves Remainder a, B, C?LCM Type 4 (Different Remainder) x - a = y - b = z - c =
common difference d Smallest number divided by 2, 3, 4, 5, 6 leaves remainder 1,
2, 3, 4, 5 LCM Problems – 4 Types SummaryUnderstand and Remember Smallest
number divisible by x, y and z = LCM(x, y, z) Smallest number of n digits divisible
by x, y and z = Multiple of LCM(x, y, z) Smallest number when divided by x, y and z
leaves same remainder r = LCM(x, y, z) + r Smallest number when divided by x, y
and z leaves remainder a, b, c x - a = y - b = z - c = common difference d LCM (a,
b, c) - d Variations of LCM (Understand) Smallest/Largest number of n digits when
divided by x, y and z leaves same remainder r = Multiple of LCM(x, y, z) + r
Smallest/Largest number of n digits when divided by x, y and z leaves remainder a,
b, c = Multiple of LCM(x, y, z) – d (x-a = y-b = z-c = common difference d) Example
- 1 Find the greatest number of 5-digits which on being divided by 9, 12, 24 and 45
leaves 3, 6, 18 and 39 as remainders respectively. Example - 2 Find the smallest
number which, on being added 23 to it, is exactly divisible by 32, 36, 48 and 96.
Example – 3 (Advanced) When dividing a number by 12, 15 or 48 there will always
be a remainder of 10. If the number is the least possible, how many divisors does
the number have? Number of divisors of (p, q primes) is Application of Combination
Generalization – Chinese Remainder Theorem Next Class!! Find the smallest number
which when divided by 7, 9, and 11 produces 1, 2, and 3 as reminders 7 – 1 = 6 9 –
2 = 7 11 – 3 = 8 But 7 – 2 × 1 = 5 9 – 2 × 2 = 5 11 – 2 × 3 = 5
Read more at: https://www.examrace.com/Study-Material/Aptitude/Quantitative-
Reasoning/Solving-LCM-HCF-Remainder-Problems.html
Copyright © www.www.examrace.com

https://scoop.eduncle.com/number-system-questions-pdf

http://www.allmathtricks.com/remainder-
theorem-numbers/

Remainder Theorem for Number System |

Remainder Theorem Difficult Examples

Remainder Theorem of Numbers | Remainder Problems

in Aptitude
Contents [hide]
 1 Remainder Theorem of Numbers | Remainder Problems in Aptitude
o 1.1 Remainder Theorem Rule – 1 (Fundamental)
o 1.2 Remainder Theorem Rule – 2 (For long expressions)
o 1.3 Remainder Theorem Rule – 3 (Cancellation rule)
o 1.4 Remainder Theorem Rule – 4 (remainder of a number with power )
 1.4.1 Remainder theorem problems and solutions
Before going to concepts of remainder theorem of numbers, it is better to understand the the
concepts of Divisor, Dividend, Quotient and Remainder

Remainder Theorem Rule – 1 (Fundamental)

Remainder of the expression can be expressed as positive remainders and negative
remainders. Technically both positive and negative remainders are correct.
But remainders by definition are always non-negative. So final answer to be expressed in
positive value only. For simplification of solution take negative remainder and finally it is to be
convert into positive remainders.
Note:
 Add divisor to negative remainder then it will gives positive remainder
 Subtract positive remainder from divisor then it will gives negative remainder

Example – 1 : Find the remainder of the expression of 49 / 9

In this question
Positive remainder = +4
Negative remainder = -5
As per the remainder theorem the final answer is “4 “
Example – 2 : Find the remainder of the expression of 107 / 9

In this question
Positive remainder = +8
Negative remainder = -1
In this expression finding the negative remainder is very easy when compare to positive
remainder.
So take negative remainder “-1″ and add to it divisor ” 9″ then gives final answer = – 1 + 9 = 8

Remainder Theorem Rule – 2 (For long expressions)

The remainder of the expression will be the same as the remainder of the expression

Where
AR is the remainder when “A” is divided by ” N”
BR is the remainder when “B” is divided by ” N”
CR is the remainder when “C” is divided by ” N”
DR is the remainder when “D” is divided by ” N”
Example – 3 : Find the remainder when 47 x 52 is divided by 6

Solution: Here remainder for 47/6 is -1 or 5 and 52/6 is -2 or 4

Case – 1 : -1 x -2 = 2/ 6 remainder = 2

Case – 2 : –1 x 4 = -4 / 6 remainder = – 4 + 6 (add divisor) = 2

Case-3 : 5 x -2 = -10 / 6 remainder = – 4 + 6 (add divisor) = 2

Case – 4 : 5 x 4 = 20 / 6 remainder = 2
As per the reduces the calculation we can choose the option

Remainder Theorem Rule – 3 (Cancellation rule)

For simplification of the expression of the sum, you should try to cancel out parts of
the numerator and denominator as much as you can, then final remainder to be multiplying the
canceled number to get the correct remainder.
Example – 4 : Find the remainder of 54 divided by 4.
= 54/4 = 27 / 2 ( cancel out by 2 of the numerator and denominator )
Then remainder is of the final expression is 1
Final reminder for the given expression is = 1 x 2 = 2

Remainder Theorem Rule – 4 (remainder of a number with power )

There are two rules which are effect in order to deal with large powers

Case – 1 : If we can express the expression in the form , the remainder will become 1
directly.
In this case , there is no matter how large the value of the power “n” is, the remainder is 1.
Example – 5: Find the remainder when (321)5687 is divided by 8
Solution: 321 can be expressed as [(8×40) + 1] so
remainder of the above question is (1)5687 = 1

Case – 2 : If we can express the expression in the form , the remainder will become ( – 1 )n
In this case , if n is even number then remainder will be 1 and if n is odd number then remainder
will be (q-1)
Example – 6 : Find the remainder when (146)56 is divided by 7
Solution: 146 can be expressed as [(7×21) – 1] so
Remainder of the above question is (- 1)56 = 1
Example – 7 : Find the remainder when (269)57587 is divided by 6
Solution: 269 can be expressed as [( 6x 45) – 1] so
Remainder of the above question is (- 1)57587 = – 1 = -1 + 6 = 5

Remainder theorem problems and solutions

Example – 8 : Find the remainder when 73 x 75 x 78 x 57 x 194 is divided by 25

Solution:

=0
Remainder theorem shortcut tricks : If denominator is perfectly divisible by any one number of
given numerator expression values then remainder of the hole expression is Zero.
Example – 9 : Find the remainder when 84 + 98+ 197 + 240 + 140 is divided by 32

Solution:

So remainder of the above expression is 23

Example – 10 : Find the remainder when 1753 X 1749 X 83 X 171 is divided by 17

Solution:
So remainder of the above expression is 8
Example – 11 : Find the remainder when 385 is divided by 6
Solution: Here 6 can be written as 3 x 2 so ( cancel out by 3 of the numerator and denominator )
Remainder is 1
Final remainder of the given question = 1 x 3 = 3
Example – 12 : Find the remainder when 270 is divided by 96
Solution: Here 96 can be written as 25 x 3 so ( cancel out by 25 of the numerator and
denominator )
Remainder is -1 + 3 = 2
Final remainder of the given question = 2 x 25 = 2 x 32 = 64
Example – 13 : Find the remainder when 25102 is divided by 17
Solution: Here 25 / 17 gives remainder is 8 so
Remainder of the sum is 4

https://www.onlinemathlearning.com/remainder-theorem.html

emainder Theorem
Related Topics:
More Lessons for Algebra, Math Worksheets

In this lesson, we will look into the Remainder Theorem.

The following table gives the Remainder Theorem and Factor Theorem. Scroll down
the page for more examples and solutions on how to use the Remainder Theorem
and Factor Theorem.

What is the Remainder Theorem?

Recall that for long division for integers, the dividing process stops when the
remainder is less than the divisor.

dividend = divisor × quotient + remainder

The process is similar for division of polynomials. The dividing stops when
the remainder is less that the degree of the divisor.

The Remainder Theorem states that

If a polynomial f(x) is divided by a linear divisor (x – a), the remainder is f(a)

Hence, when the divisor is linear, the remainder can be found by using the
Remainder Theorem.

How to use the Remainder Theorem?

Example:
Find the remainder when 4x3 – 5x + 1 is divided by

a) x – 2
b) x + 3
c) 2x – 1

Solution:

Let f(x) = 4x3– 5x + 1

a) When f(x) is divided by x – 2, remainder,

R = f(2) = 4(2)3– 5(2) + 1 = 23

b) When f(x) is divided by x + 3, remainder,

R = f(–3) = 4(–3)3– 5(–3) + 1 = –92

c) When f(x) is divided by 2x – 1, remainder,

Example:

The expression 4x2 – px + 7 leaves a remainder of –2 when divided by x – 3.

Find the value of p.

Solution:

Let f(x) = 4x2– px + 7

By the Remainder Theorem,

f(3) = –2

4(3)2– 3p + 7 = –2

p = 15
How to use the Remainder Theorem to find the remainder?
Examples:
Use the Remainder Theorem to find the remainder
1. (3x3 - 2x2 + x - 6) ÷ (x - 4)
2. (-4x3 + 8x2 + 12x + 16) ÷ (x + 2)
3. (x6 + 4x5 + 9x3 - 4x2 + 10) ÷ (x + 1)

 Show Step-by-step Solutions

How to find the remainder in a polynomial division?
Examples:
Find the remainder using the Remainder Theorem
(4x4 + 2x2 + 1) ÷ (x - 3)

 Show Step-by-step Solutions

How to use the remainder and factor theorem in finding the remainders of
polynomial divisions and also the factors of polynomial divisions?

The Remainder Theorem states that if a polynomial f(x) is divided by (x - k) then

the remainder r = f(k). It can assist in factoring more complex polynomial
expressions.
The Factor Theorem states that a polynomial f(x) has a factor (x - k) if and only
f(k) = 0. It is a special case of the Remainder Theorem where the remainder = 0.

 Show Step-by-step Solutions

How to use the Remainder Theorem to test the factor of a polynomial?
Example:
Is x - 3 a factor of 24 - 11x3 + 15x2 + 4x - 12?

 Show Step-by-step Solutions