Math 2.0

definition

Derangement

Definition

Let XX be a set. A derangement of XX is a permutation σ\sigma of XX such that σ(x)≠x\sigma(x) \neq x for all x∈Xx \in X. In other words, it is a permutation with no fixed point.

Remarks

The derangements of {1,2,3}\{1, 2, 3\} are 231231 and 312312 in one-line notation. The number of derangements of an nn-element set is written DnD_n or !n!n.

Explanations

L1 human

A derangement is a shuffle in which nothing stays in its place. Suppose that nn people leave their hats, and each person later takes a hat at random. A derangement is an outcome in which nobody gets their own hat.

What this node needs for W2
  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (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 2 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. Permutation definition
  2. Derangement definition

What depends on this

3 nodes use this node, directly or through other nodes.

Sources

  1. Web https://en.wikipedia.org/wiki/Derangement, lead section