All Study Materials in Free of Cost: TH TH TH TH
All Study Materials in Free of Cost: TH TH TH TH
All Study Materials in Free of Cost: TH TH TH TH
COM } ON GOOGE
Objective Questions
1. What is the least number that must be added to 1056 so the number is divisible by 23?
(A) 0
(B) 3
(C) 2
(D) 1
Answer: (C) 2
Solution: We have,
23) 1056 (45
1035
−−−−
21
−−−−
On dividing 1056 by 23, we got 21 as remainder.
⇒ If we add 23 - 21 = 2 to the dividend 1056, we will get a number completely divisible
by 23.
∴ Required number = (23 - 21) = 2
2. The difference of two numbers is 1365. On dividing the larger number by the smaller, we
get 6 as quotient and the 15 as remainder. What is the smaller number?
(A) 360
(B) 295
(C) 270
(D) 240
3. Euclid’s division lemma states “Given positive integers a and b, there exist unique
integers q and r satisfying a=bq+r". Which of the following is true for r?
(A) r>a
(B) r<0
(C) 0≤r<b
(D) r>b
(A)5
(B) 6
(C) 12
(D) 11
Answer: (D) 11
Solution: There exist integers m and n such that a = 7m + p and b = 6n + q such that
0<p<7⇒
Maximum value of p will be 6.
0<q<6⇒
Maximum value of p will be 5.
Therefore, the maximum value of p + q will be 11.
5. If HCF (1008, 20) = HCF (20, a) = HCF (a, b) where 1008=20×q+a; 20=a×m+b where (q, a)
and (m, b) are positive integers satisfying Euclid’s Division Lemma. What could be the
values of a and b?
(A) 24, 8
(B) 20, 8
(C) 10, 4
(D) 8, 4
Answer: (D) 8, 4
Solution: If p=d×q+r, (p>q) where p, q, d, r are integers and for a given (p, d), there exist
a unique (q, r), then HCF (p, d) = HCF (d, r). Because this relation holds true, the Euclid’s
Division Algorithm exists in a step by step manner. So, to find the HCF (1008, 20), we use
Euclid’s division lemma at every step.
HCF = 4
Since 1008=20×q+a where q and a are positive integers satisfy Euclid’s Division Lemma,
we must have 0≤a<20. So a is surely 8 and b is 4.
(A) 42437
(B) 20164
(C) 81225
(D) 32761
Solutions: We know that the square of a natural number never ends in 2, 3, 7 and 8.
7. If the number 91876y2 is completely divisible by 8, then the smallest whole number in
place of y will be:
(A) 2
(B) 4
(C) 3
(D) 1
Answer: (C) 3
Solution: For a number to be divisible by 8, the last three digits must be divisible by 8.
8. If x and y are the two digits of the number 653xy such that this number is divisible by 80,
then x + y =?
(A) 4 or 8
(B) 6
(C) 4
(D) 8
Answer: (B) 6
Solution: If the number is divisible by another number, it will be divisible by its factors
too.
So, y=0
So, x+y=6+0 = 6
0.2= =
∴ 3.1415926535... is irrational.
=
= =
10. ‘s’ is called irrational if it cannot be written in the form of _____ where p and q are
integers and ______
(A) ,p=0
(B) pq , p ≠ 0
(C)
(D)
Answer: (C)
Solution: ‘s’ is called irrational if it cannot be written in the form of pq, where p and
q are integers and q ≠ 0
(A) 0.0208
(B) 0.00208
(C) 0.00512
(D) 0.00416
Solution: =
⇒ =
= 13 x = = 0.00208
12. Without actually performing the long division, state whether the following rational
numbers will have a terminating decimal expansion or a non-terminating decimal
expansion:
13. Without actually performing the long division, state whether the following rational
number will have a terminating decimal expansion or a non-terminating decimal
expansion: and
n are non-negative integers, then the rational number has terminating decimal
expansion.
Answer: (D) Rational Number, Prime factors of q will have either 2 or 5 or both
integers.
15. Let x= be a rational number, such that the prime factorization of q is not of the
form , where n, m are non-negative integers. Then, x has a decimal expansion
which is ____________
(A) Terminating
(A) 9
(B) 14
(C) 13
(D) 11
Answer: (D) 11
Solution: Consider first two numbers 1848 and 3058, where 3058 > 1848.
∴ HCF of the three given numbers 1848, 3058 and 1331 is 11.
17. An army contingent of 616 members is to march behind an army band of 32 members in
a parade. The two groups are to march in the same number of columns. What is the
maximum number of columns in which they can march?
(A) 8
(B) 7
(C) 6
(D) 9
Answer: (A) 8
(A) 18
(B) 36
(C) 9
(D) 21
Answer: (B) 36
Solution: Finding the biggest number that will divide both 324 and 144 is same as finding
the HCF of both.
Prime factorizing the two numbers we get,
324=3×3×3×3×2×2
144=3×3×2×2×2×2
Now, taking the common factors between them gives us the HCF.
Therefore, HCF =2×2×3×3=36
19. Which of the following does not satisfy the following property?
A number which divides 542 and 128 and leaves a remainder 2 in both cases.
(A) 12
(B) 9
(C) 6
(D) 3
Answer: (A) 12
Solution: Suppose the number be x. Since it divides 542 and 128 leave a remainder 2,
using the Euclid’s division algorithm for 542 and x, 542 = ax + 2, where a is an integer. So,
ax = 542 – 2 = 540, i.e. x is a factor of 540. Similarly x is a factor of (128 - 2).
(A) p = 700
(B) p = 900
(C) p = 36