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.
59. Show that function f: R → {x ∈ R: −1 < x < 1} defined by f(x) = x/1+|x| x ∈R is one-one and onto function.
59. Show that function f: R → {x ∈ R: −1 < x < 1} defined by f(x) = x/1+|x| x ∈R is one-one and onto function.
It is given that is defined as
Suppose , where
Since x is positive and y is negative:
But, 2xy is negative.
Then, .
Thus, the case of x being positive and y being negative can be ruled out.
Under a similar argument, x being negative and y being positive can als
58. If f: R → R is defined by f(x) = x2 − 3x + 2, find f(f(x)).
58. If f: R → R is defined by f(x) = x2 − 3x + 2, find f(f(x)).
57. Let f: W → W be defined as f(n) = n − 1, if is odd and f(n) = n + 1, if n is even. Show that f is invertible. Find the inverse of f. Here, W is the set of all whole numbers.
57. Let f: W → W be defined as f(n) = n − 1, if is odd and f(n) = n + 1, if n is even. Show that f is invertible. Find the inverse of f. Here, W is the set of all whole numbers.
It is given that:
is defined as
One-one:
Let,
It can be observed that if n is odd and m is even, then we will have n-1=m+1.
However, the possibility of n being even and m being odd can also be ignored under a similar argument.
Both n and m must be either odd or even.
Now, if both n
25. The relation f is defined by
The relation g is defined by
Show that f is a function and g is not a function.
25. The relation f is defined by
The relation g is defined by
Show that f is a function and g is not a function.
25. Given, f(x)=
f(x)={(0,0),(1,1),(2,4),(3,9),(4,12),(5,15),(6,18),(7,21),(8,24),(9,27),(10,30)}
So, the elements in domain of f has one and only one image.
? f(x) is a function.
Given, g(x)= .
g(x)={(0,0),(1,1),(2,4),(2,6),(3,9),(4,12),(5,15),(6,18),(7,21),(8,24),(9,27),(10,30)}
So, the e
MISCELLANEOUS
56. Let f: R → R be defined as f(x) = 10x + 7. Find the function g: R → R such that g o f = f o g = 1R.
MISCELLANEOUS
56. Let f: R → R be defined as f(x) = 10x + 7. Find the function g: R → R such that g o f = f o g = 1R.
It is given that is defined as
One-one:
is a one-one function.
Onto:
Therefore, for any ,there exists
Such that
is onto.
Therefore, f is one-one and onto.
Thus, f is an invertible function.
Let us define as
Now, we have
Hence, the required function
55. Consider a binary operation * on N defined as a * b = a3 + b3. Choose the correct answer.
(A) Is * both associative and commutative?
(B) Is * commutative but not associative?
(C) Is * associative but not commutative?
(D) Is * neither commutative nor associative?
55. Consider a binary operation * on N defined as a * b = a3 + b3. Choose the correct answer.
(A) Is * both associative and commutative?
(B) Is * commutative but not associative?
(C) Is * associative but not commutative?
(D) Is * neither commutative nor associative?
On N, the operation * is defined as a * b = a3 + b3.
For, a, b, ∈ N, we have:
a * b = a3 + b3 = b3 + a3 = b * a [Addition is commutative in N]
Therefore, the operation * is commutative.
It can be observed that:
(1*2)*3 = (13+23)*3 = 9 * 3 = 93 + 33 = 729 + 27 = 756
A
54. State whether the following statements are true or false. Justify.
(i) For an arbitrary binary operation * on a set N, a * a = a ∀ a * N.
(ii) If * is a commutative binary operation on N, then a * (b * c) = (c * b) * a
54. State whether the following statements are true or false. Justify.
(i) For an arbitrary binary operation * on a set N, a * a = a ∀ a * N.
(ii) If * is a commutative binary operation on N, then a * (b * c) = (c * b) * a
(i) Define an operation * on N as:
a * b = a + b a, b ∈ N
Then, in particular, for b = a = 3, we have:
3 * 3 = 3 + 3 = 6 ≠ 3
Therefore, statement (i) is false.
(ii) R.H.S. = (c * b) * a
= (b * c) * a [* is commutative]
= a * (b * c) [Again, as * is commutative]
= L.H.S.
∴ a * (b * c) = (c * b) * a
The
53. Let A = N × N and * be the binary operation on A defined by
(a, b) * (c, d) = (a + c, b + d)
Show that * is commutative and associative. Find the identity element for * on A, if any.
53. Let A = N × N and * be the binary operation on A defined by
(a, b) * (c, d) = (a + c, b + d)
Show that * is commutative and associative. Find the identity element for * on A, if any.
A = N × N
* is a binary operation on A and is defined by:
(a, b) * (c, d) = (a + c, b + d)
Let (a, b), (c, d) ∈ A
Then, a, b, c, d ∈ N
We have:
(a, b) * (c, d) = (a + c, b + d)
(c, d) * (a, b) = (c + a, d + b) = (a + c, b + d)
[Addition is commutative in the set of natural numbers]
∴(a, b) * (c, d) = (
24. Find the range of each of the following functions.
(i) f (x) = 2 – 3x, x R, x > 0.
(ii) f (x) = x2+ 2, x is a real number.
(iii) f (x) = x, x is a real number.
24. Find the range of each of the following functions.
(i) f (x) = 2 – 3x, x R, x > 0.
(ii) f (x) = x2+ 2, x is a real number.
(iii) f (x) = x, x is a real number.
24. (i) f(x)=2 – 3x, x R, x>0.
Given, x>0
3x>3 × 0
3x>0
(–1) × 3x<(–1) × 0.
–3x<0
2 – 3x<0+2
2 – 3x<2
i.e., f(x) < 2
Hene, range of f(x) = (– ?, 2)
(ii) Given, f(x) = x2+2, x is a real number.
Since, x is a real number,
x2 ≥ 0 (x2=0 for x=0)
x2+2 ≥ 0+2
x2+2 ≥ 2
f(x) ≥ 2
?Range of f(x) = [2, ?)
(iii) Given, f(x