Binomial theorem: Difference between revisions

From Citizendium
Jump to navigation Jump to search
imported>Michael Hardy
(a little bit more)
imported>Michael Hardy
(the first several concrete examples)
Line 8: Line 8:


One way to prove this identity is by [[mathematical induction]].
One way to prove this identity is by [[mathematical induction]].
== The first several cases ==
: <math> (x + y)^0 = 1 \, </math>
: <math> (x + y)^1 = x + y \, </math>
: <math> (x + y)^2 = x^2 + 2xy + y^2 \, </math>
: <math> (x + y)^3 = x^3 + 3x^2 y + 3xy^2 + y^3 \, </math>
: <math> (x + y)^4 = x^4 + 4x^3 y + 6x^2 y^2 + 4xy^3 + y^4 \, </math>
: <math> (x + y)^5 = x^5 + 5x^4 y + 10x^3 y^2 + 6x^2 y^3 + y^5 \, </math>
: <math> (x + y)^6 = x^6 + 6x^5 y + 15x^4 y^2 + 20x^3 y^3 + 15 x^2 y^4 + 6xy^5 + y^6 \, </math>


== Newton's binomial theorem ==
== Newton's binomial theorem ==

Revision as of 15:06, 24 July 2007

In elementary algebra, the binomial theorem is the identity that states that for any non-negative integer n,

where

One way to prove this identity is by mathematical induction.

The first several cases

Newton's binomial theorem

There is also Newton's binomial theorem, proved by Isaac Newton, that goes beyond elementary algebra into mathematical analysis, which expands the same sum (x + y)n as an infinite series when n is not an integer or is not positive.