Ncert Solutions Maths class 12th
Get insights from 2.5k questions on Ncert Solutions Maths class 12th, answered by students, alumni, and experts. You may also ask and answer any question you like about Ncert Solutions Maths class 12th
- 2.5k
Questions
- 0
Discussions
- 0
Active Users
- 65
Followers
Have a question about Ncert Solutions Maths class 12th? Ask our experts
Keep it short & simple. Type complete word. Avoid abusive language.
63. Given a non empty set X, consider P(X) which is the set of all subsets of X.
Define the relation R in P(X) as follows: For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)? Justify you answer:
63. Given a non empty set X, consider P(X) which is the set of all subsets of X.
Define the relation R in P(X) as follows: For subsets A, B in P(X), ARB if and only if A ⊂ B. Is R an equivalence relation on P(X)? Justify you answer:
Since every set is a subset of itself, ARA for all A ∈ P (X).
∴R is reflexive.
Let ARB ⇒ A ⊂ B.
This cannot be implied to B ⊂ A.
For instance, if A = {1, 2} and B = {1, 2, 3}, then it cannot be implied that B is related to A.
∴ R is not symmetric.
Further, if ARB and BRC, then A ⊂ B and B ⊂ C.
⇒ A ⊂ C
⇒
62. Given examples of two functions f: N → N and g: N → N such that gof is onto but f is not onto.
(Hint: Consider f(x) = x + 1 and
62. Given examples of two functions f: N → N and g: N → N such that gof is onto but f is not onto.
(Hint: Consider f(x) = x + 1 and
Define by
And, by,
We first show that g is not onto.
For this, consider element 1 in co-domain N. it is clear that this element is not an image of any of the elements in domain.
is not onto.
Now, is defined by,
Then, it is clear that for , there exists
61. Give examples of two functions f: N → Z and g: Z → Z such that g o f is injective but g is not injective.
(Hint: Consider f(x) = x and g(x) = |x| )
61. Give examples of two functions f: N → Z and g: Z → Z such that g o f is injective but g is not injective.
(Hint: Consider f(x) = x and g(x) = |x| )
Define as and as
We first show that g is not injective.
It can be observed that:
is not injective.
Now, is defined as
Let such that
Since , both are positive.
Hence, gof is injective
60. Show that the function f: R → R given by f(x) = x3 is injective.
60. Show that the function f: R → R given by f(x) = x3 is injective.
f: R → R is given as f (x) = x3.
Suppose f (x) = f (y), where x, y ∈ R.
⇒ x3 = y3 … (1)
Now, we need to show that x = y.
Suppose x ≠ y, their cubes will also not be equal.
⇒ x3 ≠ y3
However, this will be a contradiction to (1).
∴ x = y
Hence, f is injective.
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
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