Remainder Theorem

Remainder Theorem : Calculate Remainder Quest...
Top Posts & Pages

IBPS CWE Clerk-III State Wise Cut
Off: A Compiled List
Calculate Cube Roots in less than

5 seconds!!
Cut off Percentile for MBA

Colleges: Last 3 years Trend
Top MBA Programs in India with

Low Fees Structure
Mock CAT Analysis: Tips from IIM

C Alumnus
Prep Book Of The Week
http://www.careeranna.com/remainder-theorem-c...
Remainder
Theorem :
Calculate
Remainder
Questions
Quickly
Posted by:
Bharadwaj P
July 14,
2013
Tags: Cat Prep,
MBA, Quant
1 of 17
Tuesday 23 September 2014 12:32 PM
Home
MBA
Engineering
Contact Us
Your Opinion Matters !!!

online poll by Opinion Stage
CareerAnna Book Store
Banking
UPSC
Books
Forums
fraction or expression (not

facial) is a very important
step towards cracking CAT.
CAT aspirants have to
confront
Remainder
Theorem in numbers theory
in Quantitative Aptitude and
most of them invariably
stumble without the requisite
preparation.
Cracking number system,
hence, is quintessential to
eventually cracking CAT as
good percentage of the
questions from quant are
supposed to appear from this
chapter (direct or application
based).
Considering that Remainder
Theorem is the corner stone
for most of the concepts to
follow while solving number
system questions, it is
important that you master it.
With good fundamentals and
knowledge of the following
theorems, be assured that
nding the remainder would
be fun.
Career Anna Forum

unitedworld on How To Plan Your
Preparation Right For CAT ?
2 of 17
In this article we shall do a

thorough
review
of
Remainder Theorems and its
concepts.
Home
MBA
Engineering
Banking
UPSC
Books
Forums
Contact Us
Discussions
2 weeks, 3 days ago
Remainder
Gopal on CAT 2014 Related Discussions

2 weeks, 4 days ago
Before dwelling into RT, its

essential to be aware of some
basics about remainder.
Career Anna on CAT 2014 Related

Discussions
2 weeks, 4 days ago
Career Anna on CAT 2014 Related
Discussions
2 weeks, 4 days ago
Consider N = DQ + R, where D
is non-zero, Q and R are
integers and 0 R< D.
In the foregoing equation; N
is dividend, D is divisor, Q is
quotient and R is the
remainder. When R is zero,
we say that the number (N) is
completely divisible by D.
Ground Rules:
The following three ground
rules shall be essential
weapons of your armory
while confronting Remainder
questions in the future.
1. Remainder [(a x b) / c]
= Remainder [a / c] x
Remainder
2. Remainder [(a + b) /
c] = Remainder [a / c]
+ Remainder
3. Remainder [(a b) / c]
= Remainder [a / c]
Remainder
Prime
3 of 17
Home
MBA
Engineering
Banking
UPSC
Books
Forums
Contact Us
Before we get to business end

of this article, its essential
that we talk about prime
numbers
since
all
the
theorems are derived from
prime numbers and its
concepts in some way.
Prime numbers are all those

numbers which are divisible
only by 1 and itself. There are
innite prime numbers and
they do not follow a xed rule
or Pattern of Occurrence. To
this day, mathematicians
have made multiple futile
attempts to arrive at a single
formula to represent all the
prime numbers.
As we go along you will nd
many tit-bits about primes
(Hereinafter referred to as
TB).
Let us start
with
the
Remainder
Theorems
Four important remainders
theorems are:
Eulers theorem
4 of 17
Home
MBA
Engineering
Banking
UPSC
Books
Forums
Contact Us
1)
Eulers
theorem
Eulers theorem states that if

p and n are coprime positive
integers, then > P (n) =
1 (mod n), where n=n
(1-1/a) (1-1/b).
Before we move any further,
let us understand what mod
is. Mod is a way of expressing
remainder of a number when
it is divided by another
number. Here (n) (Eulers
totient) is dened as all
positive integers less than or
equal to n that are coprime to
n. (Co-prime numbers are
those numbers that do not
have any factor in common.)
5 of 17
Home
MBA
Engineering
Banking
UPSC
Books
Forums
Contact Us
-> Thereore, we get 24

