Home
Class 12
MATHS
Let n(A) = n, then the number of all rel...

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

A

`2^(n)`

B

`2^(n!)`

C

`2^(n^(2))`

D

None of these

Text Solution

Verified by Experts

The correct Answer is:
C
Promotional Banner

Similar Questions

Explore conceptually related problems

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)) .

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

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

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!.

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

Let (S) denotes the number of ordered pairs (x,y) satisfying (1)/(x)+(1)/(y)=(1)/(n),x,y,n in N . Q. sum_(r=1)^(10)S(r) equals

Let T_n be the number of all possible triangles formed by joining vertices of an n - sided regular polygon . If T_(n+1)-T_n=10 , then the value of n is :

Let a_(n) denote the number of all n-digit numbers formed by the digits 0,1 or both such that no consecutive digits in them are 0. Let b_(n) be the number of such n-digit integers ending with digit 1 and let c_(n) be the number of such n-digit integers ending with digit 0. Which of the following is correct ?

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