Remainder Theorem for CAT PDF consists of the remainder theorems useful for CAT and also questions on CAT remainder theorem. The Remainder theorems in CAT consists ofÂ questions on Wilson theorem, Chinese remainder theorem and Fermat’s little theorem.

You can see that many times questions are asked in CAT Previous question papers. Take a free CAT mock test to analyse your preparation level.

Crack CAT in 7 Months – Basics To Advanced Course

**Remainder Theorems:**

You can download the Remainder Theorem for CAT PDF or you can go through the short details below.

**Fermat’s little theorem for CAT**:

Fermatâ€™s theorem is an important remainder theorem which can be used to find the remainder easily.

Fermatâ€™s theorem states that for any integer ‘a’ and prime number ‘p’, ‘(a^p)-a’Â is always divisible by ‘p’.

Download Fermat’s Theorem for CAT PDF

**Euler’s Theorem for CAT:**

Eulerâ€™s theorem is one of the most important remainder theorems.

Eulerâ€™s theorem states that a^[Ã˜(n)]Â (mod n ) = 1 (mod n) if â€˜aâ€™ and â€˜nâ€™ are co-prime to each other.

So, if the given number â€˜aâ€™ and the divisor â€˜nâ€™ are co-prime to each other, we can use Eulerâ€™s theorem.

Download Euler’s Theorem for CAT PDF

Get Complete MBA Test Series @ Rs. 2999

**Chinese remainder theorem for CAT:**

Chinese remainder theorem is useful when the divisor of any number is composite.

Let M be a number which is divided by a divisor N. The theorem states that if N is the divisor which can be expressed as N = a*b where a and b are co-prime

Then,

M mod N = ar_{2}x + br_{1}y

Here r_{1 }= M mod a

And r_{2} = M mod b

Here, ax + by = 1

Thus, we can see that if we are aware of the Chinese remainder theorem then the seemingly difficult questions can be solved with ease. You can practice more such questions from our CAT Online Tests to master the topic.

Download Chinese remainder theorem PDF

You can download the CAT Maths formulas PDF for other Quant formulas for CAT.

**Wilson’s Theorem for CAT:**

According to Wilsonâ€™s theorem for prime number â€˜pâ€™,

[(p-1)! + 1] is divisible by p.

In other words, (p-1)! leaves a remainder of (p-1) when divided by p.

Thus, **(p-1)! mod p = p-1**

Download Wilson Theorem for CAT PDF

Hope you find this Remainder Theorem for CATÂ PDF very useful. Please subscribe to receive all Important CAT materials and PDF’s. whatsapp “CAT” to 7661025559 to join CAT whatsapp group.

[…] Remainder theorem […]

[…] type and classification of numbers, divisibility rules, HCF and LCM, cyclicity and base theorem, remainders and remainder theorems, binomial theorem, the highest power of a number in a […]

[…] Remainder Theorems, […]