Drexel dragonThe Math ForumDonate to the Math Forum

Search All of the Math Forum:

Views expressed in these public forums are not endorsed by Drexel University or The Math Forum.

Math Forum » Discussions » sci.math.* » sci.math

Topic: unique ordering
Replies: 9   Last Post: May 10, 2014 1:16 PM

Advanced Search

Back to Topic List Back to Topic List Jump to Tree View Jump to Tree View   Messages: [ Previous | Next ]

Posts: 8,833
Registered: 1/6/11
Re: unique ordering
Posted: May 10, 2014 12:13 PM
  Click to see the message monospaced in plain text Plain Text   Click to reply to this topic Reply

In article <0acdace5-c53a-4ca4-a474-200d90f2ef4f@googlegroups.com>,
radams2000@gmail.com wrote:

> Thought experiment:
> Lets say that I randomly draw N letters out of a Scrabble letter-bag. I will
> then place those letters in a horizontal line on a table. How many UNIQUE
> patterns of letters can I produce? If there were no duplicates it would be
> easy (N factorial) but when there are duplicate letters it seems more
> complicated.
> Bob

First calculate the value for all different letters, N factorial.
Then for each maximal set of n repeated letters, n > 1,
divide by n factorial.

Point your RSS reader here for a feed of the latest messages in this topic.

[Privacy Policy] [Terms of Use]

© Drexel University 1994-2015. All Rights Reserved.
The Math Forum is a research and educational enterprise of the Drexel University School of Education.