In this section, I'll review the notation for sums and products, and give a brief introduction to binomial coefficients.
That is, you replace the summation variable i with the numbers from 0 (the lower limit) to n (the upper limit), then sum the results.
Example.
Your sums need not start at 0, and the summation variable can be anything you want:
(If I replace j with 1, 2, and 3 in the expression "4", I
get 4 three times.)
The following properties and those for products which are given below are fairly obvious, but careful proofs require mathematical induction (which I'll discuss later).
Proposition. ( Properties of sums)
(a)
.
(b)
.
(c)
.
Example. If c is a constant, then
That is, you replace the product variable i with the numbers from 0 (the lower limit) to n (the upper limit), then multiply the results.
Example.
(If I replace i with 1, 2, and 3 in the expression "5", I get 5 three times.)
Your products need not start at 0, and the product variable can be anything you want:
This is the product of the numbers from 1 to n. It comes up often
enough that it has a special name and symbol; it's denoted
and it's called n-factorial. For example,
By convention,
is defined to be 1.
Notice that
is defined if n is a nonnegative integer; can you
define
if n is not an integer? For example, what would
be?
In math, you can define things in many ways, but some ways are more
useful than others. In this case, you'd want the "extended"
definition of
to agree with the old one when n is a
nonnegative integer. It would also be nice for the equation
to hold.
There is a way of defining the "factorial" of any positive real number so that these conditions (and others involving the defining function) hold. The Gamma function is defined by
(Note that x here is a real number.) If n is a positive integer,
Here's a graph of the Gamma function:
I've placed dots at the points
so you can see that
the Gamma function really goes through the factorial points. Note
also that
. But if I plug
into the formula
above, I get
, i.e.
. Thus,
, which is the convention I mentioned earlier.
Proposition. ( Properties of products)
(a)
.
(b)
.
(c)
.
Example.
Binomial coefficients are defined in terms of
factorials. If n and k are integers,
, and
, then
The expression on the left is read n-choose-k.
Example.
Proposition. ( Properties of binomial coefficients)
(a)
.
(b)
.
(c) ( Pascal's triangle)
.
The last property has the following pictorial interpretation.
Make a triangle as shown by starting at the top and writing 1's down
the sides. Then fill in the middle of the triangle one row at a time,
by adding the elements diagonally above the new element. For example,
the leftmost 4 in the
row was obtained this way:
The formula above is simply an algebraic expression of this addition procedure.
Proof. You can check the formulas in (a) and (b) by writing out the binomial coefficients. Here's the computation for one part of (a):
And here's the computation for (b):
The proof of (c) is also a computation, though it's a little more involved:
Of course, binomial coefficients get their name because they're the coefficients in the expansion of a binomial:
Since the coefficients can be read off from Pascal's triangle, you can use the triangle to write down binomial expansions.
Example. Using the
row in the triangle, I get
Example. Determine the coefficient of
in the expansion of
.
The term containing
is
(I cancelled the
with the first 37 terms in
, then cancelled the
with
and
.) The coefficient is
, or -36663215228190720 if you multiply it out.
Send comments about this page to: bikenaga@marauder.millersville.edu.
Last updated: June 7, 2008
Millersville University Home Page
Copyright 2007 by Bruce Ikenaga