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.
Let D be the domain of the real valued function f defined by . Then, write D.
Let f, g :R → R be defined by f(x) = 2x + 1 and g (x) = x2 – 2, i∀ x ∈ R, respectively. Then, find g o f.
Let f :R → R be the function defined by f (x) = 2x – 3 ∀ x ∈ R. write f–1.
If A = {a, b, c, d} and the function f = {(a, b), (b, d), (c, a), (d, c)}, write f–1.
If f :R → R is defined by f (x) = x2 – 3x + 2, write f (f (x)).
Is g = {(1, 1), (2, 3), (3, 5), (4, 7)} a function? If g is described by g (x) = α x + β, then what value should be assigned to α and β.
Are the following set of ordered pairs functions? If so, examine whether the mapping is injective or surjective.
(i) {(x, y): x is a person, y is the mother of x}.
(ii){(a, b): a is a person, b is an ancestor of a}.
If the mappings f and g are given by f = {(1, 2), (3, 5), (4, 1)} and g = {(2, 3), (5, 1), (1, 3)}, write f o g.
Let C be the set of complex numbers. Prove that the mapping f :C → R given by f (z) = |z|, ∀ z ∈ C, is neither one-one nor onto.
Let the function f :R → R be defined by f (x) = cosx, ∀ x ∈ R. Show that f is neither one-one nor onto.
Let X = {1, 2, 3} and Y = {4, 5}. Find whether the following subsets of X × Y are functions from X to Y or not.
(i) f = {(1, 4), (1, 5), (2, 4), (3, 5)}
(ii) g = {(1, 4), (2, 4), (3, 4)}
(iii) h = {(1,4), (2, 5), (3, 5)}
(iv) k = {(1,4), (2, 5)}.
If functions f : A → B and g : B → A satisfy g o f = IA, then show that f is one one and g is onto.
Let f : R → R be the function defined by . Then, find the range of f.
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 equivalence relation.
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.
Let R be relation defined on the set of natural number N as follows:
R = {(x, y): x ∈N, y ∈N, 2x + y = 41}. Find the domain and range of the relation R. Also verify whether R is reflexive, symmetric and transitive.
Given A = {2, 3, 4}, B = {2, 5, 6, 7}. Construct an example of each of the following:
(a) an injective mapping from A to B
(b) a mapping from A to B which is not injective
(c) a mapping from B to A.
Give an example of a map
which is one-one but not onto
which is not one-one but onto
which is neither one-one nor onto.
Let A = R – {3}, B = R – {1}. Let f : A → B be defined by ∀ x ∈ A . Then show that f is bijective.
Let A = [–1, 1]. Then, discuss whether the following functions defined on A are one-one, onto or bijective:
g(x) = |x|
h(x) = x |x|
k(x) = x2
Each of the following defines a relation on N:
x is greater than y, x, y ∈N
Determine which of the above relations are reflexive, symmetric and transitive.
x + y = 10, x, y ∈N
x y is square of an integer x, y ∈N
x + 4y = 10 x, y ∈N.
Let A = {1, 2, 3, ... 9} and R be the relation in A ×A defined by (a, b) R (c, d) if a + d = b + c for (a, b), (c, d) in A ×A. Prove that R is an equivalence relation and also obtain the equivalent class [(2, 5)].
Using the definition, prove that the function f : A → B is invertible if and only if f is both one-one and onto.
Functions f, g : R → R are defined, respectively, by f (x) = x2 + 3x + 1, g (x) = 2x – 3, find
(i) f o g (ii) g o f (iii) f o f (iv) g o g
Let * be the binary operation defined on Q. Find which of the following binary operations are commutative
(i) a * b = a – b ∀ a, b ∈Q
(ii) a * b = a2 + b2∀ a, b ∈Q
(iii) a * b = a + ab ∀ a, b ∈Q
(iv) a * b = (a – b)2∀ a, b ∈Q
Let * be binary operation defined on R by a * b = 1 + ab, ∀a, b ∈R. Then the operation * is
(i) commutative but not associative
(ii) associative but not commutative
(iii) neither commutative nor associative
(iv) both commutative and associative
Let T be the set of all triangles in the Euclidean plane, and let a relation R on T be defined as aRb if a is congruent to b ∀a, b ∈T. Then R is
Consider the non-empty set consisting of children in a family and a relation R defined as aRb if a is brother of b. Then R is
The maximum number of equivalence relations on the set A = {1, 2, 3} are
If a relation R on the set {1, 2, 3} be defined by R = {(1, 2)}, then R is
Let us define a relation R in R as aRb if a ≥ b. Then R is
Let A = {1, 2, 3} and consider the relation
R = {1, 1), (2, 2), (3, 3), (1, 2), (2, 3), (1,3)}.
Then R is
The identity element for the binary operation * defined on Q ~ {0} asb ∈Q ~ {0}is
If the set A contains 5 elements and the set B contains 6 elements, then the number of one-one and onto mappings from A to B is
Let A = {1, 2, 3, ...n} and B = {a, b}. Then the number of surjections from A into B is
Let f :R → R be defined byThen f is
Let f :R → R be defined by f (x) = 3x2 – 5 and g : R → R by. Then g o f is
Which of the following functions from Z into Z are bijections?
Let f :R → R be the functions defined by f (x) = x3 + 5. Then f–1 (x) is
Let f : A → B and g : B → C be the bijective functions. Then (g o f)–1 is
Let be defined by. Then
Let f : [0, 1] → [0, 1] be defined by
Then (f o f) x is
Let f : [2, ∞) → R be the function defined by f (x) = x2–4x+5, then the range of f is
Let f : N → R be the function defined byand g : Q → R be another function defined by g (x) = x + 2. Then (g o f)3/2 is
Let f :R → R be defined by
Then f (– 1) + f (2) + f (4) is
Let f :R → R be given by f (x) = tan x. Then f–1 (1) is
Fill in the blanks in each of the
Let the relation R be defined in N by aRb if 2a + 3b = 30. Then R = ______.
Let the relation R be defined on the set
A = {1, 2, 3, 4, 5} by R = {(a, b) : |a2 – b2| < 8}. Then R is given by _______.
Let f = {(1, 2), (3, 5), (4, 1) and g = {(2, 3), (5, 1), (1, 3)}. Then g o f = ______and f o g = ______.
Let f :R → R be defined by. Then (f o f o f) (x) = _______
If f (x) = {4 – (x–7)3}, then f–1(x) = _______.
State True or False for the statements
Let R = {(3, 1), (1, 3), (3, 3)} be a relation defined on the set A = {1, 2, 3}. Then R is symmetric, transitive but not reflexive.
Let f : R → R be the function defined by f (x) = sin (3x+2)∀x ∈R. Then f is invertible.
Every relation which is symmetric and transitive is also reflexive.
An integer m is said to be related to another integer n if m is a integral multiple of n. This relation in Z is reflexive, symmetric and transitive.
Let A = {0, 1} and N be the set of natural numbers. Then the mapping f :N → A defined by f (2n–1) = 0, f (2n) = 1,∀n ∈N, is onto.
The relation R on the set A = {1, 2, 3} defined as R = {{1, 1), (1, 2), (2, 1), (3, 3)}is reflexive, symmetric and transitive.
The composition of functions is commutative.
The composition of functions is associative.
Every function is invertible.
A binary operation on a set has always the identity element.