0
13166

# RRB NTPC Number Systems Questions PDF

Download RRB NTPC Number Systeems Questions and Answers PDF. Top 40 RRB NTPC Maths questions based on asked questions in previous exam papers very important for the Railway NTPC exam.

Question 1: Find the number of odd divisor of 900900.

a) 144

b) 36

c) 216

d) 72

Question 2: What is the total number of even factors of 1143072?

a) 126

b) 105

c) 84

d) 21

Question 3: N = $-(1!)^1+(2!)^2-(3!)^3+(4!)^4-……….-(99!)^{99}+(100!)^{100}$. The digit in the units place of $N^{100}$ will be

Question 4: Find the unit digit of $78^{{79}^{80}}$.

a) 8

b) 4

c) 2

d) 6

e) 0

Question 5: Find the rightmost non-zero digit in 91!.

Question 6: How many factors of 64800 are perfect squares?

Question 7: A 3 digit number becomes a perfect square when divided by 3 and becomes a perfect cube when divided by 2. What is the value of the number?

Question 8: Find the maximum value of x when 1!∗2!∗3!∗………∗20! is completely divisible by $6^x$?

a) 77

b) 75

c) 78

d) 83

Question 9: Sum of all digits of the number $10^{68} – 21$?

Question 10: N is an integer such that $10^8 \leq N \leq 10^9$. If it is known that the sum of the digits of N is 4 then how many values of N are possible?

Question 11: The LCM of $(17)_{n}$ and $(14)_{n}$ is $(330)_{4}$. Their GCD is $(11)_2$. Find n.

Question 12: Two numbers, $297_{B}$ and $792_{B}$ , belong to base B number system. If the first number is a factor of the second number then the value of B is:

a) 11

b) 12

c) 15

d) 17

e) 19

Question 13: If a, b, c and d are four different positive integers selected from 1 to 25, then the highest possible value of ((a + b) + (c +d ))/((a + b) + (c – d)) would be:

a) 47

b) 49

c) 51

d) 96

e) None of the above

Question 14: What is the largest five digit number which is divisible by 16, 28 and 42?

a) 97792

b) 99772

c) 97992

d) 99792

Question 15: A three digit number xyz has ‘4’ factors. Which of the following will be the number of factors of the 6 digit number ‘xyzxyz’?

a) 20

b) 24

c) 32

d) More than one of the above are possible.

Question 16: p and q are positive numbers such that $p^q = q^p$, and $q = 9p$. The value of p is

a) $\sqrt{9}$

b) $\sqrt{9}$

c) $\sqrt{9}$

d) $\sqrt{9}$

e) $\sqrt{9}$

Question 17: The HCF of 2 numbers is 4 and the LCM is 1008. Further, it is known that one of the 2 numbers has an odd number of factors. The largest among the 2 numbers is

a) 144

b) 112

c) 1008

d) Cannot be determined

Question 18: Find the number of zeroes in 53!.

a) 10

b) 12

c) 14

d) 13

Question 19: Mr Surtur lives on a planet Greip, where all the citizens use base ‘n’ (where n>2) for calculations. Surtur once sold his watch for a particular amount (in the local currency), which was a two digit number, but received double the amount because the digits got mistakenly interchanged. For the least possible value of ‘n’, what is the decimal representation of the amount which Surtur should’ve actually received by selling his watch (in the local currency)?

Question 20: A function $F_n$ is defined as $F_n = 11^n + 13^n$. What is the remainder when $F_{105}$ is divided by 144.

a) 72

b) 108

c) 96

d) 120

Question 21: Hardik wrote first 215 natural numbers in base 6. How many times did he write ‘4’?

Question 22: Find the smallest four digit number which when divided by 7, 13 and 23 leaves remainders 4, 10 and 5 respectively.

Question 23: A rod is cut into 3 equal parts. The resulting portions are then cut into 12, 18 and 32 equal parts, respectively. If each of the resulting portions have integer length, the minimum length of the rod is

