Maths By Amiya, Number System 1-30

Answer/Solution
To Get Questions :
www.facebook.com/groups/MBAMathsByAmiya/963003933742254/

If Unable to open, Join FB Group:

www.facebook.com/groups/MBAMathsByAmiya

1. Ans: [d]
2. Sol: [c]
Number be :- abcdea = 100000*a +10*bcde + a = 100001*a +10*bcde
Above number is divisible by 11 only iff bcde is divisible by 11. Range of
bcde is from 0000 to 9999, There are 910 (including 0000) such numbers
which are divisible by 11.
So there are 910 options for bcde and 9 options (1-9) for a
Then total number of such numbers = 910*9 = 8190
3. Sol: [b]
77 is factor of 1001 so change in number will give same effect in change is
remainder. SO Remainder by 77
= (2*123 + 17) mod 77 = 32
4. Sol: [c]
a*b*c/ b*c*d =130/ 65 a/d = 2
d*e*f /c*d*e=250/1000 f/c = 1/4
(a*f)/(c*d) = (a/d)*(f/c) = 1/2= 0.5
5. Sol: [d]
44100 = 2^2 * 3^2 * 5^2 * 7^2
Odd number of factors means number should be perfect square. Among
factors of 44100, there are 4 perfect square of primes.
So we can choose perfect squares from these 4 perfect squares in 2^4 ways
= 16
So required answer = 16
Why 2^4, since all perfect squares of prime has two options either selected
or not selected.

Maths By Amiya, 3E Learning,

www.facebook.com/MathsByAmiya
AMIYA KUMAR

6. Sol: [b]
1*2! +( 2*2! + 3*3! + 4*4!..........+99*99!) = 1*1! + 2*2! + 3*3! +
4*4!..........+99*99! + 1
= (100! -1 ) +1 = 100!
So only 57^2 would divide 100! since others will comes only one times in
100!.
7. Sol: 0 , since when 6 comes 12 times it is divisible by 13 so complete
number would be divisible by 13
8. Ans: 100!+101!+102!+103! = 100!(1+101+101*102+101*102*103)
There are 24 trailing zeros for 100! and 1 in (1+101+101*102+101*102*103)
so total 25 trailing zeros
So total trailing zeros = 25*100 = 2500
9. Sol: 0
676 = 13^2 * 4
12^39 + 14^39 is divisible by 4
12^39 = (13-1)^39 mod 13^2 = 39C38*(13)*(-1^38) + (-1)^39
14^39 = (13+1)^39 mod 13^2 = 39C38*(13)*(1^38) + (1)^39
So, 12^39 + 14^39 mod 13^2 = 39C38*(13)*(-1^38) + (-1)^39 +
39C38*(13)*(1^38) + (1)^39 = 0
So 12^39 + 14^39 mod 13^2*2^2 = 0
10. Sol: [b]
10^165 + 20^165 +30^165 +.........+ 100^165 = 10^65*(1+2+.....+9) +
100^65
= 10^65*(45) + 100^65 so last non zero digit = 5
11. Sol : [c]
Series is sum of all digits from 1-100,
Numbers of 2,3....9 are 20 from 1-100 and there are 21 1s.
So summation of all digits = (1+2+3+......+9)*20 + 1= 901
12. Sol: [c]
Number of 5s in
5
46
10
41
15
36
20
31
25
26
+

26

Maths By Amiya, 3E Learning,

www.facebook.com/MathsByAmiya
AMIYA KUMAR

30
35
40
45
50

21
16
11
06
01

So Total number of 5 = (1+6+11+16+21+26+31+36+41+46) + (1+26) = 262

13. Ans: 1< a^b<infinite
14. Sol: There are 25 primes less than 100 In which
6*n + 1 are 11
6*n - 1 are 12
6*n+2 is 1 (only 2)
6*n+3 is 1 (only 3)
Summation of 3 primes are 0
Case I : (6*n - 1) + (6*n - 1) + 6*n +2
Total ways are : 12C2*1 = 66
Case I : (6*n +2) + (6*n + 1) + (6*n +3 )
Total combinations = 1*11*1 = 11
So required combinations are = 66+11 = 77

