Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
10 views2 pages

Relation and Function

Uploaded by

routritik005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
10 views2 pages

Relation and Function

Uploaded by

routritik005
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Ch-1 Relation and Function

(a) Both Assertion (A) and Reason (R) are true and Reason (R) is the correct explanation of Assertion (A).
(b) Both Assertion (A) and Reason (R) are true and Reason (R) is not the correct explanation of Assertion (A).
(c) Assertion (A) is true but Reason (R) is false.
(d) Assertion (A) is false but Reason (R) is true.
Q1. Assertion (A) : Let Z be the set of integers. A function f : Z → Z defined as f (x) = 3x − 5,  x  Z is a
bijective.
Reason (R) : A function is a bijective if it is both surjective and injective.

Q 2. If R = {(x, y) : x2 + y2 ≤ 4; x, y  Z} is a relation on Z, write the domain of R.

Q3. For real x, let f (x) = x 3 + 5x + 1 . Then


(a) f is one-one but not onto on (b) f is onto on but not one-one
(c) f is one-one and onto on (d) f is neither one-one nor onto on

Q4 Let A = {1, 2, 3}. Then, the number of relations containing (1, 2) and (1, 3) which are reflexive and
symmetric but not transitive is
(*a) 1 (b) 2 (c) 3 (d) 4

Q5 Let A = {1, 2, 3}. Then, the number of equivalence relations containing (1, 2) is
(a) 1 (*b) 2 (c) 3 (d) 4

Q6 If A = {a, b, c} and B = {- 2, -1,0,1,2}, write total number of one-one functions from A to B


n
 , if n is even
(ii) If f : N → W is defined as f (n) =  2 . Then f is

0, if n is odd
(a) injective only (b) surjective only
(c) a bijection (d) neither surjective nor injective

Q7. If A = {1, 2,3} and B = {a, b}, write total number of functions from A to B.
+
26. (a) If f : → is defined as f (x) = log a x , (a  0 and a  1) , prove that f is a bijection.
+
( is a set of all positive real numbers.)

Q8 Let A = {x  R : - 1 ≤ x ≤ 1} = B. Then, the mapping f : A → B given by f(x) = x | x | is


(a) injective but not surjective (b) surjective but not injective
(*c) bijective (d) none of these

x
Q9. The function f : [0, ) → R given by f(x) = is
x +1
(a) one-one and onto . (b*) one-one but not onto
(c) onto but not one-one (d) neither one-one nor onto
x2
Q10. If the function f : R → A given by f(x)= is a surjection, then A =
x2 +1
(a) R (b) [0,1] (c) (0,1] (*d) [0,1)

Q11 Let A = {1, 2, 3} and B = {4, 5, 6} . A relation R from A to B is defined as R = {(x , y) :


x + y = 6, x  A, y  B} .
(i) Write all elements of R. (ii) Is R a function? Justify.(iii) Determine domain and range of R.
Q12 Show that the relation R on the set R of all real numbers, defined as
R = {(a, b) : a ≤ b2}
is neither reflexive nor symmetric nor transitive.

Q13. Test whether the following relations R1, R2, and R3 are (i) reflexive (ii) symmetric and (iii) transitive:
(i) R1 on Q0 defined by (a,b)  R1  a = 1/b.
(ii) R2 on Z defined by (a, b)  R2  | a - b | ≤ 5
(iii) R3 on R defined by (a, b)  R3 & a2 - 4ab + 3b2 = 0.

Q 14. Given the relation R = {(1,2), (2, 3)} on the set A = {1, 2, 3}, add a minimum number of ordered
pairs so that the enlarged relation is symmetric, transitive and reflexive.

Q15. Show that the relation R on the set A = {1, 2, 3, 4, 5}, given by
R = {(a, b) : | a – b | is even}, is an equivalence relation.
Show that all the elements of {1, 3, 5} are related to each other and all the elements of {2, 4} are
related to each other. But, no element of {1, 3, 5} is related to any element of {2, 4}.
Q16. Let N denote the set of all natural nu,mbers and R be the relation on N  N defined by (a, b) R (c, d)
 ad(b + c) = bc(a + d). Check whether R is an equivalnece relation on N  N.

Q17. Show that the number of equivalence elations on the set {1, 2, 3} containing (1, 2) and (2, 1) is two.

n + 1
 , if nisodd
 2
Q18 Show that f : N → N defined by f(x) =  is many-one onto function.
 n , if nis even

 2

x −1
Q19 Let A = R – {2} and B = R – {1}. If f : A → B is a mapping defined by f (x) = , show that f is
x−2
bijective.

x
Q20 Show that the function f : R → {x  R : -1 < x < 1} defined by f (x) = , x  R is one-one onto
1+ | x |
function.

Q21 Let f : N → R be a function defined as f(x) = 4x2 + 12x + 15. Show that f : N → Range (f) is
bijective

Q22 Consider f : R+ → [- 5, ) given by f(x) = 9x2 + 6x - 5. Show that f is bijective

ANSWER
1.(d) Q 2.. {0, 1, 2}

Q3.(c) 4a 5b 6)60 6(ii)b 7)a 8)c 9)b 10)d 11)i) R = {(1, 5), (2, 4)} . (ii), R is not a function.
(iii) Domain of R = {1, 2} , range of R = {4, 5} .
13. (i) R1 is symmetric but it is neither reflexive nor transitive (ii) R2 is reflexive and symmetric but it
is not transitive
(iii) R3 is reflexive but it is neither symmetric nor transitive.

14. (1,1), (2, 2), (3,3), (1,3), (2,1), (3, 2), (3,1)

You might also like