# Remainders (Quantitative Aptitude) for CAT Exam Preparation – Free PDF for Download

Wednesday, July 31st, 2019 Remainders, as a topic, confuses a lot of students. As a matter of fact, a large percentage of CAT quantitative Aptitude questions and doubts on any public forum (Pagalguy / Quora / Facebook) will be dealing with remainders. This is true for the Course Feed of my online CAT coaching course as well. So, I decided to combine all the various kinds of Remainder related questions and make a single post about it. I hope that if you go through the 50+ questions given in this post, you will never struggle with remainders again.

In case you have any doubts with any of the questions, use the comments section given below.

## Basic Divisibility Rules

1) How do I find the remainder when 12345678910…99100 is divided by 16?

Ans: The divisibility test of 2^n is that you need to check the last ‘n’ digits of the number.

= To find out the remainder from 16, you need to check the last 4 digits

= Rem [12345….99100 / 16] = Rem [9100/16] = 12

2) Quantitative Aptitude: What is the remainder when (111…) + (222…) + (333…) + … + (777…) is divided by 37?

Ans: aaa = a*111 = a*3*37

= aaa is divisible by 37

= aaaa….. repeated 3n number of times is divisible by 37

= (1111…..1) 108 times is divisible by 37

Now, 1111…111 (110 times) = 111…..1100 (108 1s and 2 0s)+ 11

= Rem [1111…111 (110 times) /37] = 11

= Rem [2222…222 (110 times) /37] = 22

.

.

= Rem [7777…777 (110 times) /37] = 77

So, we can say that

Remainder when (111…) + (222…) + (333…) + … + (777…) is divided by 37

= Rem [11 + 22 + 33 + 44 + 55 + 66 + 77 / 37]

= Rem [308/37]

= 12

3) What is the remainder when 123456789101112131415161718192021222324252
627282930313233343536373839404142434481 is divided by 45?

Ans: We need to find out Rem [1234…..434481/45]

This  looks a little difficult if you do not any theorems for finding out  remainders. Let us take a simpler approach and break down the problem  into smaller parts.

These type of questions become really simple if you understand the concept of negative remainders. Always try and reduce the dividend to 1 or -1.

45 = 9*5

Let us find out the remainders separately and combine them later

Rem [1234…..434481/9]

The divisibility test of 9 is to divide the sum of the digits by 9.

The sum in this case is 1 + 2 + 3 … 43 + 44 + 81 = 44*45 + 81

We can see that this is divisible by 9

= The number is divisible by 9

= Rem [1234…..434481/9] = 0

Rem [1234…..434481/5] = 1 (It only depends on the last digit)

So, our answer is a number which leaves a remainder of 1 when divided by 5 and is divisible by 9.

Consider multiple of 9,

9, does not leave a remainder of 1 from 5. Invalid.

18, does not leave a remainder of 1 from 5. Invalid.

27, does not leave a remainder of 1 from 5. Invalid.

36, leaves a remainder of 1 from 5. Valid. (This is our answer)

4) What is the remainder when 123456………….4647484950 is divided by 16?

Ans: To find out the remainder from 2^n, we just need to look at the last ‘n’ digits.

= Rem [123…484950 / 16]

= Rem [4950/16]

= 6

5) What is the remainder when 1! + 2! + 3! … 100! is divided by 18?

Ans: We have to find out Remainder of  when divided by 18.

= Rem [(1! + 2! + 3! … 100!)/18]

6! is divisible by 18

7! is divisible by 18

.

.

100! is divisible by 18

= We have to find out Rem[(1! + 2! +  3! + 4! + 5!)/18]

= Rem [ (1 + 2 + 6 + 24 + 120)/18]

= Rem [153/18] = 9

6) What is the remainder when the infinite sum (1!)² + (2!)² + (3!)² + ··· is divided by 1152?

Ans: We have to find out the remainder when (1!)² + (2!)² + (3!)² + ··· is divided by 1152

1152 = 2^7 * 3^2

= (6!)^2 is divisible by 1152

= All (n!)^2 are divisible by 1152 as long as n > 5

So, our problem is now reduced to

Rem [((1!)² + (2!)² + (3!)² + (4!)² + (5!)²)/1152]

= Rem[(1 + 4 + 36 +576 + 14400) / 1152]

= Rem [15017/1152]

= 41

7) What is the remainder when 3^21 + 9^21 + 27^21 + 81^21 is divided by (3^20+1)?

Ans: 3^21 + 9^21 + 27^21 + 81^21

= 3^21 + (3^21)^2 + (3^21)^3 + (3^21)^4

= x + x^2 + x^3 + x^4

where x = 3^21

