Binomial theorem: Difference between revisions
Jump to navigation
Jump to search
imported>Michael Hardy (A new stub article.) |
imported>Michael Hardy (a little bit more) |
||
Line 6: | Line 6: | ||
: <math> {n \choose k} = \frac{n!}{k!(n - k)!}. </math> | : <math> {n \choose k} = \frac{n!}{k!(n - k)!}. </math> | ||
One way to prove this identity is by [[mathematical induction]]. | |||
== 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'')<sup>''n''</sup> as an infinite series when ''n'' is not an integer or is not positive. | 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'')<sup>''n''</sup> as an infinite series when ''n'' is not an integer or is not positive. | ||
[[Category:Mathematics Workgroup]] | |||
[[Category:CZ Live]] |
Revision as of 13:56, 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.
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.