a) 6912 units

b) 864 units

c) 288 units

d) 240 units

Question 24: In a Green view apartment, the houses of a row are numbered consecutively from 1 to 49. Assuming that there is a value of ‘x’ such that the sum of the numbers of the houses preceding the house numbered ‘x’ is equal to the sum of the numbers of the houses following it. Then what will be the value of ‘x’?

a) 21

b) 30

c) 35

d) 42

Question 25:  ‘n’ is the greatest possible number that leaves the same remainder on dividing 6912 and 9216. How many factors of ‘n’ will become a perfect square or perfect cube on multiplying by 6?

a) 6

b) 7

c) 12

d) 8

Question 26: How many proper fractions $f = \frac{p}{q}$ exist such that $0 < f < 1$ and $p+q=800$. It is known that $p$ and $q$ are relatively prime.

a) 160

b) 200

c) 216

d) 108

Question 27: If the last 6 digits of [(M)! – (N)!] are 999000, which of the following option is not possible for (M) × (M – N)? Both (M) and (N) are positive integers and M > N. (M)! is factorial M.

a) 150

b) 180

c) 200

d) 225

e) 234

Question 28: A is the smallest even natural number such that it is a) 19% less than a natural number
b) 34% greater than another natural number. What is the remainder when A is divided by 17? (Enter -1 if the answer can’t be determined)

Question 29: What is the minimum value of ‘n’ (natural number) for which the remainders obtained when $325^n$ and $326^n$ are divided by 9 equal?

Question 30: The HCF of two numbers (a, b) is 7. How many ordered pairs (a, b) exist such that the a + b = 1540?

Question 31: Kishor intended to multiply a two-digit natural number and a three-digit natural number, but he left out the multiplication sign and simply placed the two-digit number to the left of the three-digit number, thereby forming a five-digit number. This number is exactly nine times the product Kishor would have obtained. What is the sum of the two-digit number and the three-digit number?

a) 126

b) 147

c) 151

d) 159

Question 32: How many factors of the number 24696 are perfect squares?

Question 33: ‘k’ represents the set of natural numbers whose total number of factors are odd. ‘m’ represents the set of all odd natural numbers. How many elements will be there in the set $k\cap m$ if it is known that $0 \leq k \leq 1000$ and $0 \leq m \leq 900$

Question 34: L is a seven digit Integer with a digit sum of $55$, how many values are possible for L?

a) 4005

b) 2747

c) 2447

d) 3003

Question 35: If a number $K$ has $8$ as its Total number of factors, Which of the following cannot be the Total number of factors of $K^2$ ?

a) 27

b) 18

c) 15

d) 21

Question 36: How many factors of 36288 are perfect cubes?

a) 9

b) 4

c) 6

d) 8

Question 37: How many 4 digit numbers have their cubes ending with 44?

a) 180

b) 90

c) 45

d) 120

e) 0

Question 38: X is the smallest number which leaves a remainder of 2 when divided by 7 and a remainder of 1 when divided by 19. What is the remainder when X is divided by 23?

a) 12

b) 9

c) 13

d) 17

Question 39: What will be the number of zeroes in$(2000!)_{34}$. Here 34 is the base in which the number is written.

a) 122

b) 123

c) 124

d) 125

Question 40: Consider the series where $S_n = 200 + n^2$ for all natural numbers $n$. Therefore, $S_1 = 201, S_2 = 204, S_3 = 209$ and so on.
Let $GCD_n$ be the greatest common divisor of $S_n$ and $S_{n+1}$. Then, what is the maximum value of $GCD_n$

We can prime factorise the number in terms of prime numbers.
$900900 = 2^2*3^2*5^2*7*11*13$
We have to find the number odd factors = (1)*(2+1)*(2+1)*(1+1)*(1+1)*(1+1) = 72. Hence, option D is the correct answer.

The given number (1143072) can be factorized in powers of prime numbers as follows:
$1143072=2^5*3^6*7^2$