Now, 3^21 = 3(3^20) = 3(3^20 + 1) – 3

= Rem [3^21 / (3^20+1)] = -3

= Rem [x / (3^20 + 1)] = -3

We can use this to find out out answer

Rem [(x + x^2 + x^3 + x^4) / (3^20 + 1) ] = (-3) + (-3)^2 + (-3)^3 + (-3)^4

= -3 + 9 – 27 + 81 = 60

8) What is the remainder when 2222…..300 times is divided by 999?

Ans: To check divisibility by 999, check the sum of the digits taken 3 at a time

Sum of the digits of 222…. 300 times (taken 3 at a time)

= 222 + 222 + 222…. 100 times

= 22200

Rem [22000/999] = 222

## Binomial Theorem

1) Remainder when 25^10 is divided by 576?
Ans: We need to find out the remainder of 25^10 when divided by 576.
Please note that 576 = 24^2
There are couple of methods of solving this.

Using Binomial Theorem

25^10 = (24 + 1)^10
In the expansion, there will be 11 terms where the powers of 24 will vary from 0 to 10.
If the power of 24 is greater than or equal to 2 in a term, that term will be divisible by 576
The terms that will not be divisible by 576 are the terms that have powers of 24 as 0 or 1.
Those terms are
10C1*24^1*1^9 + 10C0*24^0*1^10
= 10*24*1 + 1*1*1
= 241

So, Rem [25^10/576] = 241

## Simplifying the dividend (Direct)

1) What will be the remainder when (16^27+37) is divided by 17?

Ans: Rem [(16^27+37)/17]

= Rem [16^27/17] + Rem [37/17]

= Rem [(-1)^27/17] + 3

= -1 + 3

= 2

2) What is the remainder when 17^200 is divided by 18?

Ans: These type of questions become really simple if you understand the concept of negative remainders. Always try and reduce the dividend to 1 or -1.

= Rem [17^200 / 18]

= Rem [ (-1)^200 / 18]

= Rem [1 / 18]

= 1

3) What is the remainder when (71^71+71) is divided by 72?

Ans: Rem [(71^71 + 71)/72]

= Rem [71^71/72] + Rem [71/72]

= Rem [(-1)^72] + (-1)

= (-1) + (-1)

= -2

= 70

4) What is the remainder when 7^2015 is divided by 9?

Ans: Rem [7^2015 / 9]

= Rem [(-2)^2015 / 9]

= Rem [ 4*(-2)^2013 / 9]

= Rem [ 4*(-8)^671 / 9]

= Rem [ 4*1 / 9]

= 4

5) What is the remainder when 2014^2015 is divided by 9?

Ans: Rem [2014^2015 / 9]

= Rem [(-2)^2015 / 9]

= Rem [ 4*(-2)^2013 / 9]

= Rem [ 4*(-8)^671 / 9]

= Rem [ 4*1 / 9]

= 4

6) What is the remainder when 19^98 is divided by 7?

Ans: Rem [19^98/7]

= Rem [(-2)^98/7]

= Rem [2^98/7]

= Rem [ 2^96 * 2^2 / 7]

= Rem [ 8^32 * 4 / 7]

= Rem [1 * 4 / 7]

= 4

7) What is the remainder when 2^33 is divided by 27?

Ans: Rem [2^33/27]

= Rem [32^6 * 8 / 27]

= Rem [5^6 * 8 / 27]

= Rem [ 125^2 * 8 / 27]

= Rem [ (-10)^2 * 8 / 27]

= Rem [800/27]

= 17

8) What is the remainder when 2^2003 is divided by 17?

Ans: Rem [2^2003 / 17]

= Rem [2^2000 * 8 /17]

= Rem [16^500 * 8 / 17]

= Rem [(-1)^500 * 8 / 17]

= Rem [ 1*8/17]

= 8

9) What is the remainder when 7^121 is divided by 17?

Ans: Rem [7^121 / 17]

= Rem [7^120 * 7 / 17]

= Rem [49^60 * 7 / 17]

= Rem [(-2)^60 * 7 / 17]

= Rem [ 16^15 * 7 /17]

= Rem [ (-1)^15 * 7 / 17]

= Rem [ (-7) / 17]

= 10

10) How will you find the remainder when 15^2010 +16^2011   is divided by 7 ?

Ans: Here we need to know that:

Rem[(a + b)/c] = Rem[a/c] + Rem[b/c]

Rem[(a*b)/c] = Rem[a/c] * Rem[b/c]

Keeping that in mind:

Rem[15^2010/7] = Rem[1^2010/7] = 1

Rem[16^2011/7]

= Rem[2^2011/7]

