Home
Class 12
MATHS
Let S = {a,b,c} and T = {1,2,3}. Find F^...

Let S = {a,b,c} and T = {1,2,3}. Find `F^-1` of the folowing functions F from S to T, if it exists. F = {(a,3), (b,2),(c,1)}

Promotional Banner

Topper's Solved these Questions

  • RELATIONS AND FUNCTION

    MODERN PUBLICATION|Exercise EXAMPLE|212 Videos
  • PROBABILITY

    MODERN PUBLICATION|Exercise EXERCISE|543 Videos
  • RELATIONS AND FUNCTIONS

    MODERN PUBLICATION|Exercise EXAMPLE|13 Videos

Similar Questions

Explore conceptually related problems

Let S = {a,b,c} and T = {1,2,3}. Find F^-1 of the folowing functions F from S to T, if it exists. F = (a,2),(b,1),(c,1)

Let S = {a, b, c} and T = {1, 2, 3} . Find F^–1 of the following functions F from S to T, if it exists: F={(a,3),(b,2),(c,1)}

Let S = {a, b, c} and T = {1, 2, 3} . Find F^–1 of the following functions F from S to T, if it exists: F={(a,2),(b,1),(c,1)}

Let E = {1, 2, 3, 4} and F = {1, 2}. Then the number of onto functions from E to F is :

Let f = {(1 ,1), (2, 3), (0, -1), (-1, -3)} be a linear function from Z into Z. Find f (x).

Let S = {1, 2, 3} Determine whether the functions f : S rarr S defined as below have inverses. Find f ^–1 , , if it exists: f = {(1,3), (3,2), (2,1)}

f and h are function from A rarr B, where A = {a, b, c, d} and B = {s, t, u} defined as follows f(a) = t, f (b) = s, f(c ) = s f(d) = u, h(a) = s, h(b) = t h(c ) = s, h(a) = u, h(d) = u Which one of the following statement is true?

Let S = {1,2,3}. Determine whether the function f: S rarr S defined below has inverse. Find f^-1 , if it exists: f= |(1,1),(2,2),(3,3)}

Let S = {1, 2, 3} Determine whether the functions f : S rarr S defined as below have inverses. Find f ^–1 , , if it exists: f = {(1,2), (2,1), (3,1)}

Let A = (a,b,c) and B = (p,q,r) and a function f : A rarrB be given by f = ((a,q), b,r), (c,p)) Is f invertible ? If so, find f^-1 and verify that f^-1 of = I_A and f of^-1 = I_B where I_A and I_B are identity fucnctions on A and B respectively.

MODERN PUBLICATION-RELATIONS AND FUNCTION-EXAMPLE
  1. Given a non - empty set, X , consider the binary operation ** : P(X) x...

    Text Solution

    |

  2. Find the number of all onto functions formthe set {1,2,3,….,n} to itse...

    Text Solution

    |

  3. Let S = {a,b,c} and T = {1,2,3}. Find F^-1 of the folowing functions F...

    Text Solution

    |

  4. Let S = {a,b,c} and T = {1,2,3}. Find F^-1 of the folowing functions F...

    Text Solution

    |

  5. Consider the binary operations * : RxxRrarrR and o : RxxRrarrR define...

    Text Solution

    |

  6. Given a non-empty set X, let * : P(X)xxP(X)rarrP(X), be defined as A *...

    Text Solution

    |

  7. Define a binary operation * on the set {0,1,2,3,4,5} as a*b = {:{(a+...

    Text Solution

    |

  8. Let A = {– 1, 0, 1, 2}, B = {– 4, – 2, 0, 2} and f, g : A rarr B, be f...

    Text Solution

    |

  9. Let A = {1, 2, 3}. Then number of relations containing (1, 2) and (1, ...

    Text Solution

    |

  10. Let A = {1, 2, 3} Then number of equivalence relations containing (1,...

    Text Solution

    |

  11. Let f : R to R be the signum function defined as f(x) = {{:(1, x gt 0...

    Text Solution

    |

  12. Number of binary operations on theset (a,b) is

    Text Solution

    |

  13. Show that if A= { 1,2,3} and R ={(1,1),(2,2),(3,3) (1,2),(2,1),(2,3),...

    Text Solution

    |

  14. Let R be the quivalence relation in the set Z of integerx given by: R ...

    Text Solution

    |

  15. If A = {1,2,3} and f,g are relations corresponding to the subset of A ...

    Text Solution

    |

  16. On the set N of all natural numbers, a relation R is defined as follow...

    Text Solution

    |

  17. Show that the function f : R rarr R defined by : f(x) = x/(x^2+1) AA ...

    Text Solution

    |

  18. Let A = (0,1,2,3) and define a relation R on A as follows R = (0,0),(0...

    Text Solution

    |

  19. Let A = (1,2,3,……….,9) and R be the relation in AxxA defined by (a,b) ...

    Text Solution

    |

  20. If f = (5,2),(6,3), g = (2,5),(3,6), write fog.

    Text Solution

    |