We can find the number of even factors when we have at least 1 power of 2. Therefore, the number of even factors = 5*(6+1)*(2+1) = 105.

Hence, option B is the correct answer.

$1! = 1, (1!)^1 = 1$
$2! = 2, (2!)^2 = 4$
$3! = 3, (3!)^3 = 216$
$4! = 24, (4!)^4 = 331776$
$5! = 120, (5!)^5$ = term which ends with 0.
Any factorial greater than 5 will have at least 1 zero at the end.
As the last term is $(100!)^{100}$, note that the sum of all the terms after $(4!)^4$ will be positive and ending with 0.
Thus, no number greater than 4 will have any effect on the last digit of N.
Thus, last digit of N = last digit of (-1+4-216+331776) = 3
Thus, the last digit of $N^{100}$ = last digit of $3^{100}$
3 follows a cyclicity of 4 and thus, the last digit of $3^{100}$ will be the same as the last digit of $3^4 = 1$
Hence, 1 is the correct answer.

We have to find out the unit digit of $78^{{79}^{80}}$.
We know that cyclicity of 8 is 4. Hence, we have to figure remainder that the exponent $79^{80}$ leaves when it is divided by 4.
Rem.($\dfrac{79^{80}}{4}$) = Rem.($\dfrac{(80 – 1)^{80}}{4}$) = 1
Hence, we can say that $79^{80}$ is a 4k+1 type number.
Therefore, we can write $78^{{79}^{80}}$ as $78^{4k+1}$.
Thus, the unit digit of $78^{4k+1}$ will be 8. Hence, option A is the correct answer.

We know that the rightmost non-zero in x! where 25 < x < 125 = {$4^a$* [Last non-zero digit of a!]*[Last non-zero digit of b!]} mod 10, when we write x as 25a+b.

Here, 91 can be written as 25*3 + 16, therefore, a = 3, b = 16

$\therefore$ The rightmost non-zero in 91! = {$4^3$*[Last non-zero digit of 3!]*[Last non-zero digit of 16!]} mod 10 … (1)

The rightmost non-zero in x! where 5 < x < 25 = {$2^a$* [Last non-zero digit of a!]*[Last non-zero digit of b!]} mod 10, when we write x as 5a+b.

Here, 16 can be written as 5*3 + 1, therefore, a = 3, b = 1

$\therefore$ The rightmost non-zero in 16! = {$2^3$*[Last non-zero digit of 3!]*[Last non-zero digit of 1!]} mod 10 = {8*6*1} mod 10 = 8 … (2)

Substituting the value of the rightmost non-zero in 16! from equation (2) to equation (1),

$\therefore$ The rightmost non-zero in 91! = {64**} mod 10 = 3072 mod 10 = 2.

We can write ‘64800’ as $2^5 \times 3^4 \times 5^2$
For a number to be a perfect square, all the powers of the prime factors have to be even.
Here, 2 can have its powers as 0,2,4 (3 cases)
3 can have its powers as 0,2,4(3 cases)
5 can have its powers as 0,2(2 cases)
Number of possibilities = 3*3*2 = 18

The 3 digit number should be of the form $2^a 3^b 5^c ….$ and so on.
We can see that the number becomes a perfect square when divided by 3. Therefore, the power of 3 in the number must be one among 1,3 or 5. ($3^7$ is a four digit number).

The number, on division by 2 becomes a perfect cube. Therefore, the power of 2 can be 1,4 or 7.

Since the number becomes a perfect cube and perfect square on division by 3 and 2, the powers of other numbers should be at least 6.

However, terms such as $5^6$ are huge and hence, we can conclude that the number must be composed of powers of 2 and 3.

’a’ can take values 1, 4 or 7 and ‘b’ can take values 1, 3 or 5.
When divided by 2, the remaining term must be a perfect cube. Therefore, the value of $b$ can only be 3.
When divided by 3, the remaining term must be a perfect square. Therefore, the value of $a$ can only be 4.
Therefore, the number is $2^4*3^3$ = $16*27$ = $432$.

