Professional Documents
Culture Documents
Q2. if in each permutation of the digit 1,2,3,4,5,6 are listed in the increasing order of
magnitude then 289th term will be ?
a. 361452
b. 321546
c. 321456
d. 341256
Q. A opened a restaurant at T mall in Indore by investing rupees 3 crores after few months his
brother B joined him by investing rupees 2 crore. at the end of the year B got rupees 800000 as
his share from total profit of rupees 2600000. after how many months did B joined the business.
a. 6 months
b. 9 months
c. 8 months
d. 4 months
Q. Kimjong Un covers 1/3rd of the journey in 3 hours. Half of remaining distance in four hours and
half in 5 hours. if average speed of Kimjong Un for the entire journey was 54kmph then find the
total distance covered during the journey.
a. 216
b.162
c.548
d.648
Q. If four digit number is made from 1,2,3,4,5,6,7 then what is the probability that the number is
divisible by four ?
a. 11/49
b/ 7/11
c. 2/7
d. 3/14
1.48
2.84
3.96
4.134
N = 99^3 � 36^3 � 63^3
N = 99^3 + (� 36) ^3 + (� 63) ^3
N = 2^2 x 3^7 x 7 x 11
Number of factors of N = (2 + 1) (7 + 1) (1 + 1) (1 + 1) = 96
Q.How many positive divisors does 7^12 + 7^13 + 7^14 + 7^15 have
1.200
2.199
3.195
4.197
7^12 + 7^13 + 7^14 + 7^15 = 7^12 (1 + 7 + 49 + 343)
= 7^12 x 400
Number of factors:
(12 + 1) (4 + 1) (2 + 1) = 195
----------------------------------------------
According to the Wilson�s Theorem, If there is any Prime Number p, (p-1) ! When divided by p will
always yield (p-1) as the remainder
Example:
36! Mod 37 can be expressed as: (37-1)! Mod 37 where p=37. Hence 36! Mod 37 =p-1 = 36
12! Mod 13 = 13-1 = 12
For any prime number p, When (p-2)! Is divided by p , the remainder yield is always equal to 1.
This can be illustrated using a very simple example. Let us take 9! Mod 11
Multiply 10 in both numerator and denominator, hence now we need to find our remainder for 9!*10/
10*11.
9!*10 is nothing but 10!. So, our expression becomes 10!/10*11.
Using Wilson Theorem, we can say (p-1)! Mod p = (p-1) where p is a prime number.
Hence 10! Mod 11 = 10. So now our expression becomes 1*10/10 = 1. Hence the remainder in this case
is always �1�.
--------------------------------------------
Q.How many 2 digit possible numbers are possible if the digits when interchanged, The absolute
difference between the two 2-digit numbers is 63 ?
Hence 9(a-b) = 63
a-b = 7
Possibilities:
A= 8, b=1
A=9, b=2
----------------------------------
The Concept of unit digit of a number is as important as any theory of Permutation Combination.
The application of unit digit is enormous. We can use the concept of unit digit solve sums in
seconds that would have taken us minutes working in the traditional approaches. So today we will
go through all these concepts.
Solution : Find 73 mod 4 (Because cyclicity of 2 = 4) 73mod 4 =1. Hence 2^73 �s unit digit will
be same as 2^1 = 2
Cyclicity of 3 : 3^1 =3; 3^2 = 9; 3^3 = 27 ; 3^4 = 81 ; 3^5= 243 . Hence again, after 4 terms
starting from 1, the unit digit of powers of 3 get repeated. Hence the cycle order for 3 = 4
Cyclicity of 4 : 4^ odd always ends with 4 / 4^even always ends with 6 => Hence the cycle order of
4 = 2
For 5 and 6, 5^a and 6^b : where a and b are positive integers, both will end in 5 and 6
respectively.
Similarly we can find the cyclicity of other numbers
--------------------------
Solution :-
[100/2]+[100/2^2]+[100/2^3]+[100/2^4]+[100/2^5]+[100/2^6]
= 50+25+12+6+3+1
=97.
Solution :-
[200/3]+[200/3^2]+[200/3^3]+[200/3^4]
= 66+22+7+2
=97.
Solution :-
30 = 2 x 3 x 5.
[50/5]+[50/5^2]
= 10+2 = 12.
Q. Find the least number which highest power of 7 is 52.
Solution :-
6+43 < 52
6+46 = 52.
[n/7] = 46
n > 7 x 46.
n > 322.
[n/49] = 6.
n > 49 x 6.
n > 294.
Solution :-
52 = [n / 13] + [n / 13^2]
52 = [ n / 13 ] + [ n / 169 ]
3 + 39 < 52 < 4 + 52
3+49 = 52.
[ n / 13 ] = 49.
n > 13 x 49
n > 637.
[ n / 169 ] = 3
n = 169 x 3
n > 507.
Solution :-
72 = 2^3 x 3^2.
= 50 + 25 + 12 + 6 + 3 + 1
= 97.
= 33 + 11 + 3 + 1
= 48.
24 < 32.
Solution :-
8+4+2+1 = 17.
5+1 = 6.
Factors = (17+1)(6+1)(3+1)(2+1)(1+1)(1+1)(1+1)
= 18 x 7 x 4 x 3 x 2 x 2 x 2
= 126 x 96
= 12096.
-------------------------
#CONCEPT
10 = 2 x 5.
Basic formula
No of zeroes = [ n / 5 ] + [ n / 5^2 ] + [ n / 5^3 ] �
---------------------------
Solution :-
= 50 + 10 + 2
= 62.
Q. Find the no of zeroes at the end of 100 x 99^2 x 98^3 x 97^4 ... 1^100.
Solution :-
= 1! x 2! ... 100!
1! to 4! = 0.
5! to 9! = 1 x 5 = 5.
100! = 24.
Solution :-
= 30 + 6 + 1 = 37.
No of 2�s in 150!
= [150 / 2] + [150 /2^2 ] + [ 150 /2^3 ] + [ 150/2^4 ] + [ 150 / 2^5 ] + [ 150 / 2^6 ] + [150 /
2^7]
= 75 + 37 + 18 + 9 + 4 + 2 + 1
= 146.
= 9 + 1
= 10.
Q. For any value of k, k! has n zeroes at the end and (k+2)! has n+2 zeroes at the end. How many
number of possible values of k if 0 < k < 200.
Solution :-
K+2 = 25n+1.
K+2 = 26,51,76,101,126,151,176,201.
k+2 = 26,51,76,101,151,176,201
k = 24,49,74,99,149,174,199.
Q. k! has n number of zeroes at the end and (k+1)! has (n+3) zeroes at the end.
Solution :-
k+1 = 125,250,375,500,625,750,875,1000.
So k+1 = 125,250,375,500,750,875,1000.
Total values of k = 7.
Solution :-
128! (1 + 129 + 129 x 128 + 129 x 130 x 131 + 129 x 130 x 131 x 132������ + 129 x ���200 )
= 128! ( 130 + 129 x 128 + 129 x 130 x 131 + 129 x 130 x 131 x 132���..)
No of 2�s in 128! = [ 128 / 2 ] + [ 128 / 2^2] + [ 128 / 2^3 ] + [ 128 / 2^4 ] + [128 / 2^5 ] + [
128 / 2^6 ] + [ 128/ 2^7]
= 64 + 32 + 16 + 8 + 4 + 2 + 1
= 127.
---------------------
# CONCEPT
If we have to find first non zero digit from right in any number n!
=>> n = 5 * m + k.
Then 2^m * m! * k! .
--------------------
Solution :-
26 = 5 x 5 + 1.
n = 26, m = 5, k=1.
= 32 x 120 x 1
= 3840.
n = 25 x m + k.
Solution :-
97 = 25 x 3 + 22.
22! = 5 x 4 + 2.
= 16 x 24 x 2
= 2.
97 = 5 x 19 + 2.
19 = 5 x 3 + 4.
Digit = 2^3 x 3! x 4! = 2.
= 8 x 2 x 2
= 2.
Similarly, if n = 125 x m + k.
Solution :-
477 = 125 x 3 + 2.
Another way :-
377 = 25 x 15 + 2.
15! = 3 x 5.
Digit = 2^3 x 3! = 8.