Let A = { a, b,c } and B = {1, 2, 3, 4} . Then the number of elements in the set C = { f : `A to B |2 in f(A) ` and f is not one-one } is

Let A={a, b, c} and B={-2, -1, 0 ,1 ,2} .Write the total number of one-to-one functions from set A to set B .

Let A={-1, 0, 1} and B = {1, 2, 3, 4}. If f is the rule associating elements of A to elements of B, such that f(-1) = 2, f(0) = 1 and f(1) = 4. Does f define a mapping?

If A = {1, 2, 3, 4} and B= {1, 2, 3, 4, 5, 6} are two sets and function F: A to B is defined by f(x) = x+2, AA x in A , then prove that the function is one-one and into.

Let A={1,2,3}, B.:= {4, 5, 6,7}, and f = {(1, 4), (2,5), (3, 6) be function from A to B state whether the function f is one-one or not.

Let f(x) and g(x) be one-one onto functions where f : {a,b,c,d} rarr {1,2,3,4} and g : {3,4,5,6} rarr {w,x,y,z} respectively. The number of elements in the range set of g (f(x)) are

Let A={a,b,c} and B={1,2,3} . Let f : A rarr B be a function where f= {(a,1),(b,2),(c,3)} Find f^-1 , if exists in each case.

Let A={a,b,c} and B={1,2,3} . Let f : A rarr B be a function where f= {(a,2),(b,1),(c,1)} Find f^-1 , if exists in each case.

Let A = {1, 2, 3} , B = {4, 5, 6, 7} and let f = {(1, 4), (2, 5), (3, 6)} be a function from A to B. Show that f is one-one.

Let A = {1, 2, 3}, B = {4, 5, 6, 7} and let f = {(1, 4), (2, 5), (3, 6)} be a function from A to B. Show that f is one-one.