IPMAT
IPMAT PRO 2026
Quantitative Aptitude
Remainder Theorem
Q1 What is the possible value of the remainder Q8 What is the remainder when is divided by
when is divided by 15? 4?
(A) 5 (B) 3 (A) 0 (B) 2
(C) 2 (D) 1 (C) 3 (D) 1
Q2 Find the remainder when is divided Q9 What is the remainder when is divided by
by 11. 3?
(A) 0 (B) 10 (A) 0 (B) 2
(C) 1 (D) 4 (C) 1 (D) 3
Q3 When a number is divided by 7, the remainder Q10 When a positive integer N is divided by 7, the
is 4. When the same number is divided by 9, remainder is 3. When N is divided by 11, the
the remainder is 5. What is the least possible remainder is 5. What is the remainder when N
value of that number? is divided by 77?
(A) 31 (B) 33 (A) 35 (B) 36
(C) 32 (D) 34 (C) 38 (D) 39
Q4 What is the possible value of the remainder Q11 What is the remainder when we divide 490 +
when is divided by is divided by 9? 590 by 41?
(A) 3 (B) 4
(C) 1 (D) 2 Q12 Find the remainder when (1332)612 is divided
by 11.
Q5 What is the possible value of the remainder
(A) 1 (B) 2
when is divided by 4? (C) 3 (D) 5
(A) 1 (B) 4
(C) 3 (D) 0 Q13
when divided by 12
Q6 gives remainder
when divided by 20 gives remainder : (A) 0 (B) 4
(A) 11 (B) 13 (C) 6 (D) 8
(C) 15 (D) 4!
Q14 Find the remainder when (23)117 is divided by
Q7 If , and , then find the remainder 7.
when is divided by . (A) 0 (B) 1
(A) 2 (B) 7 (C) 2 (D) 6
(C) 36 (D) None of these
Q15 What is the remainder when (1!3 + 2!3 + 3!3 +
4!3 + 5!3 + ....... + 25!3) is divided by 1000 ?
Android App | iOS App | PW Website
IPMAT
(A) 0 (B) 5 Q23 Find the remainder when
(C) 49 (D) 112
is divided by 5.
Q16 (A) 4 (B) 2
Find the remainder when is divided by
(C) 1 (D) 0
11.
Q24 The remainder when (1925 + 2725) is divided by
Q17 Find the remainder when (144)1392 is divided
23, is :
by 132.
(A) 1 (B) 12 Q25 Find the remainder when (x73 – 1) is divided by
(C) 130 (D) 131 (x – 1)
Q18 Find the remainder Q26 A number when divided by 6 leaves remainder
when [(1116)1120 + (4449)4440] is divided by 7. 4 whereas when divided by 9 leaves remainder
(A) 3 (B) 4 1. Find the highest such two digit number.
(C) 5 (D) 0 (A) 64 (B) 99
(C) 76 (D) None of these
Q19 What is the remainder when (7111 + 11111) is
divided by 18? Q27 Find the remainder when is divided by
83.
Q20 when divided by
13, leaves remainder. Q28 Find the remainder when 16! is divided by 17.
(A) 9 (B) 11 (A) 0 (B) 1
(C) 2 (D) 1 (C) 15 (D) 16
Q21 (81 × 160 × 122 × 42) when divided by 39 gives Q29 Find the remainder when 16721731592617 is
remainder : divided by 625.
(A) 13 (B) 24 (A) 617 (B) 117
(C) 29 (D) 37 (C) 100 (D) 93
Q22 Q30 What is the remainder when is divided
gives the remainder as:
by 31?
(A) 3 (B) 2
(A) 1 (B) 9
(C) 1 (D) 25
(C) 19 (D) 22
Android App | iOS App | PW Website
IPMAT
Answer Key
Q1 D Q16 10
Q2 C Q17 B
Q3 C Q18 C
Q4 D Q19 0
Q5 C Q20 A
Q6 B Q21 B
Q7 A Q22 C
Q8 D Q23 C
Q9 B Q24 0
Q10 C Q25 0
Q11 0 Q26 D
Q12 A Q27 1
Q13 B Q28 D
Q14 B Q29 B
Q15 C Q30 C
Android App | iOS App | PW Website
IPMAT
Hints & Solutions
Note: scan the QR code to watch video solution
Q1 Text Solution: 1333−1331=2
As per the question we have . So, 1333 leaves a remainder of 2 when divided
It can be also written as by 11.
Now, the problem reduces to finding the
remainder when is divided by 11.
Euler's Theorem states that if a number a and
11 have no common factors (they are
coprime), then:
a10 leaves a remainder of 1 when divided by 11
Here, a=2 and gcd(2,11)=1, so:
210 leaves a remainder of 1 when divided by 11
We can write as,
Video Solution:
Now, leaves a remainder of 1 when
divided by 11.
So,
(210)5 leaves remainder 15=1 when divided by 11
Video Solution:
Q2 Text Solution:
divided by 11 gives Q3 Text Solution:
remainder ) When a number is divided by 7, the
remainder is 4.
So,
When the same number is divided by 9, the
remainder is 5.
divided by 11 gives remainder So,
)
or Remainder We need to find the least possible value of
Alternate solution: that satisfies both of these conditions.
Divide 1333 by 11:
11×121=1331
Android App | iOS App | PW Website
IPMAT
So, we can write and As per the information given in the question,
we have
Therefore, numbers of the form To find the value of the remainder, It can also
are 4, 11, 18, 25, 32, 39, 46, be written as
.....
and, numbers of the form
are 5, 14, 23, 32, 41, 50, 59, .....
We can clearly observe that 32 is the least
possible number which is common in both the
series. Since is always divisible by 4,
hence its remainder will be zero,
Hence, option(C) is correct. So,
Video Solution:
So, remainder will be 4-1 = 3
Video Solution:
Q4 Text Solution:
Now, we can write it as
Q6 Text Solution:
is not the multiple of 20 .
From 5 ! each terms are divisible by 20 .
So,
Hence remainder is 2.
Video Solution:
Video Solution:
Q5 Text Solution:
Android App | iOS App | PW Website
IPMAT
Video Solution:
Q7 Text Solution:
Q9 Text Solution:
So,
Here, N =
or Remainder First of all, we need to find the pattern of
Video Solution: repetition of the remainders:
Q8 Text Solution:
Here, we have N =
First of all, we need to find the pattern of
remainders:
Now, we need to divide 31 by the cyclicity
The remainder (1) tells us which digit in the
pattern to use. The first digit in the pattern (2,
Hence, whatever be the power of 5, the
1) is 2
remainder is always 1.
NOTE: We can also say that as 31 is an ODD
So,
power, the remainder when is divided by 3
will be 2
Method 2:
Hence, the remainder when is divided by 3
We have, N =
is 2
Now,
Android App | iOS App | PW Website
IPMAT
Method 2:
We can also use the concept of negative
remainders
Therefore,
38 mod 77 = 38
Therefore, the remainder when N is divided by
Now, the negative remainder can be written
77 is 38.
as:
Video Solution:
Substituting the values, we get:
Q11 Text Solution:
490 + 590 can be written as (42)45 + (52)45
Hence, the remainder when is divided by 3
= (16)45 + (25)45
is 2
Any number of the form an + bn is a multiple
Video Solution:
of (a + b) whenever n is odd.
So (16)45 + (25)45 is a multiple of 16 + 25 = 41
So, the remainder when we divide (42)45 +
(52)45 by 41 is equal to 0.
Q10 Text Solution:
Video Solution:
From the given information, we can write
N = 7a + 3
N = 11b + 5
Now equating these two equations, we get
Q12 Text Solution:
Now numbers of the form 11b + 2 are: 2, 13,
24, 35, 45, 56, .....
Hence, from these 35 is the smallest number
of the form 7b
Therefore,
Android App | iOS App | PW Website
IPMAT
Video Solution:
Q15 Text Solution:
From 5!3 onwards each term is divisible by
1000.
So, only terms we have to consider are
1!3, 2!3, 3!3, 4!3
Q13 Text Solution:
or
So,
49
Ans. B
Therefore, the remainder is:49
Video Solution:
Video Solution:
Q16 Text Solution:
Q14 Text Solution:
Using –1 remainder rule, we get
Since 23 leaves a remainder of 2 when divided
by 7, we can rewrite this as:
or
Since leaves a remainder of 1 when divided Video Solution:
by 7, we have:
Ans. B
Video Solution:
Q17 Text Solution:
Android App | iOS App | PW Website
IPMAT
We can directly subtract 132 from 144 to get
9
= 12
Ans. A
Video Solution:
Video Solution:
Q18 Text Solution:
Q21 Text Solution:
is same as
and
So, required remainder = 5
(R → Remainder theorem transformation)
Ans. C
Video Solution:
So, remainder = 24
Ans. B
Video Solution:
Q19 Text Solution:
We know that, (an + bn) when divided by (a + b)
leaves remainder 0 (Given n is odd)
So,
Video Solution:
Q22 Text Solution:
Q20 Text Solution: 1+0
1
Ans. C
Android App | iOS App | PW Website
IPMAT
Video Solution:
Video Solution:
Q26 Text Solution:
Let the number be of type 6m + 4 (m ∈ N)
Q23 Text Solution:
Again, when divided by 9 leaves remainder 1
So, 6m + 4 – 1 will be divisible by 9.
Now, or 6m + 3 is divisible by 9.
Thus, m = 1, 4, 7, 10, 13, 16...
Now,
At m = 16, we get
Ans. C 6 x 16 + 4 = 100 which is a three digit number
Video Solution: At m = 13, we get
(6 ´ 13 + 4) = (78 + 4)
= 82 (This will be the highest such two digit
number)
Ans. D
Video Solution:
Q24 Text Solution:
And we know that
(–4)25 + (4)25 = 0
So, remainder = 0
Q27 Text Solution:
Video Solution: We know that,
(P is a prime number, and HCF (A, P) = 1)
So, 1
Video Solution:
Q25 Text Solution:
x-1=0
x=1
Thus putting x = 1 in will give us the
required remainder which will be
1-1
Q28 Text Solution:
=0
When p is a prime number, then
Android App | iOS App | PW Website
IPMAT
Q30 Text Solution:
The divisor is prime, i.e., 31.
So, Also the dividend and divisor are co-prime, i.e.,
22 and 31.
As per Fermat's theorem,
Ans. D
R =1
Video Solution:
So
Q29 Text Solution:
The remainder of any number divided by 625
is the remainder when last 4 digits is divided
by 625.
So, 117
Video Solution:
Ans. B
Video Solution:
Android App | iOS App | PW Website