Get it on Google Play
New! Download Unionpedia on your Android™ device!
Faster access than browser!

Binomial coefficient

Index Binomial coefficient

In mathematics, any of the positive integers that occurs as a coefficient in the binomial theorem is a binomial coefficient. [1]

122 relations: Almost all, American Mathematical Monthly, American Mathematical Society, Andreas von Ettingshausen, Andrew Granville, APL (programming language), Axiom of choice, Beta function, Bhāskara II, Binary entropy function, Binary number, Binomial (polynomial), Binomial distribution, Binomial theorem, Binomial transform, Bit, C (programming language), Cardinal number, Cardinality, Catalan number, Central binomial coefficient, Characteristic (algebra), Coefficient, Combination, Combinatorial proof, Combinatorics, Commutative ring, Computer terminal, David Singmaster, Delannoy number, Derivative, Differential equation, Dixon's identity, Double counting (proof technique), Ernst Kummer, Euler's formula, Euler–Mascheroni constant, Eulerian number, Exponentiation, Factorial, Falling and rising factorials, Fibonacci number, Field (mathematics), Finite difference, Formal power series, Fractional part, Gamma function, Gaussian binomial coefficient, Generating function, German tank problem, ..., Greatest common divisor, Halayudha, Harmonic number, Hockey-stick identity, Hypergeometric function, Integer, Integer-valued polynomial, Isaac Newton, J (programming language), Java (programming language), Julia (programming language), Kummer's theorem, Līlāvatī, List of factorial and binomial topics, Logarithmic differentiation, Lucas's theorem, Mathematical Association of America, Mathematical induction, Mathematics, Mathematics Magazine, MATLAB, Maxima (software), Monomial, Motzkin number, Multinomial theorem, Multiset, Narayana number, Natural logarithm, Natural number, Nørlund–Rice integral, Neurocomputing (journal), Newton polynomial, PARI/GP, Partial fraction decomposition, Pascal's rule, Pascal's triangle, Permutation, Pingala, Polynomial, Polynomial expansion, Power set, Programming language, Python (programming language), Q-analog, R (programming language), Radius of convergence, Rational number, Recurrence relation, Recursion, Sanskrit, Scheme (programming language), SciPy, Series (mathematics), Series multisection, Singmaster's conjecture, Society for Industrial and Applied Mathematics, Star of David theorem, Statistics, Stirling numbers of the first kind, Stirling's approximation, String (computer science), Subroutine, Sun's curious identity, Table of Newtonian series, Taylor series, Taylor's theorem, Trigonometric functions, Trinomial expansion, Typewriter, Vandermonde's identity, Wolfram Mathematica, Zeckendorf's theorem. Expand index (72 more) »

Almost all

In mathematics, the term "almost all" means "all but a negligible amount".

New!!: Binomial coefficient and Almost all · See more »

American Mathematical Monthly

The American Mathematical Monthly is a mathematical journal founded by Benjamin Finkel in 1894.

New!!: Binomial coefficient and American Mathematical Monthly · See more »

American Mathematical Society

The American Mathematical Society (AMS) is an association of professional mathematicians dedicated to the interests of mathematical research and scholarship, and serves the national and international community through its publications, meetings, advocacy and other programs.

New!!: Binomial coefficient and American Mathematical Society · See more »

Andreas von Ettingshausen

Andreas Freiherr von Ettingshausen (25 November 1796 – 25 May 1878) was a German mathematician and physicist.

New!!: Binomial coefficient and Andreas von Ettingshausen · See more »

Andrew Granville

Andrew James Granville (born 7 September 1962) is a British mathematician, working in the field of number theory.

New!!: Binomial coefficient and Andrew Granville · See more »

APL (programming language)

APL (named after the book A Programming Language) is a programming language developed in the 1960s by Kenneth E. Iverson.

New!!: Binomial coefficient and APL (programming language) · See more »

Axiom of choice

In mathematics, the axiom of choice, or AC, is an axiom of set theory equivalent to the statement that the Cartesian product of a collection of non-empty sets is non-empty.

New!!: Binomial coefficient and Axiom of choice · See more »

Beta function

In mathematics, the beta function, also called the Euler integral of the first kind, is a special function defined by for.

New!!: Binomial coefficient and Beta function · See more »

