Home
Class 12
MATHS
Statement-1: Number of permutations of '...

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

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:
C
`because`Number of permutations of n dissimilar things taken n at a time `=.^(n)P_(n)=n!`
`therefore`Statement-1 is true and statement-2 is false [`because` number of function=`n^(n)`]
Promotional Banner

Similar Questions

Explore conceptually related problems

If n(A) = m and n(B) = n then numbers of function f: A rarr B are m.n .

n(A)= m, n (B) = n. The total number of non empty relation from A to B is……..

If n(A) = p and n (B) = q then numbers of non void relations from A to B are (2^(p+q)-1) .

Find the number of permutations of n distinct things taken r together, in which 3 parritcular things must occur together.

Let n(A)=5 and n(B)=3 then find the number of injective functions and onto functions from A to B .

If A= {1,2,3...,n} and B ={ a,b} Then , the number of subjection from A into B is .........

Let A={1,2,..., n} and B={a , b }. Then number of subjections from A into B is

Numbers of proper subsets of the set having n elements are 2^(n+1) -2,(n gt 1 in N)

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

Suppose A is a complex number and n in N , such that A^n=(A+1)^n=1, then the least value of n is 3 b. 6 c. 9 d. 12