Derive a formula for the number of permutations of n


Question: a) Derive a formula for the number of permutations of n objects of k different types, where there are n1 indistinguishable objects of type one, n2 indistinguishable objects of type two,..., and nk indistinguishable objects of type k.

b) How many ways are there to order the letters of the word INDISCREETNESS?

Solution Preview :

Prepared by a verified Expert
Mathematics: Derive a formula for the number of permutations of n
Reference No:- TGS02367320

Now Priced at $10 (50% Discount)

Recommended (98%)

Rated (4.3/5)