= Rem[2^2010/7]*Rem[2/7]

= Rem[8^670/7] * 2

= 1*2 = 2

Rem[(15^2010 + 16^2011)/7] = 1 + 2 = 3

11) What is the remainder when 30^40 is divided by 7?

Ans: Rem [30^40 / 7]

= Rem[2^40 / 7]

= Rem[2^39 * 2 / 7]

= Rem[8^13 * 2 / 7]

= Rem[1^13 * 2 / 7]

= Rem[1*2 / 7]

= 2

12) What is the remainder when 30^100 is divided by 17?

Ans: Rem [30^100 / 17]

= Rem[(-4)^100 / 17]

= Rem[16^50/ 17]

= Rem[(-1)^50 / 17]

= Rem[1^50 / 17]

= 1

13) How do you find the remainder of 54^124 divided by 17?

Ans: Rem [54^124 / 17]

= Rem[(3)^124 / 17]

= Rem[81^31 / 17]

= Rem[(-4)^31 / 17]

= Rem[(-4)^30 * (-4) / 17]

= Rem[(16)^15 * (-4) / 17]

= Rem[(-1)^15 * (-4) / 17]

= Rem[(-1) * (-4) / 17]

= 4

14) How do you find the remainder of 21^875 divided by 17?

Ans: Rem [21^875 / 17]

= Rem [4^875 / 17]

= Rem[4*4^874 / 17]

= Rem [4* 16^437 / 17]

= Rem [4*(-1)^437 / 17]

= Rem [4*(-1) / 17]

= Rem [-4 / 17]

= 13

## Simplifying the dividend (Multiple divisors)

1) What is the remainder when 15^40 divided by 1309?

Ans: We have to find out Rem [15^40/1309]

This  looks a little  difficult if you do not any theorems for finding out  remainders. Let us  take a simpler approach and break down the problem  into smaller parts.

These type of questions become really simple if you understand the concept of negative remainders. Always try and reduce the dividend to 1 or -1.

1309 =  7*11*17

Let us find out Rem[15^40/7], Rem[15^40/11] , and Rem[15^40/17]

We will combine them later.

Rem[15^40/7]

= Rem [1^40/7]

= 1

Rem[15^40/11]

= Rem [4^40/11]

= Rem [256^10/11]

= Rem [3^10/11]

= Rem [243^2/11]

= Rem [1^2/11]

= 1

Rem[15^40/17]

= Rem [(-2)^40/17]

= Rem [16^10/17]

= Rem [(-1)^10/17]

= 1

So, our answer is a number which leaves a remainder of 1 when divided by 7, 11, and 17

Such a number is 1 itself and that is our answer.

2) What is the remainder of (2^(90)) /91?

Ans: We have to find out Rem [2^90/91]

This looks a little difficult if you do not any theorems for finding out remainders. Let us take a simpler approach and break down the problem into smaller parts.

These type of questions become really simple if you understand the concept of negative remainders. Always try and reduce the dividend to 1 or -1.

91 =  7*13

Let us find out Rem[2^90/7] and Rem[2^90/13]

We will combine them later.

Rem [2^90/7]

= Rem [ (2^3)^30 / 7]

= Rem [ 8^30 / 7]

= Rem [1^30 / 7]

= 1

Rem [2^90/13]

= Rem [ (2^6)^15 / 13]

= Rem [ 64^15 / 13]

= Rem [ (-1)^15 / 13]

= -1 from 13

= 12

So, our answer is a number which leaves a remainder of 1 when divided by 7 and it should leave a remainder of 12 when divided by 13.

Let us start considering all numbers that leave a remainder of 12 when divided by 13

= 12 (leaves a remainder of 5 from 7. Invalid)

= 25 (leaves a remainder of 4 from 7. Invalid)

= 38 (leaves a remainder of 3 from 7. Invalid)

= 51 (leaves a remainder of 2 from 7. Invalid)

= 64 (leaves a remainder of 1 from 7. Valid. This is our answer)

3) What is the remainder when 128^1000 is divided by 153?

Ans: We have to find out Rem [128^1000/153]

This looks a little  difficult if you do not any theorems for finding out remainders. Let us  take a simpler approach and break down the problem into smaller parts.

These type of questions become really simple if you understand the concept of negative remainders. Always try and reduce the dividend to 1 or -1.

153 =  9*17

128^1000 = 2^7000

Let us find out Rem[2^7000/9] and Rem[2^7000/17]

We will combine them later.

Rem[2^7000/9]

= Rem [ 2^6999 x 2 / 9]

= Rem [ 8^2333 x 2 / 9]

= Rem [ (-1)^2333 x 2 / 9]

