CBSE Test Paper 04 Chapter 1 Real Numbers

Download as pdf or txt
Download as pdf or txt
You are on page 1of 9

CBSE Test Paper 04

Chapter 1 Real Numbers

1. The largest number which divides 245 and 1029 leaving remainder 5 in each case is
(1)
a. 8
b. 12
c. 4
d. 16
2. Every positive odd integer is of the form ________ where ‘q’ is some integer. (1)
a. 2q + 2
b. 5q + 1
c. 3q + 1
d. 2q + 1
3. Which of the following is a rational number? , , , . (1)
a.
b.
c.
d.
4. What is a lemma? (1)
a. contradictory statement
b. proven statement
c. no statement
d. None ot these
5. If HCF(a, b) = 12 and = 1800, then LCM(a, b) is (1)
a. 150
b. 90
c. 900
d. 1800

6. The HCF of two numbers is 145 and their LCM is 2175. If one number is 725, find the
other. (1)
7. What is the HCF of the smallest composite number and the smallest prime number?
(1)

8. Find the HCF of the following polynomials: . (1)

9. An army contingent of 1000 members is to march behind an army band of 56


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? (1)

10. If a and b are prime numbers, then what is their L.C.M.? (1)

11. Find the HCF of 1,656 and 4,025 by Euclid's division algorithm. (2)

12. Find the smallest number which when increased by 17 is exactly divisible by both 520
and 468. (2)

13. Write a rational number between and . (2)

14. If p is a prime number, then prove that is an irrational. (3)

15. Find the HCF of 180, 252 and 324 by using Euclid's division lemma. (3)

16. Prove that 15 + 17 is an irrational number. (3)

17. Find the LCM and HCF of 336 and 54 and verify that LCM HCF = product of two
numbers. (3)

18. On dividing the polynomial 4x4 - 5x3 - 39x2- 46x - 2 by the polynomial g(x), the

quotient is x2 - 3x - 5 and the remainder is - 5x + 8. Find the polynomial g(x). (4)

19. If the HCF of 152 and 272 is expressible in the form 272 8+ 152x, then find x. (4)

20. Prove that if x and y are odd positive integers, then x 2 + y 2 is even but not divisible
by 4. (4)
CBSE Test Paper 04
Chapter 1 Real Numbers

Solution

1. d. 16
Explanation: Let us subtract 5 (the remainder) from each number in order to
find their HCF.
245 - 5 = 240
1029 - 5 = 1024
Now, Let us find HCF of 240 , 1024
1024 = 240 4 + 64
240 = 64 3 + 48
64 = 48 1 + 16
48 = 16 3+0
The largest number which divides 245 and 1029 leaving remainder 5 in each
case is 16.

2. d. 2q + 1
Explanation: Let be any positive integer and b = 2
Then by applying Euclid’s Division Lemma,
we have, a = 2q +r,
where = 0 or 1 a = 2q or 2q + 1 .
Therefore, it is clear that a = 2q i.e., a is an even integer.
Also, 2q and are two 2q + 1 consecutive integers, therefore, ​2q + 1​ is an odd
integer.

3. b.
Explanation: is an irrational number but because =3 and 3 is a
rational number.

4. b. proven statement
Explanation: A lemma is a proven statement that is used to prove another
statement.

5. a. 150
Explanation: Using the result,
= Product of two natural numbers
LCM (a, b) = = 150

6. We are given that:


HCF =145,LCM=2175 a=725 and b=?
We know that
LCM HCF = a b

Therefore the second number is 435

7. The smallest prime number is 2 and the smallest composite number is


Hence the required HCF (4 , 2) = 2

8.

9. 1000 =
56 =
HCF of 1000 and 56 = 8
Maximum number of columns = 8

10. a = 1 a
b=1 b
HCF of a and b = 1
Their LCM = 1 a b
LCM of a and b = ab

11. AS 4025 > 1656 So applying Euclid's division algorithm on 4025 and 1656 we get
Hence, HCF(1656, 4025) = 23
12. The smallest number divisible by 520 and 468 = LCM(520,468)
Prime factors of 520 and 468 are :

520 = 23 5 13
468 = 2 2 3 3 13

Hence LCM(520,468) = 23 32 5 13 = 8 9 5 13 = 4680


Now the smallest number which when increased by 17 is exactly divisible by both 520
and 468.
= LCM(520,468)-17
= 4680-17
= 4663
13. We can write the two given irrational numbers as:
= 2 and =3
Let p be any rational number between .

2 < (p)2 < 3

One possible value of (p)2 = 2.25


p = 1.5
14. Let p be a prime number and if possible, let be rational.
, where m and n are co-primes and n
Squaring on both sides, we get

or,

or, pn2= m2..............(I)

Hence p is a factor of m​2​, So p is a factor of m ............. (1)


So let m=pt ,t is any integer
On putting m=pt in.(i), we get
Hence p is a factor of n​2​, So p is a factor of n ............ (2)
From (1) and (2) p is a common factor of m and n
Thus this contradicts the fact that m and n are co-primes.
The contradiction arises by assuming that is rational.
Hence, is irrational
15. Given numbers are 180, 252 and 324.
324 > 252 >180
On applying Euclid's Division lemma for 324 and 252, we get
324 = (252 × 1) + 72
Here, remainder = 72 ≠ 0
So, again applying Euclid's Division lemma with new dividend 252 and new divisor
72, we get
252 = (72 × 3) + 36
Here, remainder =36 ≠ 0
So, again applying Euclid's Division lemma with new dividend 72 and new divisor 36,
we get
72 = (36 × 2) + 0
Here, remainder = 0 and divisor is 36
So, HCF of 324 and 252 is 36
Now, applying Euclid's Division lemma for 180 and 36, we get
180 = (36 × 5) + 0
Here, remainder = 0
So HCF of 180 and 36 is 36.
Hence, HCF of 180,252 and 324 is 36.
16. Suppose , where a and b are co-prime integers,
Squaring both sides,

Multiplying with on both sides,

LHS =
RHS =
Our supposition is wrong.
is irrational.
Suppose is a rational number.
, where are co-prime,

is rational number,
is irrational.

Our supposition is wrong.


is irrational.

17.

So, 336 = 2 2 2 2 3 7 = 24 3 7

So, 54 =
Therefore,
LCM (336, 54) =
HCM (336, 54) = .
Verification:
LCM HCF = 3024 6 = 1814 and 336 54 = 18144
i.e. LCM HCF = product of two numbers
18. It is given that on dividing the polynomial 4x4 - 5x3 - 39x2- 46x - 2 by the polynomial

g(x), the quotient is x2 - 3x - 5 and the remainder is - 5x + 8. We have to find the


polynomial g(x).
Now, we know that
Dividend = (Divisor Quotient) + Remainder

4x4- 5x3-39x2 - 46x- 2 = g(x) (x2- 3x -5 ) + (-5x + 8)

or, 4x4 - 5x3 - 39x2 - 46x - 2 + 5x - 8 = g(x) (x2- 3x - 5)

or, 4x4 - 5x3 - 39x2 - 41x - 10 = g(x)(x2- 3x - 5)

g(x) =

Hence, g(x) = 4x2 + 7x + 2

19. On applying the Euclid’s division lemma to find HCF of 152, 272, we get

Here the remainder = 0.


Using Euclid’s division lemma to find the HCF of 152 and 120, we get

Again the remainder = 0.


Using division lemma to find the HCF of 120 and 32, we get

Similarly,

HCF of 272 and 152 is 8.


272 8 + 152x = H.C.F. of the numbers

20. Let x = 2p + 1 and y = 2q + 1

is an even number but not divisible by 4.

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy