Let `n(A)=m and n(B)=n` that the total number of non-empty relations that can be defined from A to B is
A
`m^(n) `
B
`n^(m) `
C
`2^(mn)-1`
D
`2^(mn)-1`
Text Solution
Verified by Experts
The correct Answer is:
B
Topper's Solved these Questions
SAMPLE PAPER -20 (UNSOLVED)
FULL MARKS|Exercise PART-II|14 Videos
SAMPLE PAPER -20 (UNSOLVED)
FULL MARKS|Exercise PART-III|13 Videos
SAMPLE PAPER -15 (UNSOLVED)
FULL MARKS|Exercise PART-IV|1 Videos
SAMPLE PAPER -3
FULL MARKS|Exercise PART - III|16 Videos
Similar Questions
Explore conceptually related problems
Let A={1,2,3} and B ={a,b} what is the number of non empty relations from A to B
If n (A) =5 and n(B ) =7 , then the number of relations on A xx B is
If n (A) =8: n(B) =2 then the total no. of relation that exists between A and B is :
If A and B are finite sets such this n(A) = p,n(B) =q , then the total no, of functions that exists between A and B is :
Let A and B be two sets having m and n elements respectively . Then total number of functions from A to B is
Let N be the set of natural numbers and the relation R be defined on N such that R={(x,y): y=2x,x,y in N }. what is the domain codomain and range of R ? Is this relation a functions ?
Let A be a set of n distinct elements. Then the total number of distinct function from AtoA is ______ and out of these, _____ are onto functions.
n_1a n dn_2 are four-digit numbers, find the total number of ways of forming n_1a n dn_2 so that n_2 can be subtracted from n_1 without borrowing at any stage.
Let A and B be two non empty sets. R be the relation for A to B . Then which is true?