Examples for

# Combinatorics

Combinatorics is a branch of mathematics dealing primarily with combinations, permutations and enumerations of elements of sets. It has practical applications ranging widely from studies of card games to studies of discrete structures. Wolfram|Alpha is well equipped for use analyzing counting problems of various kinds that are central to the field.

Factorials & Combinations

Work with factorials, binomial coefficients and related concepts.

#### Evaluate a double factorial binomial coefficient:

Integer Partitions

Compute or count the partitions of an integer. Add constraints, specifying the number of parts or part size.

#### Compute the number of partitions:

Combinatorial Functions

Learn about and do computations with combinatorial functions.

#### Compute Wigner coefficients:

Permutations

Compute, count or do algebra with permutations of a set.

#### Do algebra with permutations:

More examples
Integer Compositions

Compute or count the compositions of an integer. Put constraints, specifying the number of parts or part size.

#### Specify a constraint on the parts:

Latin Squares

Get information about, compute or count Latin squares.

### GO FURTHER

Step-by-Step Solutions for Discrete Mathematics

### RELATED EXAMPLES

• Graph Theory
• Integers
• Logic & Set Theory
• Probability
• Enumeration Problems

Solve a large variety of enumeration problems (also known as counting problems).