Therefore, $432$ is the right answer.

For finding out maximum value of $6^x$.

Since we know that 6 = 2*3 and in any factorial frequency of 2 will be higher as compared to 3. Hence for finding out maximum value of x we have to figure out the maximum power of 3.

Maximum power of 3 in 20!
$\Rightarrow [\frac{20}{3}] + [\frac{20}{3^2}]$ (Where [.] is a greatest integer function.)
$\Rightarrow$ 6 + 2 = 8

This power will remain same for 18! and 19!

For calculating maximum power of 3 in 17! ,16! and 15!
$\Rightarrow [\frac{17}{3}] + [\frac{17}{3^2}]$
$\Rightarrow$ 5 + 1 = 6

Similarly, we will calculate for remaining terms.
Hence, for maximum value of ‘x’ = 8*3 + 6*3 + 5*3 + 4*3 + 2*3 + 1*3 + 0*2 += 78 (Answer :C)

Let us find out the pattern by using small powers.

$\Rightarrow 10^{4} -21 = 9979$

$\Rightarrow 10^{5} -21 = 99979$

$\Rightarrow 10^{6} -21 = 999979$

We can clearly see the pattern

$\Rightarrow 10^{n} -21 = 9999(n-2 times)79$

So $10^68 -21 = 9999(66 times)79$

Hence, sum of all digits = 67*9 + 7 = 610

We have been given that $10^8 \leq N \leq 10^9$. Hence, N must be a 9 digit number. Now, sum of the digits of N is 4. Hence, the possible cases are
(1, 1, 1, 1), (1, 1, 2), (2, 2), (3, 1), (4, 0)
In case I (1, 1, 1, 1)
One of the 1’s will be at first place, the remaining 3 ones can be placed at any of the remaining 8 places. Hence, possible combinations will be 8C3 = 56
In case 2(1, 1, 2)
If the first digit is 1, then the remaining two can be placed in 8 positions in 8c2*2 = 56 ways
If the first digit is 2, then the rest two can be placed in 8c2 = 28 ways.
Hence, total possibilities in second case = 84
Now in case III,
First digit can be 3 or 1. The second digits can be placed n any of the remaining 8 possibilities. Hence, total possibilities = 8*2 = 16
In case IV, there will only 8 possibilities.
In case V, there will be only 1 possibility.
Hence, the required number of ways = 56 + 84 + 16 + 8 + 1 = 165

Given,
LCM = $(330)_{4}$ = $(60)_{10}$

GCD = $(11)_{2}$ = $(3)_{10}$

Product of the numbers = LCM * HCF

$(17)_{n}$ = n + 7

$(14)_{n}$ = n + 4

(n + 4) (n + 7) = 180

$n^2 + 11n – 152 = 0$

(n – 8) (n + 19) = 0

n = 8

In Base B, $297_B = 2B^2 + 9B + 7$

and $792_B = 7B^2 + 9B + 2$

It is given that $297_{B}$ is a factor of $792_{B}$

=> $\frac{7B^2 + 9B + 2}{2B^2 + 9B + 7}$ must be an integer

=> $\frac{(2B^2 + 9B + 7) + (5B^2 – 5)}{2B^2 + 9B + 7}$

=> $\frac{5B^2 – 5}{2B^2 + 9B + 7} + 1 = k$

=> $5B^2 – 5 = (2B^2 + 9B + 7) k$ (where $k$ is factor)

Put $k = 1$

=> $5B^2 – 5 = 2B^2 + 9B + 7$

=> $B^2 – 3B – 4 = 0$

=> $(B – 4) (B + 1) = 0$

=> $B = 4 , -1$

Since, B is a base,so B must be greater than 9. Hence, it is not possible

Put $k = 2$

=> $5B^2 – 5 = 4B^2 + 18B + 14$

=> $B^2 – 18B – 19 = 0$

=> $(B – 19) (B + 1) = 0$

=> $B = 19 , -1$