Bhāskara II

Bhāskara (also known as Bhāskarāchārya ("Bhāskara, the teacher"), and as Bhaskara II to avoid confusion with Bhāskara I) (1114–1185), was an Indian mathematician and astronomer.

New!!: Binomial coefficient and Bhāskara II · See more »

Binary entropy function

In information theory, the binary entropy function, denoted \operatorname H(p) or \operatorname H_\text(p), is defined as the entropy of a Bernoulli process with probability p of one of two values.

New!!: Binomial coefficient and Binary entropy function · See more »

Binary number

In mathematics and digital electronics, a binary number is a number expressed in the base-2 numeral system or binary numeral system, which uses only two symbols: typically 0 (zero) and 1 (one).

New!!: Binomial coefficient and Binary number · See more »

Binomial (polynomial)

In algebra, a binomial is a polynomial that is the sum of two terms, each of which is a monomial.

New!!: Binomial coefficient and Binomial (polynomial) · See more »

Binomial distribution

In probability theory and statistics, the binomial distribution with parameters n and p is the discrete probability distribution of the number of successes in a sequence of n independent experiments, each asking a yes–no question, and each with its own boolean-valued outcome: a random variable containing a single bit of information: success/yes/true/one (with probability p) or failure/no/false/zero (with probability q.

New!!: Binomial coefficient and Binomial distribution · See more »

Binomial theorem

In elementary algebra, the binomial theorem (or binomial expansion) describes the algebraic expansion of powers of a binomial.

New!!: Binomial coefficient and Binomial theorem · See more »

Binomial transform

In combinatorics, the binomial transform is a sequence transformation (i.e., a transform of a sequence) that computes its forward differences.

New!!: Binomial coefficient and Binomial transform · See more »


The bit (a portmanteau of binary digit) is a basic unit of information used in computing and digital communications.

New!!: Binomial coefficient and Bit · See more »

C (programming language)

C (as in the letter ''c'') is a general-purpose, imperative computer programming language, supporting structured programming, lexical variable scope and recursion, while a static type system prevents many unintended operations.

New!!: Binomial coefficient and C (programming language) · See more »

Cardinal number

In mathematics, cardinal numbers, or cardinals for short, are a generalization of the natural numbers used to measure the cardinality (size) of sets.

New!!: Binomial coefficient and Cardinal number · See more »


In mathematics, the cardinality of a set is a measure of the "number of elements of the set".

New!!: Binomial coefficient and Cardinality · See more »

Catalan number

In combinatorial mathematics, the Catalan numbers form a sequence of natural numbers that occur in various counting problems, often involving recursively-defined objects.

New!!: Binomial coefficient and Catalan number · See more »

Central binomial coefficient

In mathematics the nth central binomial coefficient is the particular binomial coefficient They are called central since they show up exactly in the middle of the even-numbered rows in Pascal's triangle.

New!!: Binomial coefficient and Central binomial coefficient · See more »

Characteristic (algebra)

In mathematics, the characteristic of a ring R, often denoted char(R), is defined to be the smallest number of times one must use the ring's multiplicative identity (1) in a sum to get the additive identity (0) if the sum does indeed eventually attain 0.

New!!: Binomial coefficient and Characteristic (algebra) · See more »


In mathematics, a coefficient is a multiplicative factor in some term of a polynomial, a series or any expression; it is usually a number, but may be any expression.

New!!: Binomial coefficient and Coefficient · See more »


In mathematics, a combination is a selection of items from a collection, such that (unlike permutations) the order of selection does not matter.

New!!: Binomial coefficient and Combination · See more »

Combinatorial proof

In mathematics, the term combinatorial proof is often used to mean either of two types of mathematical proof.

New!!: Binomial coefficient and Combinatorial proof · See more »


Combinatorics is an area of mathematics primarily concerned with counting, both as a means and an end in obtaining results, and certain properties of finite structures.

New!!: Binomial coefficient and Combinatorics · See more »

Commutative ring

In ring theory, a branch of abstract algebra, a commutative ring is a ring in which the multiplication operation is commutative.

New!!: Binomial coefficient and Commutative ring · See more »

Computer terminal

A computer terminal is an electronic or electromechanical hardware device that is used for entering data into, and displaying or printing data from, a computer or a computing system.

New!!: Binomial coefficient and Computer terminal · See more »

David Singmaster

David Breyer Singmaster (born 1939, USA) is a retired professor of mathematics at London South Bank University, England, UK.

New!!: Binomial coefficient and David Singmaster · See more »

Delannoy number

In mathematics, a Delannoy number D describes the number of paths from the southwest corner (0, 0) of a rectangular grid to the northeast corner (m, n), using only single steps north, northeast, or east.

New!!: Binomial coefficient and Delannoy number · See more »


The derivative of a function of a real variable measures the sensitivity to change of the function value (output value) with respect to a change in its argument (input value).

New!!: Binomial coefficient and Derivative · See more »

Differential equation

A differential equation is a mathematical equation that relates some function with its derivatives.

New!!: Binomial coefficient and Differential equation · See more »

Dixon's identity

In mathematics, Dixon's identity (or Dixon's theorem or Dixon's formula) is any of several different but closely related identities proved by A. C. Dixon, some involving finite sums of products of three binomial coefficients, and some evaluating a hypergeometric sum.

New!!: Binomial coefficient and Dixon's identity · See more »

Double counting (proof technique)

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.

New!!: Binomial coefficient and Double counting (proof technique) · See more »

Ernst Kummer

Ernst Eduard Kummer (29 January 1810 – 14 May 1893) was a German mathematician.

New!!: Binomial coefficient and Ernst Kummer · See more »

Euler's formula

Euler's formula, named after Leonhard Euler, is a mathematical formula in complex analysis that establishes the fundamental relationship between the trigonometric functions and the complex exponential function.

New!!: Binomial coefficient and Euler's formula · See more »

Euler–Mascheroni constant

The Euler–Mascheroni constant (also called Euler's constant) is a mathematical constant recurring in analysis and number theory, usually denoted by the lowercase Greek letter gamma.

New!!: Binomial coefficient and Euler–Mascheroni constant · See more »

Eulerian number

In combinatorics, the Eulerian number A(n, m), is the number of permutations of the numbers 1 to n in which exactly m elements are greater than the previous element (permutations with m "ascents").

New!!: Binomial coefficient and Eulerian number · See more »


Exponentiation is a mathematical operation, written as, involving two numbers, the base and the exponent.

New!!: Binomial coefficient and Exponentiation · See more »


In mathematics, the factorial of a non-negative integer n, denoted by n!, is the product of all positive integers less than or equal to n. For example, The value of 0! is 1, according to the convention for an empty product.

New!!: Binomial coefficient and Factorial · See more »

Falling and rising factorials

In mathematics, the falling factorial (sometimes called the descending factorial, falling sequential product, or lower factorial) is defined as The rising factorial (sometimes called the Pochhammer function, Pochhammer polynomial, ascending factorial, (A reprint of the 1950 edition by Chelsea Publishing Co.) rising sequential product, or upper factorial) is defined as The value of each is taken to be 1 (an empty product) when n.

New!!: Binomial coefficient and Falling and rising factorials · See more »

Fibonacci number

In mathematics, the Fibonacci numbers are the numbers in the following integer sequence, called the Fibonacci sequence, and characterized by the fact that every number after the first two is the sum of the two preceding ones: Often, especially in modern usage, the sequence is extended by one more initial term: By definition, the first two numbers in the Fibonacci sequence are either 1 and 1, or 0 and 1, depending on the chosen starting point of the sequence, and each subsequent number is the sum of the previous two.

New!!: Binomial coefficient and Fibonacci number · See more »

Field (mathematics)

In mathematics, a field is a set on which addition, subtraction, multiplication, and division are defined, and behave as when they are applied to rational and real numbers.

New!!: Binomial coefficient and Field (mathematics) · See more »

Finite difference

A finite difference is a mathematical expression of the form.

New!!: Binomial coefficient and Finite difference · See more »

Formal power series

In mathematics, a formal power series is a generalization of a polynomial, where the number of terms is allowed to be infinite; this implies giving up the possibility of replacing the variable in the polynomial with an arbitrary number.

New!!: Binomial coefficient and Formal power series · See more »

Fractional part

The fractional part or decimal part of a non‐negative real number x is the excess beyond that number's integer part.

New!!: Binomial coefficient and Fractional part · See more »

Gamma function

In mathematics, the gamma function (represented by, the capital Greek alphabet letter gamma) is an extension of the factorial function, with its argument shifted down by 1, to real and complex numbers.

New!!: Binomial coefficient and Gamma function · See more »

Gaussian binomial coefficient

In mathematics, the Gaussian binomial coefficients (also called Gaussian coefficients, Gaussian polynomials, or q-binomial coefficients) are ''q''-analogs of the binomial coefficients.

New!!: Binomial coefficient and Gaussian binomial coefficient · See more »

Generating function

In mathematics, a generating function is a way of encoding an infinite sequence of numbers (an) by treating them as the coefficients of a power series.

New!!: Binomial coefficient and Generating function · See more »

German tank problem

In the statistical theory of estimation, the German tank problem consists in estimating the maximum of a discrete uniform distribution from sampling without replacement.

New!!: Binomial coefficient and German tank problem · See more »

Greatest common divisor

In mathematics, the greatest common divisor (gcd) of two or more integers, which are not all zero, is the largest positive integer that divides each of the integers.

New!!: Binomial coefficient and Greatest common divisor · See more »


Halayudha (Sanskrit: हलायुध) was a 10th-century Indian mathematician who wrote the, a commentary on Pingala's Chandaḥśāstra.

New!!: Binomial coefficient and Halayudha · See more »

Harmonic number

In mathematics, the -th harmonic number is the sum of the reciprocals of the first natural numbers: Harmonic numbers are related to the harmonic mean in that the -th harmonic number is also times the reciprocal of the harmonic mean of the first positive integers.

New!!: Binomial coefficient and Harmonic number · See more »

Hockey-stick identity

In combinatorial mathematics, the identity is known as the hockey-stick or Christmas stocking identity.

New!!: Binomial coefficient and Hockey-stick identity · See more »

Hypergeometric function

In mathematics, the Gaussian or ordinary hypergeometric function 2F1(a,b;c;z) is a special function represented by the hypergeometric series, that includes many other special functions as specific or limiting cases.

New!!: Binomial coefficient and Hypergeometric function · See more »


An integer (from the Latin ''integer'' meaning "whole")Integer 's first literal meaning in Latin is "untouched", from in ("not") plus tangere ("to touch").

New!!: Binomial coefficient and Integer · See more »

Integer-valued polynomial

In mathematics, an integer-valued polynomial (also known as a numerical polynomial) P(t) is a polynomial whose value P(n) is an integer for every integer n. Every polynomial with integer coefficients is integer-valued, but the converse is not true.

New!!: Binomial coefficient and Integer-valued polynomial · See more »

Isaac Newton

Sir Isaac Newton (25 December 1642 – 20 March 1726/27) was an English mathematician, astronomer, theologian, author and physicist (described in his own day as a "natural philosopher") who is widely recognised as one of the most influential scientists of all time, and a key figure in the scientific revolution.

New!!: Binomial coefficient and Isaac Newton · See more »

J (programming language)

The J programming language, developed in the early 1990s by Kenneth E. Iverson and Roger Hui, is a synthesis of APL (also by Iverson) and the FP and FL function-level languages created by John Backus.

New!!: Binomial coefficient and J (programming language) · See more »

Java (programming language)

Java is a general-purpose computer-programming language that is concurrent, class-based, object-oriented, and specifically designed to have as few implementation dependencies as possible.

New!!: Binomial coefficient and Java (programming language) · See more »

Julia (programming language)

Julia is a high-level dynamic programming language designed to address the needs of high-performance numerical analysis and computational science, without the typical need of separate compilation to be fast, while also being effective for general-purpose programming, web use or as a specification language.

New!!: Binomial coefficient and Julia (programming language) · See more »

Kummer's theorem

In mathematics, Kummer's theorem for binomial coefficients gives the ''p''-adic valuation of a binomial coefficient, i.e., the exponent of the highest power of a prime number p dividing this binomial coefficient.

New!!: Binomial coefficient and Kummer's theorem · See more »


The Līlāvatī is Indian mathematician Bhāskara II's treatise on mathematics, written in 1150.

New!!: Binomial coefficient and Līlāvatī · See more »

List of factorial and binomial topics

This is a list of factorial and binomial topics in mathematics.

New!!: Binomial coefficient and List of factorial and binomial topics · See more »

Logarithmic differentiation

In calculus, logarithmic differentiation or differentiation by taking logarithms is a method used to differentiate functions by employing the logarithmic derivative of a function f, The technique is often performed in cases where it is easier to differentiate the logarithm of a function rather than the function itself.

New!!: Binomial coefficient and Logarithmic differentiation · See more »

Lucas's theorem

In number theory, Lucas's theorem expresses the remainder of division of the binomial coefficient \tbinom by a prime number p in terms of the base p expansions of the integers m and n. Lucas's theorem first appeared in 1878 in papers by Édouard Lucas.

New!!: Binomial coefficient and Lucas's theorem · See more »

Mathematical Association of America

The Mathematical Association of America (MAA) is a professional society that focuses on mathematics accessible at the undergraduate level.

New!!: Binomial coefficient and Mathematical Association of America · See more »

Mathematical induction

Mathematical induction is a mathematical proof technique.

New!!: Binomial coefficient and Mathematical induction · See more »


Mathematics (from Greek μάθημα máthēma, "knowledge, study, learning") is the study of such topics as quantity, structure, space, and change.

New!!: Binomial coefficient and Mathematics · See more »

Mathematics Magazine

Mathematics Magazine is a refereed bimonthly publication of the Mathematical Association of America.

New!!: Binomial coefficient and Mathematics Magazine · See more »


MATLAB (matrix laboratory) is a multi-paradigm numerical computing environment and proprietary programming language developed by MathWorks.

New!!: Binomial coefficient and MATLAB · See more »

Maxima (software)

Maxima is a computer algebra system (CAS) based on a 1982 version of Macsyma.

New!!: Binomial coefficient and Maxima (software) · See more »


In mathematics, a monomial is, roughly speaking, a polynomial which has only one term.

New!!: Binomial coefficient and Monomial · See more »

Motzkin number

In mathematics, a Motzkin number for a given number is the number of different ways of drawing non-intersecting chords between points on a circle (not necessarily touching every point by a chord).

New!!: Binomial coefficient and Motzkin number · See more »

Multinomial theorem

In mathematics, the multinomial theorem describes how to expand a power of a sum in terms of powers of the terms in that sum.

New!!: Binomial coefficient and Multinomial theorem · See more »


In mathematics, a multiset (aka bag or mset) is a modification of the concept of a set that, unlike a set, allows for multiple instances for each of its elements.

New!!: Binomial coefficient and Multiset · See more »

Narayana number

In combinatorics, the Narayana numbers N(n, k), n.

New!!: Binomial coefficient and Narayana number · See more »

Natural logarithm

The natural logarithm of a number is its logarithm to the base of the mathematical constant ''e'', where e is an irrational and transcendental number approximately equal to.

New!!: Binomial coefficient and Natural logarithm · See more »

Natural number

In mathematics, the natural numbers are those used for counting (as in "there are six coins on the table") and ordering (as in "this is the third largest city in the country").

New!!: Binomial coefficient and Natural number · See more »

Nørlund–Rice integral

In mathematics, the Nørlund–Rice integral, sometimes called Rice's method, relates the nth forward difference of a function to a line integral on the complex plane.

New!!: Binomial coefficient and Nørlund–Rice integral · See more »

Neurocomputing (journal)

Neurocomputing publishes articles in the field of neural networks and machine learning.

New!!: Binomial coefficient and Neurocomputing (journal) · See more »

Newton polynomial

In the mathematical field of numerical analysis, a Newton polynomial, named after its inventor Isaac Newton, is an interpolation polynomial for a given set of data points.

New!!: Binomial coefficient and Newton polynomial · See more »


PARI/GP is a computer algebra system with the main aim of facilitating number theory computations.

New!!: Binomial coefficient and PARI/GP · See more »

Partial fraction decomposition

In algebra, the partial fraction decomposition or partial fraction expansion of a rational function (that is, a fraction such that the numerator and the denominator are both polynomials) is the operation that consists in expressing the fraction as a sum of a polynomial (possibly zero) and one or several fractions with a simpler denominator.

New!!: Binomial coefficient and Partial fraction decomposition · See more »

Pascal's rule

In mathematics, Pascal's rule is a combinatorial identity about binomial coefficients.

New!!: Binomial coefficient and Pascal's rule · See more »

Pascal's triangle

In mathematics, Pascal's triangle is a triangular array of the binomial coefficients.

New!!: Binomial coefficient and Pascal's triangle · See more »


In mathematics, the notion of permutation relates to the act of arranging all the members of a set into some sequence or order, or if the set is already ordered, rearranging (reordering) its elements, a process called permuting.

New!!: Binomial coefficient and Permutation · See more »


Pingala (Devanagari: पिङ्गल) (c. 3rd/2nd century BC) was an ancient Indian mathematician who authored the (also called Pingala-sutras), the earliest known treatise on Sanskrit prosody.

New!!: Binomial coefficient and Pingala · See more »


In mathematics, a polynomial is an expression consisting of variables (also called indeterminates) and coefficients, that involves only the operations of addition, subtraction, multiplication, and non-negative integer exponents of variables.

New!!: Binomial coefficient and Polynomial · See more »

Polynomial expansion

In mathematics, an expansion of a product of sums expresses it as a sum of products by using the fact that multiplication distributes over addition.

New!!: Binomial coefficient and Polynomial expansion · See more »

Power set

In mathematics, the power set (or powerset) of any set is the set of all subsets of, including the empty set and itself, variously denoted as, 𝒫(), ℘() (using the "Weierstrass p"),,, or, identifying the powerset of with the set of all functions from to a given set of two elements,.

New!!: Binomial coefficient and Power set · See more »

Programming language

A programming language is a formal language that specifies a set of instructions that can be used to produce various kinds of output.

New!!: Binomial coefficient and Programming language · See more »

Python (programming language)

Python is an interpreted high-level programming language for general-purpose programming.

New!!: Binomial coefficient and Python (programming language) · See more »


In mathematics, a q-analog of a theorem, identity or expression is a generalization involving a new parameter q that returns the original theorem, identity or expression in the limit as.

New!!: Binomial coefficient and Q-analog · See more »

R (programming language)

R is a programming language and free software environment for statistical computing and graphics that is supported by the R Foundation for Statistical Computing.

New!!: Binomial coefficient and R (programming language) · See more »

Radius of convergence

In mathematics, the radius of convergence of a power series is the radius of the largest disk in which the series converges.

New!!: Binomial coefficient and Radius of convergence · See more »

Rational number

In mathematics, a rational number is any number that can be expressed as the quotient or fraction of two integers, a numerator and a non-zero denominator.

New!!: Binomial coefficient and Rational number · See more »

Recurrence relation

In mathematics, a recurrence relation is an equation that recursively defines a sequence or multidimensional array of values, once one or more initial terms are given: each further term of the sequence or array is defined as a function of the preceding terms.

New!!: Binomial coefficient and Recurrence relation · See more »


Recursion occurs when a thing is defined in terms of itself or of its type.

New!!: Binomial coefficient and Recursion · See more »


Sanskrit is the primary liturgical language of Hinduism; a philosophical language of Hinduism, Sikhism, Buddhism and Jainism; and a former literary language and lingua franca for the educated of ancient and medieval India.

New!!: Binomial coefficient and Sanskrit · See more »

Scheme (programming language)

Scheme is a programming language that supports multiple paradigms, including functional programming and imperative programming, and is one of the two main dialects of Lisp.

New!!: Binomial coefficient and Scheme (programming language) · See more »


SciPy (pronounced /ˈsaɪpaɪ'/ "Sigh Pie") is a free and open-source Python library used for scientific computing and technical computing.

New!!: Binomial coefficient and SciPy · See more »

Series (mathematics)

In mathematics, a series is, roughly speaking, a description of the operation of adding infinitely many quantities, one after the other, to a given starting quantity.

New!!: Binomial coefficient and Series (mathematics) · See more »

Series multisection

In mathematics, a multisection of a power series is a new power series composed of equally spaced terms extracted unaltered from the original series.

New!!: Binomial coefficient and Series multisection · See more »

Singmaster's conjecture

Singmaster's conjecture is a conjecture in combinatorial number theory in mathematics, named after the British mathematician David Singmaster who proposed it in 1971.

New!!: Binomial coefficient and Singmaster's conjecture · See more »

Society for Industrial and Applied Mathematics

The Society for Industrial and Applied Mathematics (SIAM) is an academic association dedicated to the use of mathematics in industry.

New!!: Binomial coefficient and Society for Industrial and Applied Mathematics · See more »

Star of David theorem

The Star of David theorem is a mathematical result on arithmetic properties of binomial coefficients.

New!!: Binomial coefficient and Star of David theorem · See more »


Statistics is a branch of mathematics dealing with the collection, analysis, interpretation, presentation, and organization of data.

New!!: Binomial coefficient and Statistics · See more »

Stirling numbers of the first kind

In mathematics, especially in combinatorics, Stirling numbers of the first kind arise in the study of permutations.

New!!: Binomial coefficient and Stirling numbers of the first kind · See more »

Stirling's approximation

In mathematics, Stirling's approximation (or Stirling's formula) is an approximation for factorials.

New!!: Binomial coefficient and Stirling's approximation · See more »

String (computer science)

In computer programming, a string is traditionally a sequence of characters, either as a literal constant or as some kind of variable.

New!!: Binomial coefficient and String (computer science) · See more »


In computer programming, a subroutine is a sequence of program instructions that performs a specific task, packaged as a unit.

New!!: Binomial coefficient and Subroutine · See more »

Sun's curious identity

In combinatorics, Sun's curious identity is the following identity involving binomial coefficients, first established by Zhi-Wei Sun in 2002: (x+m+1)\sum_^m(-1)^i\dbinom\dbinom -\sum_^\dbinom(-4)^i.

New!!: Binomial coefficient and Sun's curious identity · See more »

Table of Newtonian series

In mathematics, a Newtonian series, named after Isaac Newton, is a sum over a sequence a_n written in the form where is the binomial coefficient and (s)_n is the rising factorial.

New!!: Binomial coefficient and Table of Newtonian series · See more »

Taylor series

In mathematics, a Taylor series is a representation of a function as an infinite sum of terms that are calculated from the values of the function's derivatives at a single point.

New!!: Binomial coefficient and Taylor series · See more »

Taylor's theorem

In calculus, Taylor's theorem gives an approximation of a k-times differentiable function around a given point by a k-th order Taylor polynomial.

New!!: Binomial coefficient and Taylor's theorem · See more »

Trigonometric functions

In mathematics, the trigonometric functions (also called circular functions, angle functions or goniometric functions) are functions of an angle.

New!!: Binomial coefficient and Trigonometric functions · See more »

Trinomial expansion

In mathematics, a trinomial expansion is the expansion of a power of a sum of three terms into monomials.

New!!: Binomial coefficient and Trinomial expansion · See more »


A typewriter is a mechanical or electromechanical machine for writing characters similar to those produced by printer's movable type.

New!!: Binomial coefficient and Typewriter · See more »

Vandermonde's identity

In combinatorics, Vandermonde's identity (or Vandermonde's convolution) is the following identity for binomial coefficients: for any nonnegative integers r, m, n. The identity is named after Alexandre-Théophile Vandermonde (1772), although it was already known in 1303 by the Chinese mathematician Zhu Shijie (Chu Shi-Chieh).

New!!: Binomial coefficient and Vandermonde's identity · See more »

Wolfram Mathematica

Wolfram Mathematica (usually termed Mathematica) is a modern technical computing system spanning most areas of technical computing — including neural networks, machine learning, image processing, geometry, data science, visualizations, and others.

New!!: Binomial coefficient and Wolfram Mathematica · See more »

Zeckendorf's theorem

Zeckendorf's theorem, named after Belgian mathematician Edouard Zeckendorf, is a theorem about the representation of integers as sums of Fibonacci numbers.

New!!: Binomial coefficient and Zeckendorf's theorem · See more »

Redirects here:

(n k), Binomial Coefficient, Binomial coefficients, Choose function, Choose notation, Choose operation, Choose operator, Combinatorial coefficient, Combinatorial coefficients, Generalised binomial coefficient, Generalized binomial coefficient, N choose k, N choose r, NCk, Vandermonde convolution formula, Vandermonde's convolution formula.


[1] https://en.wikipedia.org/wiki/Binomial_coefficient

Hey! We are on Facebook now! »