Machine-translated by Google. Questions are authored in English.
Top

Number System Questions and Answers

Important Instructions
91.

The remainder when the positive integer m is divided by 7 is x. The remainder when m is divided by 14 is x+7.

Which one of the following could m equal?

Answer: B

Test each candidate against both conditions, since the second is far more restrictive than it looks:

mm mod 7 = xm mod 14x + 7fits?
453310no
5341111yes
72229no
85118no

The pattern behind it: dividing by 14 leaves either \( x \) or \( x+7 \), and the second happens exactly when the quotient by 7 is odd. Here \( 53 = 7 \times 7 + 4 \), and that quotient 7 is odd, so the remainder on 14 is \( 4 + 7 = 11 \).

Please log in or register to report this question.

92.

The difference between the local value and face value of 7 in the numeral 657903 is:

Answer: B

The local (place) value of a digit is the digit multiplied by its place; the face value is the digit itself.

In 657903 the 7 sits in the thousands place:

\[ 7000 - 7 = 6993 \]

Please log in or register to report this question.

93.

A and B are playing mathematical puzzles. A asks B "the whole numbers, greater than one, which can divide all the nine three digit numbers 111,222,333,444,555,666, 777,888 and 999?"

B immediately gave the desired answer. It was:

Answer: B

Every one of the nine numbers is a multiple of 111:

\[ 111,\ 222 = 2 \times 111,\ \ldots,\ 999 = 9 \times 111 \]

So any common divisor of all nine must divide 111, and conversely every divisor of 111 divides them all.

\[ 111 = 3 \times 37 \]

The divisors greater than 1 are therefore 3, 37 and 111. 9 is excluded because \( 111 \div 9 \) is not whole.

Please log in or register to report this question.

94.

Which one of the following is not a prime number?

Answer: D

Test each for divisibility.

\[ 91 = 7 \times 13 \]

31, 61 and 71 have no divisor other than 1 and themselves, so 91 is the composite one. It is a classic trap: it is odd, does not end in 5, and its digits sum to 10, so the easy tests all pass - only 7 catches it.

Please log in or register to report this question.

95.

The positive integers mm and nn leave remainders of 2 and 3, respectively, when divided by 6. m>nm>n.

What is the remainder when m-nm-n is divided by 6?

Answer: C

We are given that the numbers mm and nn, when divided by 6, leave remainders of 2 and 3, respectively.

Hence, we can represent the numbers mm and nn as 6p+26p+2 and 6q+36q+3, respectively, where pp and qq are suitable integers.

Now,
m−n=(6p+2)−(6q+3)

=6p−6q−1

=6(p−q)−1

A remainder must be positive, so let’s add 6 to this expression and compensate by subtracting 6:
6(p−q)−1=6(p−q)−6+6−1

=6(p−q)−6+5

=6(p−q−1)+5

Thus, the remainder is 5

Please log in or register to report this question.

97.

\(\left \{(476 + 424)^{2} - 4 \times 476 \times 424 \right \} = ?\)

Answer: C

Given Expression = \([(a + b)^{2} - 4ab]\), where \(a = 476\) and \(b = 424\)
\(=[(476 + 424)^{2} - 4 \times 476 \times 424]\)
\(= [(900)^{2} - 807296]\)
\(= 810000 - 807296\)
\(= 2704\)

Please log in or register to report this question.

98.

A number when divided by the sum of 555 and 445 gives two times their difference as quotient and 30 as the remainder. The number is:

Answer: D

\[ \text{divisor} = 555 + 445 = 1000 \]

\[ \text{quotient} = 2(555 - 445) = 220 \]

\[ \text{number} = 1000 \times 220 + 30 = 220{,}030 \]

Please log in or register to report this question.

99.

Four digits of the number 29138576 are omitted so that the largest result is possible. The largest omitted digit is:

Answer: A

We have to omit four digits in such a manner that we get the largest possible number as the result.

We will omit 2,1,32,1,3 and 55 and the result will be 98769876.

The largest omitted digit will be 5.

Please log in or register to report this question.

100.

The highest power of 9 dividing 99! completely is

Answer: D

Count the factors of 3 first, then pair them up. Legendre's rule gives the exponent of a prime in a factorial:

\[ \left\lfloor\frac{99}{3}\right\rfloor + \left\lfloor\frac{99}{9}\right\rfloor + \left\lfloor\frac{99}{27}\right\rfloor + \left\lfloor\frac{99}{81}\right\rfloor = 33 + 11 + 3 + 1 = 48 \]

So \( 3^{48} \) divides 99! and no higher power does. Because \( 9 = 3^{2} \), each factor of 9 consumes two of those threes:

\[ \text{highest power of } 9 = \left\lfloor\frac{48}{2}\right\rfloor = 24 \]

Answer 48 is the trap for stopping at the power of 3 without halving it.

Please log in or register to report this question.

Loading…
Tags: Number System Questions and Answers || Number System MCQ Questions and Answers || Number System GK Questions and Answers || Number System GK MCQ Questions || Number System Multiple Choice Questions and Answers || Number System GK || GK on Number System || Quantitative Aptitude Questions and Answers || Quantitative Aptitude MCQ Questions and Answers || Quantitative Aptitude GK Questions and Answers || GK on Quantitative Aptitude