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

Topper's Solved these Questions

  • PERMUTATIONS AND COMBINATIONS

    ARIHANT MATHS|Exercise Exercise (Subjective Type Questions)|17 Videos

  • PERMUTATIONS AND COMBINATIONS

    ARIHANT MATHS|Exercise Exercise (Questions Asked In Previous 13 Years Exam)|28 Videos

  • PERMUTATIONS AND COMBINATIONS

    ARIHANT MATHS|Exercise Permutations and Combinations Exercise 5: Matching Type Questions|3 Videos

  • PARABOLA

    ARIHANT MATHS|Exercise Exercise (Questions Asked In Previous 13 Years Exam)|35 Videos

  • PROBABILITY

    ARIHANT MATHS|Exercise Exercise (Questions Asked In Previous 13 Years Exam)|55 Videos

Similar Questions

Explore conceptually related problems

If n(A) = 5 and n (B) = 7, then the number of relations on A*B is

The number of bijective functions from A to B if n(A)=n(B)=4

Find the number of permutations of n different things taken r at a time such that 3 specific things occur together ?

Find the number of permutations of n things taken r at a time in which two particular things : never occur.

Find the number of permutations of n things taken r at a time in which two particular things : always occur.

Find the number of permutations of n things, taken r at a time, in which 3 particular things : always occur.

Find the number of permutations of n things, taken r at a time, in which 3 particular things : will never occur.

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

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

Calculate the total number of spectral lines in balmer series from n1 = 2 and n2 = 5.