CAT Remainder Theorem Notes+Questions
CAT Remainder Theorem Notes+Questions
Remainder Theorems
By
CRACKU.IN
Cracku Tip 1 – Fermat's little Theorem
Telegram
Instagram
Download Important Questions & Answers PDF of:
Quantitative Aptitude
All rights reserved. No part of this publication may be reproduced, distributed, or transmitted in any
form or by any means, electronic, mechanical, photocopying, recording or otherwise, or stored in any
retrieval system of any nature without the permission of cracku.in, application for which shall be
made to [email protected]
Question 1
A positive whole number M less than 100 is represented in base 2 notation, base 3 notation, and base 5 notation. It is found that in all
three cases the last digit is 1, while in exactly two out of the three cases the leading digit is 1. Then M equals
A 31
B 63
C 75
D 91
Answer: D
Video Solution
Explanation:
Since in all three cases the last digit is 1, the number should give remainder 1 when divided individually by 2,3,5 . So the no. may be 31
or 91 . Now 31 in base 2,3 and 5 give first digit as 1 in all the 3 cases while 91 gives exactly two out of the three cases the leading digit
as 1. Hence option D.
Question 2
A 4
B 15
C 0
D 18
Answer: C
Video Solution
Explanation:
The remainder when 1523 is divided by 19 equals (−4)23
The remainder when 2323 is divided by 19 equals 423
So, the sum of the two equals (−4)23 + (4)23 = 0
Question 3
A 0
B 1
C 69
D 35
Answer: A
Video Solution
A 10
B 0
C 7
D 1
Answer: D
Video Solution
Explanation:
According to given condiiton we have p = (1 × 1!) + (2 × 2!) + (3 × 3!) + (4 × 4!) + … + (10 × 10!) . So n × n! = [(n + 1) - 1] × n! = (n + 1)! - n!.
So equation becomes p = 2! - 1! + 3! - 2! + 4! - 3! + 5! - 4! +… + 11! - 10!. So p = 11! - 1! = 11! - 1. p + 2 = 11! + 1 .So when it is divided by
11! gives a remainder of 1. Hence, option 4.
Question 5
Let N = 1421 * 1423 * 1425. What is the remainder when N is divided by 12?
A 0
B 9
C 3
D 6
Answer: C
Video Solution
Explanation:
The numbers 1421, 1423 and 1425 when divided by 12 give remainder 5, 7 and 9 respectively.
Question 6
The integers 34041 and 32506 when divided by a three-digit integer n leave the same remainder. What is n?
A 289
B 367
C 453
Answer: D
Video Solution
Explanation:
The difference of the numbers = 34041 - 32506 = 1535
The number that divides both these numbers must be a factor of 1535.
Convert the number 1982 from base 10 to base 12. The result is:
A 1182
B 1912
C 1192
D 1292
Answer: C
Video Solution
Explanation:
Quotient of 1982/12 = 165, remainder = 2
Quotient of 165/12 = 13, remainder = 9
Quotient of 13/12 = 1, remainder = 1
Remainder of 1/12 = 1
So, the required number in base 12 = 1192
Question 8
A 1
B 16
C 14
D None of these
Answer: A
Video Solution
Explanation:
24 = 16 = −1 (mod 17)
So, 2256 = (−1)64 (mod 17)
= 1 (mod 17)
Hence, the answer is 1. Option a).
After the division of a number successively by 3, 4 and 7, the remainders obtained are 2, 1 and 4 respectively. What will be the
remainder if 84 divides the same number?
A 80
B 75
C 41
D 53
Answer: D
Video Solution
Explanation:
Since after division of a number successively by 3, 4 and 7, the remainders obtained are 2, 1 and 4 respectively, the number is of form
((((4*4)+1)*3)+2)k = 53K
Alternative Solution.
Consider only for 3 and 4 and the remainders are 2 and 1 respectively.
So 5 is the first number to satisfy both the conditions. The number will be of the form 12k+5. Put different integral values of k to find
whether it will leave remainder 5 when divided by 7. So the first number to satisfy such condition is 48x4+5= 53
A 0
B 1
C 2
D None of these
Answer: B
Video Solution
Explanation:
260 or 430 when divided by 5
So according to remainder theorem
remainder will be (−1)30 = 1.
Question 11
55n
Find the minimum integral value of n such that the division 124 leaves no remainder.
A 124
B 123
D 62
Answer: A
Video Solution
Explanation:
As 55 and 124 don't have any common factor, and n has to be a minimum integer, Hence, it should be 124 only. So that given equation
won't have a remainder.
Question 12
A certain number, when divided by 899, leaves a remainder 63. Find the remainder when the same number is divided by 29.
A 5
B 4
C 1
D Cannot be determined
Answer: A
Video Solution
Explanation:
Let's say N is our number
N = (899K + 63) or N = ( 29 × 31K) + 63
63
So when it is divided by 29, remainder will be 29 = 5
A is the set of positive integers such that when divided by 2, 3, 4, 5, 6 leaves the remainders 1, 2, 3, 4, 5 respectively. How many
integers between 0 and 100 belong to set A?
A 0
B 1
C 2
D None of these
Answer: B
Video Solution
Explanation:
Let the number 'n' belong to the set A.
Hence, the remainder when n is divided by 2 is 1
The remainder when n is divided by 3 is 2
The remainder when n is divided by 4 is 3
The remainder when n is divided by 5 is 4 and
The remainder when n is divided by 6 is 5
Between numbers 0 and 100, only 59 is of the form above and hence the correct answer is 1
Question 14
A number is formed by writing first 54 natural numbers next to each other as 12345678910111213 ... Find the remainder when this
number is divided by 8.
A 1
B 7
C 2
D 0
Answer: C
Video Solution
Explanation:
For a number to be divisible by 8, last 3 digits must be divisible by 8.
354 mod 8 = 2
Question 15
A 0
B 1
C 49
D 341
Answer: B
Video Solution
Explanation:
73 = 343
784 = (73 )28 = 34328
34328 mod 342 = 128 mod 342 = 1