= Rem [ (-1) x 2 / 9]

= – 2 from 9

= 7

Rem[2^7000/17]

= Rem [16^1750 / 17]

= Rem [ (-1)^1750 / 17]

= 1

So, our answer is a number which leaves a remainder of 7 when divided by 9 and it should leave a remainder of 1 when divided by 17.

Let us start considering all numbers that leave a remainder of 1 when divided by 17

= 18 (leaves a remainder of 0 from 9. Invalid)

= 35 (leaves a remainder of 8 from 9. Invalid)

= 52 (leaves a remainder of 7 from 9. Valid. This is our answer)

## Finding Last Two Digits

1) How do you find the remainder when 7^26 is divided by 100?

Ans: Finding out the remainder from 100, is the same as finding out the last two digits of a number

Last two digits of 7^1 are 07
Last two digits of 7^2 are 49
Last two digits of 7^3 are 43
Last two digits of 7^4 are 01

After this, the same pattern will keep on repeating.

So, 7^(4n+1) will end in 07, 7^(4n+2) will end in 49, 7^(4n + 3) will end in 43, and 7^4n will end in 01

7^26 = 7^(4n+2) will end in 49

= Rem [7^26/100] = 49

2) What is the remainder when 787^777 is divided by 100?

Ans: We have to find out the remainder of 787^777 divided by 100

This is the same as finding out the last two digits of 787^777

Last two digits of the answer depend on the last two digits of the base.

=> We need to find out last two digits of 87^777

The key in questions like these is to reduce the number to something ending in 1.

87^777

= 87 * 87^776

= 87 * (..69)^388 {Just looking at last two digits of 87^2}

= 87 * (…61)^194 {Just looking at last two digits of 61^2}

= 87 * (…41) {a number of the format ..a1^..b will end in (a*b)1}

= 67

3) What are the last two digits of 2^1997?

Ans: For finding out the last two digits of an even number raised to a power,  we should first try and reduce the base to a number ending in 24.

After that, we can use the property

Last two digits of 24^Odd = 24

Last two digits of 24^Even = 76

Last two digits of 2^1997

= Last two digits of 2^7 * (2^1990)

= Last two digits of 128 * (1024^199)

= Last two digits of 28*24

= 72

4) What are the last two digits of (2^2012)?

Ans: For  finding out the last two digits of an even number raised to a power,   we should first try and reduce the base to a number ending in 24.

After that, we can use the property

Last two digits of 24^Odd = 24

Last two digits of 24^Even = 76

Last two digits of 2^2012

= Last two digits of 2^2 * (2^2010)

= Last two digits of 4 * (1024^201)

= Last two digits of 4*24

= 96

5) Find the last two digits of 2025^2052+1392^1329?

Ans:    Let us break the problem into two parts.

For the first part :

Last two digits of 2025^2052

= Last two digits of 25^2052

= 25 I{Any power of 25 will have the last two digits as 25}

For the second part:

For  finding out the last two digits of an odd number raised to a power, we  should first try and reduce the base to a number ending in 1.

After that, we can use the property

Last two digits of (…a1)^(…b) will be [Last digit of a*b]1

For  finding out the last two digits of an even number raised to a power,   we should first try and reduce the base to a number ending in 24.

After that, we can use the property

Last two digits of 24^Odd = 24

Last two digits of 24^Even = 76

Let us try and apply these concepts in the given question

1392^1329

= 92^1329

= 4^1329 * 23^1329

= 2^2658 * 23 * 23^1328

= 2^8 * 2^2650 * 23 * (23^4)^332

= 256 * (1024^265) * 23 * (…41)^332

= 56 * 24 * 23 * 81

= 72

So, our overall answer will be the sum of the two parts

= 25 + 72 = 97

6) What are the last two digits of (86789)^41?

Ans: For  finding out the last two digits of an odd number raised to a power, we  should first try and reduce the base to a number ending in 1.

After that, we can use the property

Last two digits of (…a1)^(…b) will be [Last digit of a*b]1

Let us try and apply this concept in the given question

(86789)^41

= 89^41

= 89 * 89^40

= 89 * (..21)^40

= 89 * 01 {Here I have used the concept mentioned above}

= 89

7) What will be the last two digits of (57) ^69?

Ans: For   finding out the last two digits of an odd number raised to a power, we   should first try and reduce the base to a number ending in 1.

After that, we can use the property

Last two digits of (…a1)^(…b) will be [Last digit of a*b]1

Let us try and apply this concept in the given question

Last two digits of 57^69

= Last two digits of 57*(57^2)^34

= Last two digits of 57*(..49)^34

= Last two digits of 57*(..01)^17

