Counting

From Rice Wiki
Revision as of 06:04, 19 March 2024 by Admin (talk | contribs) (Created page with "Category:Statistics '''Counting''' is the concepts relating to the total possible number (i.e. count) of ways to do something given a certain population. The common forms include combination and permutation. = The Fundamental Principle = The '''fundamental principle''' of counting states that given k operations are performed, if there are <math>n_i</math> ways to perform the i-th operation, then the ''total number of ways'' to perform the sequence of k operations is...")
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Counting is the concepts relating to the total possible number (i.e. count) of ways to do something given a certain population. The common forms include combination and permutation.

The Fundamental Principle

The fundamental principle of counting states that given k operations are performed, if there are ways to perform the i-th operation, then the total number of ways to perform the sequence of k operations is the product of all n. This makes sense so I'm not gonna elaborate.

Permutation

A permutation of a population is an ordering of a collection of objects. We calculate this with , and it makes sense so I'm not gonna elaborate.

Combinations

A combination of a population is a unique subset of it (i.e. a distinct group of objects). Notably different from permutations, the order does not matter.

The calculation is a bit complicated. Given items and items to insert, the total number of ways to select it can be calculated by the following:

Quick derivation: the numerator is the number of possible permutations, and the denominator is the number of ways to arrange a permutation. Since order don't matter, we remove the permutations with different ordering but the same observations.

For all this, just use a calculator.