A binomial coefficient calculator that allows you to calculate a binomial coefficient from two integers.

Binomial_coefficient online

In mathematics, the **binomial coefficient** of two integers n and k is the number `(n!)/(k!(n-k)!`, with `k<=n`. This number can be noted
`((n),(k))` or `C_n^k`.

The **binomial coefficient calculator** allows you to calculate a binomial coefficient from two integers.
To **calculate the binomial coefficient** of two numbers n and k, the calculator uses the following formula: `(n!)/(k!(n-k)!`.
The steps of the calculation are specified.

For example, to **calculate the binomial coefficient** of the following two integers 5 and 3, simply enter
binomial_coefficient(`5;3`),
and the calculator returns the result, which is 10.

The binomial coefficients intervene in particular in the
expansion of algebraic expression with Newton's binomial formula
or in probability with combinatorics or combinations.
One of the specific features of the **binomial coefficients calculator is to indicate the different calculation steps** that allow to find the result.

A binomial coefficient calculator that allows you to calculate a binomial coefficient from two integers.

See also :

- Arithmetic 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.