Binomial theorem


the theorem giving the expansion of a binomial raised to any power.
historical examples

international congress of arts and science, volume i various
the eulogy of richard jefferies walter besant
memoirs of sherlock holmes sir arthur conan doyle
a review of algebra romeyn henry rivenburg
encyclopaedia britannica, 11th edition, volume 14, slice 5 various
soul of a bishop h. g. wells
the theory of the theatre clayton hamilton
mrs. warren’s daughter sir harry johnston
studies in logical theory john dewey
the life of the fly j. henri fabre

noun
a mathematical theorem that gives the expansion of any binomial raised to a positive integral power, n. it contains n + 1 terms: (x + a)n = xn + nxn–1a + [n(n–1)/2] xn–²a² +…+ (nk) xn–kak + … + an, where (nk) = n!/(n–k)!k!, the number of combinations of k items selected from n
binomial theorem
mathematics
the theorem that specifies the expansion of any power of a binomial, that is, (a + b)m. according to the binomial theorem, the first term of the expansion is xm, the second term is mxm-1y, and for each additional term the power of x decreases by 1 while the power of y increases by 1, until the last term ym is reached. the coefficient of xm-r is m![r!(m-r)!]. thus the expansion of (a + b)3 is a3 + 3a2b + 3ab2 + b3.

Read Also:

  • Binominal name

    noun examples

  • Binominal

    adjective of or denoting the binomial nomenclature noun a two-part taxonomic name; binomial historical examples the systematics of the frogs of the hyla rubra group in middle america juan r. len

  • Binos

    binos binoculars historical examples the jesuit relations and allied doc-ments, vol. i: acadia, 1610-1613 various a history of inventions, discoveries, and origins, volume i (of 2) johann beckman

  • Binovular

    adjective relating to or derived from two different ova: binovular fertilization, binovular twins

  • Binprolog

    binprolog language probably the fastest freely available c-emulated prolog. binprolog features: logical and permanent global variables; backtrackable destructive -ssignment; circular term unification; extended dcgs (now built into the engine as “invisible grammars”); intuitionistic and linear implication based hypothetical reasoning; a tcl/tk interface. version 3.30 runs on sparc/solaris 2.x, sunos 4.x; dec alpha 64-bit version; dec […]


Disclaimer: Binomial theorem definition / meaning should not be considered complete, up to date, and is not intended to be used in place of a visit, consultation, or advice of a legal, medical, or any other professional. All content on this website is for informational purposes only.