$\therefore B = 19$

Expression : $\frac{a + b + c + d}{a + b + c – d}$

To maximize the above expression, we have to minimize the denominator

Minimum value of the denominator = 1

So we can make $a + b + c = 26$ and $d = 25$ (as maximizing d will give denominator the least value).

So required maximum value = $\frac{a + b + c + d}{a + b + c – d}$

= $\frac{26 + 25}{26 – 25} = 51$

The LCM of 16 and 28 is 112.
The LCM of 112 and 42 is 336.
Hence, we need to find the largest five digit number which is divisible by 336.
Note that 336*300 = 100800 and hence the largest five digit number which is divisible by 336 is 100800-3*336 = 99792

xyzxyz = xyz*1001
=> xyzxyz = xyz*7*11*13
=> xyz has four factors so, xyz can be of the form $p^3$ where p is a prime number or, xyz can be of the form $a*b$, where a and b are prime numbers.
So in case I, the total number of factors of xyzxyz will be
$(3+1)*(1+1)*(1+1)*(1+1) = 32$, when xyz is not $7^3$
If xyz = $7^3$, then total number of factors of xyzxyz will be given by
5*2*2 = 20.
Thus, in case one the possible values are 20 and 32.
Consider case II, where xyz is a product of two prime numbers.
In case xyz is co-prime to 7, 11 and 13 , the total number of factors of xyzxyz will be
$(1+1)*(1+1)*(1+1)*(1+1)*(1+1) = 32$
We know that xyz = a*b where a and b are distinct primes. Now if one among a or b is equal to 7, 11 or 13, them the number of factors of xyzxyz will be
3*2*2*2 = 24.
In case both ‘a’ and ‘b’ are chosen from 7, 11 and 13, then the number of factors of xyzxyz will be
(2+1)*(2+1)*2 = 18.
Hence, the total possible number of factors of xyzxyz can be 18, 20, 24 or 32.
Hence, the correct answer is option D.

$p^q = q^p$.
It has been given that $q = 9p$.

Substituting, we get,
$p^{9p}=(9p)^p$
$(p^p)^9 = 9^p*p^p$
=> $(p^p)^8 = 9^p$
$p^{8p}=9^p$
Raising the power to $\frac{1}{p}$ on both sides, we get,
$p^8=9$
$p=\sqrt{9}$.
Therefore, option D is the right answer.

We know that the product of 2 numbers = HCF * LCM
Let the 2 numbers be X and Y.
XY = $4*1008$
= $2^4*6^2*7$
We know that one of the numbers has an odd number of factors. Therefore, one of the numbers must be a perfect square.

However, the 2 numbers can be split as $2^2*6^2$ and $2^2*7$ or $2^2$ and $2^2*6^2*7.$
Therefore, we cannot determine the 2 numbers. Option D is the right answer.

The number of zeroes is determined by the maximum power of 2 and 5.
Since the exponent of 2 in 53! Will definitely be greater than that of 5, it is sufficient to find the maximum power of 5 in 53!.

Highest power of 5 in 53! = $[\frac{53}{5}] + [\frac{53}{25}]$ = 10 + 2 = 12

Hence there are 12 zeroes in 53!

The base used by the citizens of Greip is ‘n’.

Let the amount in local currency for which the Surtur sold his watch be $(ab)_{n}$

Decimal representation of this original amount = na + b …(1)

The amount actually received by Surtur in local currency = $(ba)_{n}$

Decimal representation of this amount = nb + a …(2)

We know that Surtur received double the amount because the digits got mistakenly interchanged.

Hence,
nb + a = 2*(na + b)
(n-2)b = (2n – 1)a

We know that n > 2.

Let’s consider that n = 3, we get,
b = 5a

As ‘a’ cannot be equal to 0; minimum value of b will be 5. This is not possible as in base 3 we don’t have digit 5.
Hence, n=3 is not possible.

Let’s consider that n = 4, we get,
2b = 7a

