10th Grade > Mathematics
REAL NUMBERS MCQs
:
B
Euclid's division algorithm to find HCF of 1650 and 847:
Step 1: 1650 = 847 × 1 + 803
Step 2: 847 = 803 × 1 + 44
Step 3: 803 = 44 × 18 + 11
Step 4: 44 = 11 × 4 + 0
Hence, 11 is the HCF of 1650 and 847.
:
D
If p is a prime number, then √p is an irrational number.
3 is a prime number.
⇒ √3 is an irrational number.
⇒ 5−√3 is an irrational number.
Similarly, 5+√3 is an irrational number.
2 is a prime number.
⇒ √2 is an irrational number.
⇒ 4+√2 is an irrational number.
9 is not a prime number.
√9=3
⇒ 5+√9=5+3=8 which is a rational number.
⇒ 5+√9 is not an irrational number.
:
Product of two numbers = HCF × LCM
⇒ 42 × 70 = HCF × 210
⇒ HCF = 2940210 = 14
:
C
5005 = 5 × 7 × 11 × 13
∴ There are four prime factors of 5005.
:
D
If pq is a rational number with terminating decimal expansion where p and q are coprimes, then the prime factorisation of q will be in the form of 2n5m.
Example:
Consider rational number 18.
Here, denominator 8=23×50
Therefore, the rational number 18 will have terminating decimal expansion.
18=0.125 which is terminating.
Hence verified.
:
C
Number of rooms will be minimum if each room accomodates maximum number of participants.
In each room, the same number of participants are to be seated and all of them must be for the same subject.
∴ Number of participants in each room must be the HCF of 60, 84 and 108.
Prime factorisation of 60, 84 and 108:
60=22×3×5
84=22×3×7
108=22×33
∴ HCF =22×3=12
In each room, 12 participants can be accommodated.
Number of rooms=Total number of participants12
=60+84+10812
=25212
=21
∴ The total number of rooms is 21.
:
B
Maximum capacity of the measuring vessel = HCF (850, 680)
We use Euclid's division algorithm to find the HCF of 850 and 680.
850 = 680 × 1 + 170
680 = 170 × 4 + 0
∴ HCF (850, 680) = 170
So, the maximum capacity of the measuring vessel required is 170 litres.
:
A
Prime factorisation of 90 and 144:
90=2×3×3×5
144=2×2×2×2×3×3
⇒HCF=2×32=18
LCM=24×32×5=720
∴ HCF and LCM of 90 and 144 are 18 and 720 respectively.
:
A
Since the remainder is same in each case, hence we will use the following formula
H.C.F (x, y, z) = H.C.F of (x -y), (y- z), ( z-x)
N = H.C.F. of (6905 - 4665), (4665 - 1305), and (6905 - 1305)
= H.C.F. of 2240, 3360 and 5600
HCF of 5600 and 3360:
5600=3360×1+2240
3360=2240×1+1120
2240=1120×2+0
∴ HCF of 5600 and 3360 = 1120
Now, HCF of 2240 and 1120 = 1120
So, the HCF of (3360, 2240 and 5600) = N = 1120
Sum of digits in N = (1 + 1 + 2 + 0) = 4
:
A
Let the number be x
Given: x=6q+3 where q is a whole number.
Squaring both sides,
x2=(6q+3)2
⇒ x2=36q2+36q+9
⇒ x2=6(6q2+6q+1)+3
∴ When x2 is divided by 6, then the remainder is 3.