Home
Class 12
MATHS
Statement-1 If a set A has n elements, t...

Statement-1 If a set A has n elements, then the number of binary relations on `A = n^(n^(2))`.
Statement-2 Number of possible relations from A to `A = 2^(n^(2))`.

A

Statement-1 is true, Statement-2 is true, Statement-2 is a correct explanation for Statement-1

B

Statement-1 is true, Statement-2 is true, Statement-2 is not a correct explanation for Statement-1

C

Statement-1 is true, Statement-2 is false

D

Statement-1 is false, Statement-2 is true

Text Solution

Verified by Experts

The correct Answer is:
B
Let
`A={a_(1), a_(2), a_(3), ..., a_(n)}`
Then, the number of binary relations on `A=n^((nxxn))=n^(n^(2))` and number of relations form `A" to "A=2^(nxxn)=2^(n^(2))`
Both statements are true but Statement-2 is not a correct explanation for Statement-1.
Promotional Banner

Similar Questions

Explore conceptually related problems

If a set has n elements then the total number of subsets of A is

Let n(A) = n, then the number of all relations on A, is

A set A has 5 element. Then the maximum number of relations on A (including empty relation) is

If n(A)=2 and total number of possible relations from set A to B is 1024, then n(B) is

Let A be the set with n elements. The number of onto functions from A to A is

If A={a,b,c}, B={m,n} find the number of relations from A to B.

A set contains (2 n+1) elements. The number of subsets of this set containing more than n elements is equal to

Let n(A) = m and n(B) = n. Then the total number of non-empty relations that can be defined from A to B is

Statement-1: A convex quindecagon has 90 diagonals. Statement-2: Number of diagonals in a polygon is .^(n)C_(2)-n .

Statement-1: Number of permutations of 'n' dissimilar things taken 'n' at a time is n!. Statement-2: If n(A)=n(B)=n, then the total number of functions from A to B are n!.