Explore BrainMass

Explore BrainMass

    Distinguishable permutations of letters in a word

    Not what you're looking for? Search our solutions OR ask your own Custom question.

    This content was COPIED from BrainMass.com - View the original, and get the already-completed solution here!

    Find the number of distinguishable permutations of the letters in each word

    a. initial b. little c. decreed.

    © BrainMass Inc. brainmass.com March 5, 2021, 12:00 am ad1c9bdddf
    https://brainmass.com/math/combinatorics/distinguishable-permutations-letters-word-474661

    Solution Preview

    There are n! ways to rearrange n objects. If there are N objects in total, of which n1 identical objects of type 1, n2 of type 2,... nk of type k...etc., such that the different type of objects are distinguishable, then we can compute the number of distinguishable permutations as follows. Suppose the number of distinguishable permutations is p. Then suppose that the identical objects turn ...

    Solution Summary

    From the fact that there are N! ways to permute N distinct numbers, we explain how to compute the number of distinguishable permutations of letters in a word.

    $2.49

    ADVERTISEMENT