What is the function/equation for finding how many different permutations of a set are available?
What I mean is, if I have a set of 78 things, how can I easily find how many different ways they can be combined?
Right now all I have is the brute force x=n(o). Meaning that the number of permutations is equal to the number of things in the set times the previous number of permutations. So if there are three things in the set, the number of combinations of those things is equal to three times two. Two being the number of combinations available to a set consisting of two distinct things. And we continue, in that manner. As I said: Brute Force.
So, I'm pretty sure I know there has to be an easier way, but my math, she is not strong.
Help?
What I mean is, if I have a set of 78 things, how can I easily find how many different ways they can be combined?
Right now all I have is the brute force x=n(o). Meaning that the number of permutations is equal to the number of things in the set times the previous number of permutations. So if there are three things in the set, the number of combinations of those things is equal to three times two. Two being the number of combinations available to a set consisting of two distinct things. And we continue, in that manner. As I said: Brute Force.
So, I'm pretty sure I know there has to be an easier way, but my math, she is not strong.
Help?
no subject
Date: 2009-01-24 05:57 am (UTC)no subject
Date: 2009-01-24 06:06 am (UTC)I also want to know how many different ways I can arrange All 78 of them. For instance, I know that if there were only 12 of them it would be 479,001,600 different arrangements of all 12.
So, if you could give me an example of the function, in action?
no subject
Date: 2009-01-24 06:10 am (UTC)no subject
Date: 2009-01-24 06:15 am (UTC)no subject
Date: 2009-01-24 06:17 am (UTC)no subject
Date: 2009-01-24 06:26 am (UTC)no subject
Date: 2009-01-26 05:54 pm (UTC)no subject
Date: 2009-01-24 06:13 am (UTC)If order does NOT matter, and repetition is still not allowed, then it's 78C10=1,258,315,963,905
ETA: I'm assuming there's NO repetition, since each card only occurs once, and can only be drawn/placed once, yes?
no subject
Date: 2009-01-24 06:20 am (UTC)So, Precisely.
But I can never remember how to express things multiplied by "e". It always helps me to do these things the long way around.
How do I find out how many zeros that is?
no subject
Date: 2009-01-24 06:26 am (UTC)no subject
Date: 2009-01-24 04:29 pm (UTC)Mind you, this is such a large number that the calculator probably cut off the last five digits; they probably aren't zeroes. My memory is pretty shaky here, but Wikipedia (http://en.wikipedia.org/wiki/Combination) knows how to do it by hand, if you're really interested in finding those extra digits.
no subject
Date: 2009-01-24 04:48 pm (UTC)no subject
Date: 2009-01-24 04:54 pm (UTC)no subject
Date: 2009-01-24 06:07 am (UTC)no subject
Date: 2009-01-24 06:20 am (UTC)no subject
Date: 2009-01-24 06:22 am (UTC)