Relations and Functions
Get insights from 232 questions on Relations and Functions, answered by students, alumni, and experts. You may also ask and answer any question you like about Relations and Functions
- 232
Questions
- 0
Discussions
- 0
Active Users
- 1
Followers
Have a question about Relations and Functions? Ask our experts
Keep it short & simple. Type complete word. Avoid abusive language.
31. Let f, g : R→R be defined, respectively by f(x) = x + 1, g(x) = 2x – 3. Find f + g, f – g and .
31. Let f, g : R→R be defined, respectively by f(x) = x + 1, g(x) = 2x – 3. Find f + g, f – g and .
31. Given, f(x) = x+1. and g(x) = 2x – 3.
So, (f +g)(x) = f(x)+g(x) = (x+1)+(2x – 3) = x+1+2x – 3 = 3x – 2
(f – g)(x) = f(x) –g(x) = (x+1)–(2x–3) = x+1 – 2x+3 = 4 – x
30. Let be a function from R into R. Determine the range of f.
30. Let be a function from R into R. Determine the range of f.
30. Given, f (x)=
We know that, for x R.
So, x2≥ 0 ⇒
and x2+1>x2
⇒
⇒1 > f (x).
So, 0 ≤ f (x) < 1
∴ Range of f (x) = [0,1).
74. Number of binary operations on the set {a, b} are:
(A) 10
(B) 16
(C) 20
(D) 8
74. Number of binary operations on the set {a, b} are:
(A) 10
(B) 16
(C) 20
(D) 8
A binary operation * on {a, b} is a function from {a, b} × {a, b} → {a, b}
i.e., * is a function from { (a, a), (a, b), (b, a), (b, b)} → {a, b}.
Hence, the total number of binary operations on the set {a, b} is 24 i.e., 16.
The correct answer is B.
73. Let R → R be the Signum Function defined as and R → R be the Greatest Function given by g(x) = [x] where [x] is greatest integer less than or equal to x
Then, does fog and gof coincide in (0, 1)?
73. Let R → R be the Signum Function defined as and R → R be the Greatest Function given by g(x) = [x] where [x] is greatest integer less than or equal to x
Then, does fog and gof coincide in (0, 1)?
It is given that,
is defined as
Also, is defined as , where [x] is the greatest integer less than or equal to x.
Now, let
Then, we have:
if and if
Thus, when , we have
Hence, fog and gof do not coincide in (0, 1).
The
72. Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is:
(A) 1
(B) 2
(C) 3
(D) 4
72. Let A = {1, 2, 3}. Then number of equivalence relations containing (1, 2) is:
(A) 1
(B) 2
(C) 3
(D) 4
2, Therefore, option (B) is correct.
71. Let A = {1, 2, 3}. Then 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
71. Let A = {1, 2, 3}. Then 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
It is clear that 1 is reflexive and symmetric but not transitive.
Therefore, option (A) is correct.
70. Let A = {–1, 0, 1, 2}, B = {–4, –2, 0, 2} and f; g: A→B be the functions defined by f(x) = x2 − x, x ∈ A and g(x) = 2x - 1/2 - 1. x∈ A. Are f and g equal? Justify your answer.
(Hint: One may note that two functions f: A → B and g: A → B such that f(a) = g(a) & mn For E; a ∈A, are called equal functions).
70. Let A = {–1, 0, 1, 2}, B = {–4, –2, 0, 2} and f; g: A→B be the functions defined by f(x) = x2 − x, x ∈ A and g(x) = 2x - 1/2 - 1. x∈ A. Are f and g equal? Justify your answer.
(Hint: One may note that two functions f: A → B and g: A → B such that f(a) = g(a) & mn For E; a ∈A, are called equal functions).
It is given that A = {–1, 0, 1, 2}, B = {–4, –2, 0, 2}
Also, it is given that are defined by and .
It is observed that:
Hence, the functions f and g are equal.
29. Find the domain and the range of the real function f defined by .
29. Find the domain and the range of the real function f defined by .
29. Given, f(x)=|x – 1|.
The given function is defined for all real number x.
Hence, domain of f(x)=R.
As f(x)=|x – 1|, x R is a non-negative no.
Range of f(x)=[0, ?), if positive real numbers.
69. Define binary operation * on the set {0, 1, 2, 3, 4, 5} as
Show that zero is the identity for this operation and each element a ≠ 0 of the set is invertible with 6 - abeing the inverse of a
69. Define binary operation * on the set {0, 1, 2, 3, 4, 5} as
Show that zero is the identity for this operation and each element a ≠ 0 of the set is invertible with 6 - abeing the inverse of a
Let X={0, 1, 2, 3, 4, 5}.
The operation* on X is defined as:
An element is the identity element for the operation*, if
For we observed that
Thus, 0 is the identity element for the given operation*.
An element is invertible if there exists such that
i
68. Given a non-empty set X, let *: P(X) × P(X) → P(X) be defined as A * B = (A − B) ∪ (B − A), &mn For E; A, B ∈ P(X). Show that the empty set Φ is the identity for the operation * and all the elements A of P(X) are invertible with A−1 = A. (Hint: (A − Φ) ∪ (Φ − A) = A and (A − A) ∪ (A − A) = A * A = Φ).
68. Given a non-empty set X, let *: P(X) × P(X) → P(X) be defined as A * B = (A − B) ∪ (B − A), &mn For E; A, B ∈ P(X). Show that the empty set Φ is the identity for the operation * and all the elements A of P(X) are invertible with A−1 = A. (Hint: (A − Φ) ∪ (Φ − A) = A and (A − A) ∪ (A − A) = A * A = Φ).
It is given that ∗: P (X) × P (X) → P (X) be defined as
A * B = (A – B) ∪ (B – A), A, B ∈ P (X).
Now, let A? P (X). Then, we get,
A *? = (A –? ) ∪ (? –A) = A∪? = A
? * A = (? - A) ∪ (A -? ) =? ∪A = A
A *? = A =? * A, A? P (X)
Therefore? is the identity element for the given operation