if n ( a ) for what value n ( b ) , function f of a to b bijective
Answers
Answered by
4
We know that given two sets A and B are mapped to form a function F: A →B is bijective only if n ( A) = n ( B) .
In the question we don't have n ( A) but we have been asked to find n ( B)
hence, n ( B) can be found in terms of n ( A) .
n ( B) = n ( A) .
hole helped!
In the question we don't have n ( A) but we have been asked to find n ( B)
hence, n ( B) can be found in terms of n ( A) .
n ( B) = n ( A) .
hole helped!
Deekshii1:
thq praneeth
Answered by
2
f : A -> B. A : Domain. B = Range.
A function f is bijective, if f is one-to-one and onto function. Then the function f^-1 (inverse of f) also exists.
For this to happen, the sizes (cardinality) of the domain A and range B must be equal.
So n(A) = n(B).
A function f is bijective, if f is one-to-one and onto function. Then the function f^-1 (inverse of f) also exists.
For this to happen, the sizes (cardinality) of the domain A and range B must be equal.
So n(A) = n(B).
Similar questions