Test Paper 5
Test Paper 5
Chapter -1
CBSE Test Paper 05
Real Number
Chapter 1 Real Numbers
Set -5
1. The exponent of 3 in the prime factorization of 864 is: (1)
a. 2
b. 3
c. 4
d. 8
2. Which of the following numbers has terminating decimal expansion? (1)
a.
b.
c.
d.
3. The decimal expansion of will terminate after: (1)
a. 2 decimal places
b. 3 decimal places
c. 1 decimal place
d. None of these
4. The smallest number of 4 digits exactly divisible by 12, 15, 18 and 27 is (1)
a. 1000
b. 1080
c. 1002
d. 1001
5. A number when divided by 61 gives 27 as quotient and 32 as remainder, then the
number is: (1)
a. 1796
b. 1569
c. 1679
d. 1967
6. Given that HCF (306, 657) = 9, find LCM (306, 657). (1)
7. State whether will have terminating decimal expansion or a non-
10. What can you say about the prime factorisations of the denominators of
rational. (1)
11. Prove that is irrational. (2)
12. Without actual division, show that is a non terminating repeating decimal.
(2)
13. Find the largest number which exactly divides 280 and 1245 leaving remainders 4 and
3, respectively. (2)
14. Find the values of a and b so that the polynomials P(x) and Q(x) have
as their HCF, where (3)
that x2 + y2 is an even integer but not divisible by 4 where m and n are positive
integer. (4)
Solution
1. b. 3
Explanation: Prime factorization of 864 = =
Therefore the exponent of 3 in the prime factorization of 864 is 3
2. c.
Explanation: has terminal decimal expansion because terminal decimal
expansion should have the denominator 2 or 5 only.
3. b. 3 decimal places
Explanation: = =
Here, in the denominator of the given fraction the highest power of prime
factor 5 is 3, therefore, the decimal expansion of the rational number will
4. b. 1080
Explanation: LCM (12, 15, 18, 27) = 540
Now, smallest four digit number = 1000
1000 540 = 1 540 + 460 (Remainder = 460)
Therefore, the smallest number of 4 digits exactly divisible by 12, 15, 18 and 27
is 1000 + (540 – 460) = 1000 + 80 = 1080
5. c. 1679
Explanation: Dividend = Divisor Quotient + Remainder
Number(dividend) = D Q+R
Therefore the number (Dividend) = 61 27 + 32
= 1647 + 32 = 1679
9.
Using Identity
Using Identity
⇒ 5 = (a)2
⇒ = a2 + 3 - 5
⇒ = a2 - 2
As a2 – 2, 2a are integers .
13. We need to find the largest number which exactly divides 280 and 1245 leaving
remainders 4 and 3, respectively. The required number when divides 280 and 1245,
leaves remainder 4 and 3, this means
280 - 4 = 276 and 1245 - 3 = 1242 are completely divisible by the number.
Therefore, the required number = H.C.F. of 276 and 1242.
By applying Euclid’s division lemma:
1242 = 276 4 + 138
276 = 138 2 + 0.
Therefore, H.C.F of 276 and 1242 = 138.
Hence, the required number is 138.
14.
Since, therefore,
(x+3) and (x-4) are factors of p(x), As (x-4) is already seen
in p(x) and (x+3) is also a factor of p(x).
Thus, by factor theorem, x + 3 = 0
Hence,
Again,
Since,
, by factor theorem Q(4) must equal to 0.
Hence, a = 6, b = -2
Now
= 0.06025
17. A sweet seller has 420 kaju barfis and 130 badam barfis
HCF(420, 130) will give the maximum number of barfis that can be placed in each
stack.
By Euclid’s division algorithm,
∴ The sweet seller can make stacks of 10 for both kinds of barfis.
18. we have to Use Euclid's Division Lemma to show that the cube of any positive integer
is of the form 9m, 9m + 1, or 9m + 8 for some integer m.
Let a = 3q + r, 0 r<3
or a = 3q, 3q + 1 and 3q + 2
Case I : a = 3q
= 9m where m = 3q3
Case II : a = 3q + 1
a3 = (3q + 1)3
= 27q3 + 9q(3q + 1) + 1
= 9m + 1
a3 = (3q + 2)3
= 27q3 + 18q(3q + 2) + 8
= 3 × 3q2
= 3m, where m is some integer
(3q + 1)2 = (3q)2 + 2(3q)(1) + (1)2
= 9q2 + 6q + 1
= 3(3q2 + 2q) + 1
= 3m + 1, where m is some integer
= 9q2 + 12q + 4
= 9q2 + 12q + 4
= 3(3q2 + 4q + 1) + 1
= 3m + 1, where m is some integer
Hence the square of any positive integer is of the form 3m, or 3m +1
But not of the form 3m + 2
20. Since both x and y are positive odd integers x = 2m + 1 and y = 2n + 1, where m and n
are some whole numbers.