As ‘a’ cannot be equal to 0; minimum value of b will be 7. This is not possible as in base 4 we don’t have digit 7.
Hence, n=4 is not possible.

Let’s consider that n = 5, we get,
3b = 9a
b = 3a

Hence, value of (a,b) satisfying the equation is (1,3)
As, the base is 5, value of (a,b) = (2,6) and onwards is not possible.

Hence, least value of n which satisfies the given condition is 5.
Also, the only value of (a,b) which satisfies is (1,3)

Hence, amount in local currency for which the Surtur sold his watch is = $(13)_{5}$
Decimal representation of this value = 5*1 + 3 = 8

We need to calculate the remainder when $11^{105} + 13^{105}$ is divided by 144.
Note that this equals $(12-1)^{105} + (12+1)^{105}$ being divided by 144.
$(12-1)^{105}=12^{105} – 105\times12^{104}+…+105\times 12 -1$
$(12+1)^{105}=12^{105} + 105\times12^{104}+…+105\times 12 +1$
The even terms of both the expressions cancel each other.
Hence, the only term where the power of $12$ is less than 2 is $105 \times 12 + 105\times 12=210 \times 12 = 2520$
The remainder when this is divided by 144 is 72

215 = $6^{3} – 1$
Thus 215 is the largest 3 digit number in base 6.

Now we consider all the numbers upto greatest ‘n’ digit number in base 6. Then there will be total $n*6^n$ digits in total.

One-sixth of these digits will be digit ‘4’.

Thus the number of 4’s will be $\frac{n*6^n}{6} = n*6^{n-1}$

Here for 215, n=3 as it is the greatest 3 digit number in base 6.

So number of 4’s are $3*6^2$ = 108

Hence 108 is the right answer.

We see that the number when divided by 7 and 13, leaves a remainder of -3 in both cases.

Thus, the number should be of the form 91k – 3.

The number 91k – 3 when divided by 23 leaves a remainder of 5.

Thus 91k – 3 – 5 should be divisible by 23.

$Rem(\frac{91k – 8}{23}) = 0$

$Rem(\frac{92k – k – 8}{23}) = 0$

$Rem(\frac{92k – (k + 8)}{23}) = 0$

Hence,
$Rem(\frac{ k + 8}{23}) = 0$

k = 15 is one such number.
Hence, the required number will be 91k – 3, which is 91*15 – 3 = 1362

The rod is cut into 3 equal parts thus the length of the rod will be a multiple of 3.
Each part is then cut into $12 = 2^2*3$
$18 = 2*3^2$ and $32 = 2^5$ parts and thus, each part of rod has to be a multiple of $2^5*3^2 = 288$
Thus, the rod will be a multiple of $288*3 = 864$
Thus, the minimum length of the rod is 864 units.
Hence, option B is the correct answer.

It is given that sum of the first $(x – 1)$ numbers is equal to sum of the numbers from $(x + 1)$ to 49
or, sum of $(x – 1)$ numbers = sum of first 49 numbers – sum of first $x$ numbers
$\dfrac{x(x – 1)}{2} = \dfrac{49 * 50}{2} – \dfrac{x(x + 1)}{2}$
On solving, we get $x$ = 35
Hence, option C is the correct answer.

Since the number leaves the same remainder on dividing both $6912$ and $7680$, the difference between them must be divisible by the number.
$9216 – 6912 = 2304$
The greatest possible value of ‘n’ is 2304.
$2304 = 9*256$
$= 3^2 * 2^8$
Now, $6$ can be split as $3*2.$
$3^2*2^8, 3^2*2^5, 3^2*2^2$ will become a perfect cube on multiplying by $6.$
$3^1*2^1, 3^1*2^3, 3^1*2^5$ and $3^1*2^7$will become a perfect square on multiplying by $6.$
Hence, there are $7$ factors in total.

