To calculate the number of k elements of part of a set of n elements.

combination online

The calculator used to calculate online the **number of combination of a set of k elements from n elements**.
A **combination** of a set of k elements among n elements calculation as follows:
`"n!"/"p!(n-p)!"`. The sign ! represents the
factorial
function.
Ie the number of combination of a set of k among n elements elements equals the number of
permutation
divided by p!. This number of combination is the
binomial coefficient
.

- Calculating combination of a set

The calculator is able to **calculate the number of combination of a set** of k elements from n elements
with the results in exact form : for example, to calculate the number of combinations of a set of 3 elements from the 5 elements, enter
combination(`5;3`),
after calculation, the result is returned.

To calculate the number of k elements of part of a set of n elements.

See also

- Countdown maths solver : arithmetic_solver. This solver allows finding a target number from a set of integer in using arithmetic operations.
- Arrangement : arrangement. To calculate online the number of arrangement of p elements of a set of n elements.
- Base-n converter : base_converter. The calculator allows you to make decimal, binary, hexadecimal conversions, and more generally to any base n between 2 and 36.
- Calculation of binomial coefficients : binomial_coefficient. A binomial coefficient calculator that allows you to calculate a binomial coefficient from two integers.
- To count the number of combinations : combination. To calculate the number of k elements of part of a set of n elements.
- Euclidean division : euclidean_division. The euclidean_division function to calculate online the quotient and the remainder in the euclidean division of two polynomials or two integers.
- Factorial : factorial. Online factorial Calculator. The factorial of a natural number n is the product of the positive integers less than or equal to n.
- Gcd calculation online : gcd. GCD calculator that uses Euclid's algorithm to give the steps of the GCD calculation.
- Parity of a number : is_even. Is_even function returns 1 if the number is even, 0 otherwise.
- Parity of a number : is_odd. Is_odd function returns true if the number passed is odd, false otherwise.
- Least common multiple : lcm. LCM calculator to calculate the least common multiple (LCM).
- Permutation : permutation. To calculate online the number of permutation of a set of n elements.
- Prime factorization calculator : prime_factorization. The function prime_factorization is used to calculate online the decomposition of an integer into prime factors.
- Pythagorean theorem : pythagorean. The function makes it possible to verify by using the Pythagorean theorem knowing the lengths of the sides of a triangle that this is a right triangle. If the sides of the triangle depend on a variable, then the value of the variable is calculated so that the triangle is a right triangle.