Math 2.0

definition

Combination

Definition

Let XX be a set and let kk be a natural number. A kk-combination of XX is a subset S⊆XS \subseteq X with ∣S∣=k|S| = k.

The set of all kk-combinations of XX is written (Xk)\binom{X}{k}.

Remarks

A combination does not record an order of its elements. Two lists with the same elements in a different order give the same combination. For X={a,b,c}X = \{a, b, c\}, the 2-combinations are {a,b}\{a, b\}, {a,c}\{a, c\} and {b,c}\{b, c\}. The number of k-element subsets of an nn-element set is the binomial coefficient (nk)\binom{n}{k}.

Explanations

L1 human

A combination is a selection of kk objects where the order does not matter. Choosing a team of 2 from Ann, Bob and Cy gives 3 teams, because the team {\{Ann, Bob}\} is the same as {\{Bob, Ann}\}.

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 depends on this

1 node uses this node, directly or through other nodes.

Sources

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