= Last two digits of 57*(..01)

= 57

8) What is the remainder when 767^1009 is divided by 25?
Ans: Remainder of a number from 25 will be the same as the remainder of the last two digits of the number from 25.

For finding out the last two digits of an odd number raised to a power, we should first try and reduce the base to a number ending in 1.
After that, we can use the property
Last two digits of (…a1)^(…b) will be [Last digit of a*b]1

Let us try and apply this concept in the given question
Last two digits of 767^1009
= Last two digits of 67^1009
= Last two digits of 67*67^1008
= Last two digits of 67*(67^2)^504
= Last two digits of 67*(..89)^504
= Last two digits of 67*((..89)^2)^252
= Last two digits of 67*(…21)^252
= Last two digts of 67*(…41) {Here I have used the property mentioned above}
= 47

Rem [767^1009 / 25]
= Rem [47/25]
= 22

9) What are the remainders when 2^222 and 11^100 are divided by 25?
Ans: We need to solve two questions here. In both, we need to find out the remainder from 25. Solving both of them would be easier if we just find out the last two digits.

Remainder of the last two digits of a number from 25 will be the same as the remainder of the number from 25.

Rem [2^222 / 25]

Last two digits of 2^222
= Last two digits of 4*2^220
= Last two digits of 4*1024^22
= Last two digits of 4*(…76) {24^Even will always end in 76}
= Last two digits of (…04)
= 04

So, Rem [04 / 25] = 4
= Rem [2^222 / 25] = 4

Rem [11^100 / 25]

Last two digits of 11^100 = 01 {Last two digits of (…a1)^(…b) will be [Last digit of a*b]1}
= Rem [11^100 / 25] = 1

## Fermat’s Theorem

1) What is the remainder when 2^1040 is divided by 131?

Ans: We have to find out Rem [2^1040/131]

As per Fermat’s Theorem, [a^(p-1)/p] = 1 where p is a prime number and HCF(a,p) = 1

Rem [2^130 / 131] = 1

= Rem [(2^130)^8 / 131] = 1

= Rem [2^1040 / 131] = 1

2) What is the remainder when 2^1000 is divided by 59?

Ans: We have to find out Rem [2^1000/59]

As per Fermat’s Theorem, [a^(p-1)/p] = 1 where p is a prime number and HCF(a,p) = 1

Rem [2^58 / 59] = 1

= Rem [(2^58)^17 / 59] = 1

= Rem [2^986 / 59] = 1

Rem [2^1000/59]

= Rem [2^986 x 2^14 / 59]

= Rem [1 x 128 x 128 / 59]

= Rem [1 x 10 x 10 / 59]

= Rem [100/59]

= 41

3) What is the remainder when 2^89 is divided by 89?

Ans: We can use Fermat’s Theorem here which says

Rem [a^(p-1)/p] = 1 where p is a prime number

= Rem [2^88/89] = 1

= Rem [2^89/89] = Rem [2^88/89] * Rem [2/89] = 1*2 = 2

4) What is the remainder of 57^67^77/17 ?

Ans: Rem [57^67^77/ 17] = Rem [6^67^77/17]

Now, by Fermat’s theorem, which states Rem [a^(p-1)/p] = 1, we know

Rem [6^16/17] = 1

The number given to us is 6^67^77

Let us find out Rem[Power / Cyclicity] t0 find out if it 6^(16k+1) or 6^(16k+2). We can just look at it and say that it is not 6^16k

Rem [67^77/16] = Rem [3^77/16] = Rem[(3^76*3^1)/16]

= Rem[((81^19)*3)/16] = Rem [1*3/16] = 3

= The number is of the format 6^(16k + 3)

= Rem [6^67^77 /17] = Rem [6^(16k + 3)/17] = Rem [6^3/17]

= Rem [216/17] = 12

5) What is the remainder when 17^432 is divided by 109?

Ans: We have to find out Rem [17^432 / 109]

As per Fermat’s Theorem, [a^(p-1)/p] = 1 where p is a prime number and HCF(a,p) = 1

Rem [17^108 / 109] = 1

= Rem [(17^108)^4 / 109] = 1

= Rem [17^432 / 109] = 1

6) What is the remainder when 17^325 is divided by 109?

Ans: We have to find out Rem [17^325 / 109]

As per Fermat’s Theorem, [a^(p-1)/p] = 1 where p is a prime number and HCF(a,p) = 1

Rem [17^108 / 109] = 1

= Rem [(17^108)^3 / 109] = 1

= Rem [17^324 / 109] = 1

= Rem [17^324 *17 / 109] = 1*17

= Rem [17^325 / 109] = 17

## Euler’s Theorem