x (1-1/2) (1-1/3) = 8
-> which means that
there are 8 numbers co-prime
to 24.
They are 1, 5, 7, 11, 13, 17, 19,
23.
Let us understand
this theorem with
an example:
Q.1) Find the remainder of
(7^100) / 66
AnswerAs you can see, 7 and 66 are
co-prime to each other.
Therefore, 66 = 66 x (1-1/2)
x (1-1/3) x (1-1/11) = 20
So, (7^100) = 1(mod 66)
TB Mathematicians have
been very keen to arrive at a
formula which gives some
prime numbers, Here is one
of them. f (n) = n2- n+1 for n
= 2, 3,.. 40, but f (41) is
composite.
6 of 17
Home
MBA
Engineering
Banking
UPSC
Books
Forums
Contact Us
Fermats theorem is an
extension of Eulers theorem.
If, in the above theorem, n is
a prime number then, pn-1
=1(mod n)
Consider an example;
Q.2) Find remainder of 741 is
divided by 41.
Here, 41 is a prime number.
Therefore, [7 40 x 7 /41] (By
Fermats theorem)
which is equal to 7.
TB Wieferich prime: is a
prime number p such that p2
divides 2p 1 1 relating with
Fermat little theorem,
7 of 17
Home
MBA
Engineering
Banking
UPSC
Books
Forums
Contact Us
divisible by p
3)
Wilson
theorem
Wilsons theorem states that
a number n is prime if and
only if (n-1)! + 1 is divisible
by n
For example
Q.3) Find the remainder
when 30! Is divided by 31.
Here, 31 is a prime number.
From Wilsons theorem, we
have (31-1)! /31 = 1
Hence, 30 is the remainder.
[whenever there is a negative
remainder, subtract it from
the divisor and you get the
remainder]
Let us have a look another
example.
Q.4) Find the remainder
when 29! Is divided by 31.
You can write 29!/31 as
> 30 x 29! / 30 x 31
8 of 17
Home
Contact Us
MBA
Engineering
Banking
UPSC
Books
Forums
Therefore, 30! / 30 x 31 = 1
We have already found from
Wilson theorem 30! /31 is 30.
30 in the denominator
cancels out, hence the
remainder is 1.
From the foregoing examples,
the derivative arrived at from
this theorem is, (P-2)! =
1(mod P)
4)
Chinese
Remainder
Theorem
Lets understand this
theorem with an example:
Q.5) Rahul has certain
number of cricket balls with
him. If he divides them into 4
equal groups, 2 are left over.
If he divides them into 7
If he divides them into 9
What is the smallest number
of cricket balls could Rahul
have?
Let N be the number of
9 of 17
Home
Contact Us
MBA
Engineering
Banking
UPSC
Books
Forums
equation 1
N = 6(mod7) >
equation 2 &
N = 7(mod9) >
equation 3.
From N=2(mod4) we get,
N=4a+2
Substituting this in equation
2, we get the following
equation:
4a + 2 = 6(mod7)
Therefore, 4a = 4(mod7)
Hence, 2 x 4a = 2 x 4(mod7)
This gives us a = 1(mod7)
Hence a = 7b+1.
Plugging this back to N=4a+2,
we get.
N = 28b + 6
Substituting this to equation

2;
28b + 6 = 7(mod9)
28b = 1(mod9)
Therefore, b=1(mod9)
10 of 17
Home
MBA
Engineering
Banking
UPSC
Books
Forums
Contact Us
equation N=28b+6;
N = 28(9c+1) + 6
N = 252c + 34
The smallest positive value of
N is obtained by setting c=0.
It gives us N = 34
TB All prime numbers

greater than 3 can be
expressed as 6K+1 or 6K-1,
this is another important
result. You would be using
this result a lot when it
comes to number system
problems.
Other Useful
Concepts1)
Chicken
McNugget
Theorem
11 of 17
Home
MBA
Engineering
Banking
UPSC
Books
Forums
Contact Us
Yes, these Chicken

McNuggets have a theorem
on their name. What do you
have?
Q.6) In a certain game, the