As it is given that $f < 1$, we know that $p<q$ and as $p+q=800$, it implies that $400 < q < 800$
Note that $800 = 2^5 \times 5^2$
Hence, $p$ and $q$ will be relatively prime if $q$ is not divisible by either 2 or 5. Note that in this case, even $p$ will not be divisible by $2$ or $5$.

Hence, we need to find the number of numbers between 400 and 800 which are not divisible by 2 and 5.
The total number of numbers between 400 and 800 is 399.
The number of such numbers which are divisible by 2 is 199.
The number of such numbers which are divisible by 5 is 79.
The number of such numbers which are divisible by 10 is 39.
Hence, the required number is 399-199-79+39 = 160.

Let the two natural numbers in the question be $M$ and $N$
Therefore, $M \times \frac{81}{100} = A$
and, $N \times \frac{134}{100} = A$

Or, $M = A \times \frac{100}{81}$ and $N = A \times \frac{50}{67}$

LCM of $67$ and $81$ is 5427.

It is given that $A$ is the smallest even natural number which satisfies the above conditions. Hence, $A$ = 5427 * 2 = 10854

It leaves a remainder of 8 when divided by 17.

The remainder when 325 divided by 9 is “1”.
The remainder when 326 divided by 9 is “2”.
For any value of ‘n’ the remainder when $325^n$ divided by 9 will be 1.
The remainder when $326^n$ divided by 9 should be 1 for to be equal.
326mod9 = 2
The remainder when $326^n$ divided by 9 is equal to the remainder when $2^n$ divided by 9
The least value at which the remainder is 1 is for n = 6.

Let the two numbers be 7m and 7n where m and n are coprime.
So we have
7m + 7n = 1540
=> m + n = 1540/7 = 220
So we have to write 220 as the sum of two co-prime numbers.
Total numbers below 220 which are also co-prime to 220 are given by the euler no. of 220 = $220*\frac{1}{2}*\frac{4}{5}*\frac{10}{11}$ = 80.
For each of these numbers, there will be a corresponding number such that the sum is 220. For example, 3 + 217, 7 + 213, 13 + 207 and so on.
Since the question asks for ordered pairs so both a and b can take 80 values each. Hence the required answer is 80.

Let $x$ be the two-digit number, $y$ be the three-digit number. Putting together the given, we have
$1000x + y = 9xy$
$\Rightarrow$ $9xy – 1000x – y = 0$
$\Rightarrow$ $(9x – 1)(y – \dfrac{1000}{9})$ = $\dfrac{1000}{9}$
$\Rightarrow$ $(9x – 1)(9y – 1000) = 1000$
We know that $x$ is a two digit number hence 89 $\leq$ (9x – 1) $\leq$ 890.
Hence, we have to check the solution for every divisor of 1000 which is greater than 89 and less than 890.
Divisors of 1000, which are greater than 89 and less than 890 = (100, 125, 200, 250, 500)
We can see that only at (9x – 1) = 125, (9y – 1000) = 8
i.e. y = 112 also (9x – 1) = 125, i.e. x = 14
For any other value of (9x – 1) we get non integer values of y which is not possible because y is a three digit number.
Hence, the required sum = x + y = 14 + 112 = 126.
Therefore, option A is the correct answer.

$24696 = 2^3*3^2*7^3$
All factors of 24696 are in the form of $2^a * 3^b * 7^c$
To be a perfect square, a can take values 0,2
b can take values 0,2
c can take values 0,2
Therefore, total number of factors of 24696 which are perfect squares = 2*2*2 = 8