1) What is the remainder of (121) ^(121) divided by 144?

Ans: Euler Totient (144) = 144*(1-1/2)(1-1/3) = 48

By Euler’s Theorem we can say that

Rem[a^48/144] = 1 if a and 144 are coprime to each other

= Rem [a^240/144] = 1

= Rem [11^240/144] = 1

Now, we need to find out Rem [121^121/144]

= Rem [11^242/144]

= Rem [11^240/144]*Rem [11^2/144]

= 1*121

= 121

## Taking values common from Dividend and Divisor

1) What is the remainder when 3^164 is divided by 162?

Ans: To solve this, you need to know that Rem [ka/kb] = k Rem[a/b]

We need to find out

Rem [3^164/162]

= Rem [(3^4 x 3^160) / (3^4 x 2)]

= 3^4 Rem [3^160/2]

= 3^4 Rem [1^160/2]

= 3^4 x 1

= 81

2) What is the remainder when 21! is divided by 361?

Ans: Rem [21!/361]

= Rem [(21*20*19*18!)/361]

Using Rem [ka/kb] = k Rem[a/b]

= 19 Rem [(21*20*18!)/19]

Using Wilson’s Theorem says For a prime number ‘p’ Rem [ (p-1)! / p] = p-1

= 19 Rem [(21*20*18)/19]

= 19 Rem [(2*1*(-1))/19]

= 19*(-2)

= -38

= 323

3) What is the remainder of the value 39 to the power 198 divided by 12? How do I find it?

Ans: Rem [39^198 / 12]

= Rem [3^198 / 12]

= 3* Rem[3^197 / 4]

= 3* Rem[(-1)^197 / 4]

= 3* Rem[-1 / 4]

= 3*3

= 9

4) What is the remainder when 2(8!)-21(6!) divides 14(7!) +14(13!)?
Ans: We need to find out Rem [(14(7!) + 14(13!)) / (2(8!) – 21(6!)) ]
Let us try and simplify the divisor
2(8!) – 21(6!)
= 2*8*7! – 3*7*6!
= 16*7! – 3*7!
= 13*7!

Rem [(14(7!) + 14(13!)) / 13*7! ]
= Rem [14(7!) / 13(7!)] + Rem [14(13!) / 13(7!)]
= 7!*Rem[14/13] + 0
= 7!*1
= 7!

## Pattern Recognition / Cyclicity Method

1) What is the remainder when 7^99 is divided by 2400 and how?

Ans: Let us try doing it by the pattern recognition / cyclicity method. It can be really long if you do not get the pattern quickly. Use other methods like Euler’s Totient if you do not get a pattern quickly.

Rem[7^1 / 2400] = Rem [7 / 2400] =7

Rem[7^2 / 2400] = Rem [49 / 2400] =49

Rem[7^3 / 2400] = Rem [343/ 2400] = 343

Rem[7^4 / 2400] = Rem [2401 / 2400] = 1

After this the same pattern will keep on repeating because you got a 1.

Once we have obtained the cyclicity (number of terms in the pattern), all we need to do is to find out the Remainder of Power when divided by the Cyclicity. Whatever is this remainder, that particular value in the cycle is our answer.

In this case, power is 99 and cyclicity is 4.

Rem [Power / Cyclicity] = Rem [99/4] = 3

= Our answer will be the third value in the cycle = 343

2) What is the remainder when 1! +2*2! +3*3! +4*4! +… +12*12! Is divided by 13?

Ans: The trick in these type of questions is often observing the pattern

1! + 2*2! = 1 + 4 = 5 = 3! – 1

1! + 2*2! + 3*3! = 1 + 4 + 18 = 23 = 4! – 1

1! + 2*2! + 3*3! + 4*4! = 1 + 4 + 18 + 96 = 119 = 5! – 1

1! + 2*2! + 3*3! + 4*4! + 5*5! = 1 + 4 + 18 + 96 + 600 = 719 = 6! – 1

So, we can say

1! +2*2! +3*3! +4*4! +… +12*12! = 13! – 1

= Rem [(1! +2*2! +3*3! +4*4! +… +12*12!) / 13] = -1 = 12

3) How do you find the remainder when 7^26 is divided by 100?

Ans: Finding out the remainder from 100, is the same as finding out the last two digits of a number

Last two digits of 7^1 are 07

Last two digits of 7^2 are 49

Last two digits of 7^3 are 43

Last two digits of 7^4 are 01

After this, the same pattern will keep on repeating.

So, 7^(4n+1) will end in 07, 7^(4n+2) will end in 49, 7^(4n + 3) will end in 43, and 7^4n will end in 01