only points one can score is
either 7or 9. What is the
highest number one cannot
obtain in this game?
This problem involves the
application
of
Chicken
McNugget Theorem.
The
theorem says the largest
residue one can ever obtain
from positive integers p and
q is given by (pq p q).
So the highest number is [(7 x
9) - 7 - 9] = 47.
2) Concept of
Cyclicity
Q.7) If n is a positive integer,
what is the remainder when
[7(8n+3) + 2] is divided by 5?
This problem can be easily
12 of 17
Home
Contact Us
MBA
Engineering
Banking
UPSC
Books
Forums
You should realize that unit

digit of all numbers raised to
powers start repeating itself.
For example, the cyclicity of
7 is 4. This means that the
unit digits repeat after on
every 4th power. See for
yourself below:
71 = 7
75
79=7
=7
42 = 9
76 =
710=9
9
73 = 3
77
711=3
=3
74 = 1
78 =1
In this question, consider

n=1.
You are looking at unit digit
of 7^11 which will be 3 from
concept of cyclicity.
Add two to it.
Therefore, last digit will be 5
for [7(8n+3) + 2]. Hence its
completely divisible by 5.
3) Concept of
negative
13 of 17
Home
MBA
Engineering
Banking
UPSC
Books
Forums
Contact Us
negative; its minimum value

can only be 0.
Consider an example of -30 /
7. Here, remainder is 5.
It would not be (-28 2 / 7),
but [(-35+5)/7]
When you divide, you will get
remainder of -2. Since
remainder can never be
negative, we subtract it from
quotient, here 7 2 = 5.
Negative remainder is useful
when you are trying to solve
a problem with higher power.
Consider an example.
Q.8) Find the remainder for
7^7^7 is divided 32
32 can be factored into 8 and
4,
Therefore, we will divide the
question into two parts:
Remainder [7^7^7/8] x
Remainder [7^7^7/4]
which gives: Remainder [(-1)
^7^7/8] x Remainder
[3^7^7/4] [(-1) raised to odd
power is -1 and raised to even
14 of 17
Home
Contact Us
MBA
Engineering
Banking
UPSC
Books
Forums
Remainder [(-1)/4]. which

gives
-> 7 x 3 = 21
Conclusion
Needless to say that above
discussed concepts are to be
used as a guiding light and
not as a walking stick. With
possibilities galore, one has
to practice these concepts so
as to sharpen the weapon and
make it an essential part of
ones armory.
Try applying these concepts
whenever you come across
Remainder
Theorem
problems. If you do so, you
will save crucial time in any
competitive exam.
Related
Related
Posts
14Books
Comments
August 21, 2013
Zellers Rule: Find the

Day for Any Date
Quickly
May 14, 2013
Permutation &
15 of 17
Home
MBA
Engineering
Banking
UPSC
Books
Forums
Easier Calculations
Contact Us
July 10, 2013
Advanced TSD:
Relative speed,
Streams, Escalators,
Circular Motion
Problems, etc..
August 13, 2013
How to Solve Linear

Equations?
July 10, 2013
Time, Speed and

Distance: Few
shortcuts
May 14, 2013
Strategies to tackle
Quantitative Aptitude
in CAT
Archives
MBA
Books
Institutes
MBA
Exams
Banking
Careers
Engineering
17 18 19 20 21
Campus
UPSC
22 23 24 25 26 27 28
Insights
Fiction
September 2014
M
15 16
29 30
Aug
16 of 17
10 11
12 13 14
Engineering
Govt. Exams
Non Fiction
Exams
Self Help
Insights
Business
GATE
ALL
Home
Contact Us
Banking
Careers
Exams
Insights
MBA
Engineering
Banking
UPSC
Books
Forums
Banking Jobs
Government Jobs
UPSC
Exams
Careers
Insights
17 of 17

Remainder Theorem

Hochgeladen von

Dokumentinformationen

Copyright

Verfügbare Formate

Dieses Dokument teilen

Dokument teilen oder einbetten

Freigabeoptionen

Stufen Sie dieses Dokument als nützlich ein?

Sind diese Inhalte unangemessen?

Copyright:

Verfügbare Formate

Remainder Theorem

Hochgeladen von

Copyright:

Verfügbare Formate

Remainder Theorem : Calculate Remainder Quest...

Top Posts & Pages

Calculate Cube Roots in less than

Cut off Percentile for MBA

Top MBA Programs in India with

Mock CAT Analysis: Tips from IIM

Prep Book Of The Week

Tuesday 23 September 2014 12:32 PM