‘k’ represents the set of natural numbers which have odd number of factors. We know that the total number of factors is odd only for perfect squares. Hence ‘k’ is essentially the set of all perfect squares while m is the set of all odd natural numbers.
$0 \leq k \leq 1000$
The number of perfect squares between 1 and 1000 = 31 {Since $32^2 = 1024$
Out of these 31, 15 will be even numbers ($2^2, 4^2, 6^2, 8^2, 10^2 . . . . . . 30^2$)
The remaining 16 will be odd ($1^2, 3^2, 5^2, 7^2, 9^2 . . . . . . .31^2$)
However, we know that $0 \leq m \leq 900$. Hence, $31^2$ will be outside the range of m. Hence $k \cap m$ will only have 15 elements.

let $\textrm{lmnopqr}$ be the number.
Each of the digits can take a value between 0 and 9. So let
l = 9 – a, m = 9 – b, n = 9 – c, o = 9 – d, p = 9 – e, q = 9 – f, r = 9 – g
We have been given that
l + m + n + o + p + q + r = 55
=> 9 – a + 9 – b + 9 – c + 9 – d + 9 – e + 9 – f + 9 – g = 55. (Here, b, c, d, e, f, g are non negative integers less than or equal to 9 and a is a non negative integer less than or equal to 8)
=> a + b + c + d + e + f + g = 8
The, number of non negative solutions for this equation can be obtained by using the formula (n+r-1)C(r-1)
So the required number of solutions would be (8+7-1)C(7-1) = 14C6 = 3003.
Hence $3003$ seven digit numbers are there with a digit sum of 55.

Given that there are 8 factors for $K$. There are 3 different cases in which 8 can be factorized into
Case 1: $(1+1)*(1+1)*(1+1) =8$
When K is squared all its factors are also squared , number of factors of $K^2 = (2+1)(2+1)(2+1) = 27$
Case $2: (1+1)*(3+1) = 8$
Number of factors of $K^2 = (2+1)(6+1) = 21$
Case 3:
$1*(7+1) = 8$
Number of factors of $K^2 = (14+1) =15$

$36288 = 2^6 * 3^4 * 7$
For any perfect cube, all the powers of its prime numbers have to be multiples of 3.
So, if the factor is of form $2^a * 3^b * 7^c$, a can take values 0, 3, 6
And b can take values 0, 3
And c can take value 0.
==> There are 3*2*1 = 6 possibilities.

If the unit digit of the cube is 4, the unit digit of the number must definitely be 4.
=> The number must be of the form ‘abc4’
Since a and b are the thousandth and the hundredth digit number, they won’t contribute to the tens digit number of the cube. Let us find how many values c can assume.
$(10c+4)^3$ gives 44 in the end.
=> $1000c^3 + 64 + 400c^2 + 480c$ ends in 44.
Again $1000c^3$ and $400c^2$ won’t contribute to the last 2 digits.
=> 64+80c ends in 44. This only happens when c=1 or c=6
=> a can assume 1-9 i.e 9 values, b can assume 0-9 i.e. 10 values, and c can assume 2 values. Total numbers= 180.

X on division by 7 leaves a remainder of 2. So X is of the form 7k+2
Same number on division by 19 leaves a remainder of 1, So X is also of the form 19m + 1
Thus
7k+2 = 19m + 1
If we put m = 3, we get a number which is of the form 7k+2. Thus the smallest number which fits the given criteria is 19*3+1 =58
When 58 is divided by 23, the remainder would be 12.

34 = 17*2
So we have to find the highest power of 17 in 2000!. We need not find the power of 2 because of 2 will be greater than the power of 17. Thus the power of 17 will act as the limiting value.
Thus the highest power of 17 in 2000! is
[2000/17] + [ 2000/289] + [2000/4913], [] is greatest integer function
= 117 + 6 + 0 = 123
Thus the required number of zeroes is 123.

$GCD(a,b) = GCD(a-k*b,b)$ for any integer $k$.
$GCD_n = GCD(200+n^2,200+(n+1)^2) = GCD(200+n^2,200+n^2+2n+1)$
Therefore, $GCD_n = GCD(200+n^2,2n+1) = GCD(400+2n^2,2n+1)$
Therefore, $GCD_n = GCD(400+2n^2 -n*(2n+1),2n+1) = GCD(400-n,2n+1)$
Therefore, $GCD_n = GCD(800-2n,2n+1) = GCD(801,2n+1)$
Hence, the maximum value of $GCD_n = 801$ when $2n+1 = 801$ or $n=400$