Math 2.0

statement theorem

Number of permutations

Statement

Let XX be a finite set with ∣X∣=n|X| = n. Then the number of permutations of XX is n!n!.

Remarks

For n=3n = 3 there are 3!=63! = 6 permutations of {1,2,3}\{1, 2, 3\}: 123123, 132132, 213213, 231231, 312312 and 321321. The count follows from the rule of product. The image of the first element has nn choices, the image of the second has n−1n - 1 choices, and so on. It is the case k=nk = n of the number of injections.

Explanations

L1 human

To arrange nn different objects in a row, you have nn choices for the first place, then n−1n - 1 for the second, and so on. The product of these numbers is n!n!.

What this node needs for W1
  • an inventory row: the row of the inventory that the node accounts for (0 of 1)

The writing levels say how complete the text of a node is. They do not measure its truth.

What this needs

To read this node, read these 4 nodes in this order. The foundations come first, and the list ends with this node.

Each node uses the nodes above it. The colour of the bar on a box shows the evidence level, and the box also gives it as text. The list below has the same nodes.
  • no evidence level
  1. Cardinality of a finite set definition
  2. Factorial definition
  3. Permutation definition
  4. Number of permutations statement

Sources

  1. Web https://en.wikipedia.org/wiki/Permutation, Permutations of totally ordered sets