Assignment On Relation and Function Class 12
Assignment On Relation and Function Class 12
G)
CLASS:12, SUB: MATHEMATICS
1. Let R0 be the set of non – zero real numbers. Show that f : R → R given by f(x) = 1 /x is one – one
and onto.
2. Let A = R – {3}, B = R - {2 /3 } . If f: A → B by f(x) =( 2x- 4)/( 3x- 9) , prove that f is a bijection
3. Prove that f : R+ → [-5,) given by f(x) = 3x2 +2x – 5. Prove that f is invertible. Find the inverse of
5 each of the integers n and m leaves the remainder less than 5, i.e. one of the numbers 0, 1, 2,
3 and 4. Show that R is equivalence relation. Also, obtain the pairwise disjoint subsets
determined by R.
5. If A = {1, 2, 3, 4 }, define relations on A which have properties of being:
(a) reflexive, transitive but not symmetric
(b) symmetric but neither reflexive nor transitive
(c) reflexive, symmetric and transitive.
6. Let n be a fixed positive integer. Define a relation R in Z as follows: ∀a, b ∈Z, aRb if and only if a –
b is divisible by n . Show that R is an equivalance relation.
7. Show that the function f : R → R defined by f (x) = x/ x 2 + 1 , x ∀ ∈R, is neither one-one nor onto.
8. Let R be the set of real numbers and f : R → R be the function defined by f (x) = 4x + 5. Show that f
is invertible and find f –1 .
9. Let f, g : R → R be two functions defined as f (x) = |x|+ x and g (x) = |x| – x ∀ x ∈ R. Then, find f o g
and g o f
10. Let A = {a, b, c} and the relation R be defined on A as follows: R = {(a, a), (b, c), (a, b)}. Then, write
minimum number of ordered pairs to be added in R to make R reflexive and transitive.
Totally there were 250 participants. Among all of them finally three from Category 1 and two from
Category 2 were selected for the final race. Ravi forms two sets B and G with these participants for his
college project. Let B = {b1,b2,b3}, G={g1,g2} where B represents the set of boys selected and G the set
of girls who were selected for the final race. Ravi decides to explore these sets for various types of
relations and functions.
1. Ravi wishes to form all the relations possible from B to G. How many such relations are possible?
2. Let 𝑅: 𝐵 → 𝐺 be defined by R = { (b1,g1), (b2,g2),(b3,g1)}. Check R is/are injective/
surjective/bijective.
3. Ravi wants to find the number of injective functions from B to G. How many numbers of injective