15. Ans: 47
Divisor "m" is giving remainder 17 , m>17 => 4*m > 68
Divisor "8*m" is giving remainder 47 = > Divisor "4*m" will give remainder 47
since 4*m > 47.
16. Sol: [b] rest are positive
17. Least number is 34 (easily visible)
So general term = LCM(10,32)*n + 34
It is (n+1)th least number, for least number, n=0, second least n=1 and
so on
So 11th least number = 160*10 + 34
Hence digital sum = 7+7 = 5
18. Ans: k , check qwerty key board
19. Ans: By CRT , Its 1699

Maths By Amiya, 3E Learning,

www.facebook.com/MathsByAmiya
AMIYA KUMAR

20. Sol : 60
Last two digits of (149^124) and (121^47) are 01 and 41 respectively [by
using 1 and 9 as last digit concept or any method you want]
So, last two digits are (121^47) - (149^124) =41 - (......01) = - (.... 01 - 41) =
60
since (121^47) < (149^124)
21. Sol: 8
Let least number be X then general term of N = 7*10*31*m + X
Digital sum is nothing but remainder by 9.
For second least number m=1 . [for least no, m =1]
So, (7*10*31*1 + X) mod 9 = 7
[given] = (7*1*4*1 + X) mod 9 = 8
[converted in to digital sum]
For 74th least, m=73
Hence (7*10*31*73 + X) mod 9 = (7*1*4*1 + X) mod 9 = 8 [converted in to
digital sum]
22. Ans [d]
It is visible that a>b and e>d hence, (a+e)/(b+d) > 1 so [d] None of these
23. Sol: [c]
Check by Numerical Value (Digital Sum). NV of 15262378681 = 4
a. NV of n=122541 = 6 so, that of n^2 = 9
b. NV of n=134541 = 9 so, that of n^2 = 9
c. NV of n=123541 = 7 so, that of n^2 = 4
d. NV of n=123549 = 6 so, that of n^2 = 9
24. Sol: 4
Let least number be X then general term of N = 7*10*31*m + X
Digital sum is nothing but remainder by 9.
For second least number m=1 . [for least no, m =1]
(7*10*31*1 + X) mod 9 = 8
[given] = (7*1*4*1 + X) mod 9 = 8 [converted
in to digital sum]
Then digital sum of X = 7
Now for 6th least No, m =5
(7*10*31*5 + X) mod 9 = (7*10*31*5 + 8) mod 9 = 4
25. Sol: 27
88^2=7744 [How try to think]
A=B=8, C=7 and D=4
A+B+C+D =8+8+7+4 = 27
Maths By Amiya, 3E Learning,

www.facebook.com/MathsByAmiya
AMIYA KUMAR

26. Ans :1 ; Cyclicity of 240 = 4 hence 37^(4*n+1) mod 240 = 37

Check : https://www.facebook.com/photo.php?fbid=559058130812974
27. Sol: [c] 1028
Since 17 = 2^4 + 1 so max value of p = 1024 +4 =1028
Check : https://www.facebook.com/photo.php?fbid=587854111266709
28. Sol: 0
Every Prime P = (-P)*(1)*(-1) summation of all P + (-P) + (1) +(-1) =0
29. Sol: [d]
a=b=c , then a+b+c is multiple of 3
30. Sol: [d]
Factors of 153 = 3^2*17
17^1000 mod 9 = 8
17^1000 mod 17 = 0
So, 17^1000 mod 153 = 17*8=136

To get more questions follow

www.facebook.com/MathsByAmiya
& JOIN

www.facebook.com/groups/MBAMathsByAmiya/
To Follow Amiya :
https://www.facebook.com/kumar.amiya
http://in.linkedin.com/in/kumaramiya

Maths By Amiya, 3E Learning,

www.facebook.com/MathsByAmiya
AMIYA KUMAR