$n$ objects are distributed at random among $n$ persons. The number of ways in which this can be done so that at least one of them will not get any object is

  • A
    $n! - n$
  • B
    $n^n - n$
  • C
    $n^n - n^2$
  • D
    $n^n - n!$

Explore More

Similar Questions

For a natural number $n$,the inequality $2^n(n - 1)! < n^n$ holds true if:

The number of permutations of all the letters $AAAABBBC$ in which all the $A$'s appear together in a block of $4$ letters or all the $B$'s appear together in a block of $3$ letters,is-

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

Difficult
View Solution

If $n$ is the number of ways five different employees can sit into four indistinguishable offices where any office may have any number of persons including zero,then $n$ is equal to:

If $n$ is an integer with $0 \leq n \leq 11$,then the minimum value of $n!(11-n)!$ is attained when a value of $n$ equals to

Vedclass Products

For Students

Vedclass Test Series

Mock tests in real JEE/NEET style with performance analysis. 5-day free trial.

Start Free Trial
For Teachers

Exam Paper Generator

Generate Set A/B/C/D exam papers from 7.5L+ questions in 2 minutes. 3 chapters free.

Try Free
For Institutes

Online Exam Module

Live online exams with unlimited students, 360° analytics & white-label branding.

See Demo