7^26 = 7^(4n+2) will end in 49

=> Rem [7^26/100] = 49

4) What is the remainder when 34^31^301 is divided by 9?

Ans: Rem [34^31^301 / 9] = Rem [7^31^301 /9]

Now, we need to observe the pattern

7^1 when divided by 9, leaves a remainder of 7

7^2 when divided by 9, leaves a remainder of 4

7^3 when divided by 9, leaves a remainder of 1

And then the same cycle of 7, 4, and 1 will continue.

If a number is of the format of 7^(3k+1), it will leave a remainder of 7

If a number is of the format of 7^(3k+2), it will leave a remainder of 4

If a number is of the format of 7^(3k), it will leave a remainder of 1

The number given to us is 7^31^301

Let us find out Rem[Power / Cyclicity] t0 find out if it 7^(3k+1) or 7^(3k+2). We can just look at it and say that it is not 7^3k

Rem [31^301/3] = Rem [1^301/3] = 1

= The number is of the format 7^(3k + 1)

= Rem [7^31^301 /9] = 7

5) What is the remainder of 30^72^87 when divided by 11?

Ans: Rem [30^72^87 / 11] = Rem [(-3)^72^87 / 11] = Rem [3^72^87 / 11]

Now, we need to observe the pattern

3^1 when divided by 11, leaves a remainder of 3

3^2 when divided by 11, leaves a remainder of 9

3^3 when divided by 11, leaves a remainder of 5

3^4 when divided by 11, leaves a remainder of 4

3^5 when divided by 11, leaves a remainder of 1

And then the same cycle of 3, 9, 5, 4 and 1 will continue.

If a number is of the format of 3^(5k + 1), it will leave a remainder of 3

If a number is of the format of 3^(5k + 2), it will leave a remainder of 9

If a number is of the format of 3^(5k + 3), it will leave a remainder of 5

If a number is of the format of 3^(5k + 4), it will leave a remainder of 4

If a number is of the format of 3^(5k), it will leave a remainder of 1

The number given to us is 3^72^87

Let us find out Rem[Power / Cyclicity] t0 find out if it 3^(5k + what?)

Rem [72^87 / 5]

= Rem [2^87 / 5]

= Rem [2*4^43/5]

= Rem [2*(-1) / 5]

= -2

= 3

= The number is of the format 3^(5k + 3)

= Rem [3^72^87 / 11] = 5

6) What is the remainder of 57^67^77/17 ?

Ans: Rem [57^67^77/ 17] = Rem [6^67^77/17]

Now, by Fermat’s theorem, which states Rem [a^(p-1)/p] = 1, we know

Rem [6^16/17] = 1

The number given to us is 6^67^77

Let us find out Rem[Power / Cyclicity] t0 find out if it 6^(16k+1) or 6^(16k+2). We can just look at it and say that it is not 6^16k

Rem [67^77/16] = Rem [3^77/16] = Rem[(3^76*3^1)/16]

= Rem[((81^19)*3)/16] = Rem [1*3/16] = 3

= The number is of the format 6^(16k + 3)

= Rem [6^67^77 /17] = Rem [6^(16k + 3)/17] = Rem [6^3/17]

= Rem [216/17] = 12

7) What is the remainder when 32^32^32 is divided by 7?

Ans: Rem [32^32^32 / 7] = Rem [4^32^32 /7]

Now, we need to observe the pattern

4^1 when divided by 7, leaves a remainder of 4

4^2 when divided by 7, leaves a remainder of 2

4^3 when divided by 7, leaves a remainder of 1

And then the same cycle of 4, 2, and 1 will continue.

If a number is of the format of 4^(3k+1), it will leave a remainder of 4

If a number is of the format of 4^(3k+2), it will leave a remainder of 2

If a number is of the format of 4^(3k), it will leave a remainder of 1

The number given to us is 4^32^32

Let us find out Rem[Power / Cyclicity] t0 find out if it 4^(3k+1) or 4^(3k+2). We can just look at it and say that it is not 4^3k

Rem [32^32/3] = Rem [(-1)^32/3] = 1

= The number is of the format 4^(3k + 1)

= Rem [4^32^32 /7] = 4

8) What is the remainder when 32^ (32^ (32^…infinite times)) is divided by 9?

Ans: Rem [32^32^32… / 9] = Rem [4^32^32… /9]

Now, we need to observe the pattern

4^1 when divided by 9, leaves a remainder of 4

4^2 when divided by 9, leaves a remainder of 7

4^3 when divided by 9, leaves a remainder of 1

And then the same cycle of 4, 7, and 1 will continue.

If a number is of the format of 4^(3k+1), it will leave a remainder of 4

