D

Double counting (proof technique)

Technique for proving that two expressions are equal by showing that they both count the size of the same set

In combinatorics, double counting, also called counting in two ways, is a combinatorial proof technique for showing that two expressions are equal by demonstrating that they are two ways of counting the size of one set. In this technique, which van Lint & Wilson (2001) call "one of the most important tools in combinatorics", one describes a finite set from two perspectives leading to two distinct expressions for the size of the set.

Nº Q1191750 ★

Común · Historia

Double counting (proof technique)

Technique for proving that two expressions are equal by showing that they both count the size of the same set

Texto en inglés

In combinatorics, double counting, also called counting in two ways, is a combinatorial proof technique for showing that two expressions are equal by demonstrating that they are two ways of counting the size of one set. In this technique, which van Lint & Wilson (2001) call "one of the most important tools in combinatorics", one describes a finite set from two perspectives leading to two distinct expressions for the size of the set.

En Wikipedia

Texto en inglés Aún no hay artículo en tu idioma: extracto en inglés.

In combinatorics, double counting, also called counting in two ways, is a combinatorial proof technique for showing that two expressions are equal by demonstrating that they are two ways of counting the size of one set. In this technique, which van Lint & Wilson (2001) call "one of the most important tools in combinatorics", one describes a finite set from two perspectives leading to two distinct expressions for the size of the set. Since both expressions equal the size of the same set, they equal each other.

Texto: Wikipedia en inglés, CC BY-SA 4.0. ·

Cartas cercanas

Abrir

…

Confirmación