These calculation are the number of ways of obtaining an ordered and unordered subset of r elements from a set of n elements. n = the set size. It is the total number of items in the sample. r = the subset size. It is the number of items chosen from the sample. Only whole positive (integer) numbers are valid. Permutations gives the number of ways a subset of r items can be chosen out of a set of n items and different arrangements of the same items are also counted. Combinations gives the number of ways a subset of r items can be chosen out of a set of n items. For r <= n, n >= 0, and r >= 0. The permutations formula is (P(n,r) = n! / (n - r)!)... The combinations formula is (C(n,r) = n! / r! (n - r)!)...

NPR Permutations And NCR Combinations Calculator

This will calculate the permutations for P(n,r) = n! / (n - r)! and the combinations for C(n,r) = n! / r! (n - r)!.

View the source...

Registered® Trademark™ and Copyright© 1973 -
CSG, Computer Support Group, Inc. and CSGNetwork.Com All Rights Reserved |