If a number is of the format of 4^(3k+2), it will leave a remainder of 7

If a number is of the format of 4^(3k), it will leave a remainder of 1

The number given to us is 4^32^32….

Let us find out Rem[Power / Cyclicity] t0 find out if it 4^(3k+1) or 4^(3k+2). We can just look at it and say that it is not 4^3k

Rem [32^32^32…/3] = Rem [(-1)^32^32…/3] = 1

= The number is of the format 4^(3k + 1)

= Rem [4^32^32 /9] = 4

## Wilson’s Theorem

1) What is the remainder when 97! is divided by 101?

Ans: Wilson’s Theorem says For a prime number ‘p’

Rem [ (p-1)! / p] = p-1
This can be extended to say,
Rem [ (p-2)! / p] = 1

Let us use that here. We need to find out Rem [97! / 101] = r

We know from the above theorem,

Rem [99! / 101] = 1

= Rem [99*98*97! / 101] = 1

= Rem [ (-2)*(-3)*r / 101] = 1

= Rem [6r / 101] = 1

= 6r = 101k + 1

We need to think of a value of k, such that 101k + 1 is divisible by 6.

If we put, k = 1, we get 101 + 1 = 102, which is divisible by 6.

= 6r = 102

= r = 17

2) What is the remainder when 21! is divided by 361?

Ans: Rem [21!/361]

= Rem [(21*20*19*18!)/361]

Using Rem [ka/kb] = k Rem[a/b]

= 19 Rem [(21*20*18!)/19]

Using Wilson’s Theorem says For a prime number ‘p’ Rem [ (p-1)! / p] = p-1

= 19 Rem [(21*20*18)/19]

= 19 Rem [(2*1*(-1))/19]

= 19*(-2)

= -38

= 323

3) What is the remainder when 40! is divided by 83?
Using Wilson’s Theorem says For a prime number ‘p’ Rem [ (p-1)! / p] = p-1
=> Rem [82!/83] = 82
=> Rem [1*2*3*….41*42*43*44…..80*81*82 / 83] = 82
=> Rem [1*2*3….41*(-41)*(-40)*(-39)….(-3)*(-2)*(-1) / 83] = 82
=> Rem [ 41!^2 * (-1) / 83 ] = 82
=> Rem [ 41!^2 * 82 / 83 ] = 82
=> Rem [ 41!^2 / 83 ] = 1
=> Rem [ 41! / 83] = 1
=> Rem [ 40!*41 / 83] = 1
=> Rem [ 41x / 83 ] = -82
=> x = -2 = 81

## Other posts related to Quantitative Aptitude – Number Systems

### CAT Questions related to Quantitative Aptitude – Number Systems

All questions from CAT Exam Quantitative Aptitude – Number Systems
Quantitative Aptitude – Number Systems – Q1: If the product of three consecutive positive integers is 15600 then the sum of the squares of these integers is
Quantitative Aptitude – Number Systems – Q2: If a, b, c are three positive integers such that a and b are in the ratio 3 : 4 while b and c are in the ratio 2:1, then which one of the following is a possible value of (a + b + c)?
Quantitative Aptitude – Number Systems – Q3: The numbers 1, 2,…,9 are arranged in a 3 X 3 square grid in such a way that each number occurs once and the entries along each column, each row, and each of the two diagonals add up to the same value.

Use referral code HANDA to get 10% off.

• Daily Live Classes
• Live Tests and Quizzes
• Structured Courses
• Personalized Coaching
• If you Like this post then share it!

### 4 responses to “Remainders (Quantitative Aptitude) for CAT Exam Preparation – Free PDF for Download”

1. Quora says:

If N=2^2+2^3+2^4… 2^100 is divided by 17, what is remainder left?

11 We need to first find out the value of N = 2^2+2^3+2^4… 2^100 We know that sum of a Geometric Progression is given as a(r^n – 1)/(r – 1) In this case, First term = a = 4 Number of terms = n = 99 Common ratio = r = 2 So, N = 4(2^99 – 1)/(2 – 1) = 4…

2. […] Rules for CAT Quantitative Aptitude Preparation Remainders (Quantitative Aptitude) for CAT Exam Preparation – Free PDF for Download Baisc Idea of Remainders Factor Theory How to Find Number of Trailing Zeros in a Factorial or […]

3. amit says:

rem (32^32^32)/7

4. Aman Goswami says:

In example 3, while finding the sum of digits, it is being taken as
1+2+……+9+10+11+…45
but the two digit number in this, for example , 11 should appear as 1+1 and not 11 while finding the sum of all digits of number.

This site uses Akismet to reduce spam. Learn how your comment data is processed.