Home > Mathematics > Extension 1 > The Binomial Theorem > Binomial theorem (MANSW)
Reflections, May 1990 -
Journal of the Mathematical Association of NSW
HISTORICAL
Euclid (c. 300 BC) discovered
Omar Khayyam (c.AD 1100) developed
expansions for
Pascal (1623 - 1662) is associated with the array of coefficients, but this array was used by Chinese writers in AD 1300 and by a German Apianus (AD 1527). Sir Isaac Newton extended this idea, working with coefficients. Today applied mathematicians make frequent use of approximations based on the
first few terms of
POSSIBLE TEACHING SEQUENCE
1. Have students expand and tabulate the final line of each.
By observing only the coefficients, we have Pascal's triangle:
1
1 1
1 2 1
1 3 3 1
1 4 6 4 1
1 5 10 10 5 1
Points to draw out:
2. Add more lines (2 or 3) to Pascal's triangle and use
these to expand .
3. Replace a by 1, b by
x and observe (1 + x)n for
n = 0,1,2...,5.
4. Examine (1 - x)n by putting
(-x) for b, 1 for a,
for example, in (a + b)4, put a =
1, b = -x.
Observe:
5. Extend to (1 + 3x)4
(1 - 2a)3, etc.
6. Introduce a shorthand notation. C stands for coefficient, so nCk stands for the coefficient of the term in the binomial expansion.
Hence, we could write (1 + x)5
Now, put x = 0 in this expansion:
7. Looking again at how a new line of Pascal's triangle is obtained:
using coefficients:
After more examples, we generalise to
.
8. This formula has to be proved. The method in the syllabus
is fine.
Write
Then multiply it by x and add the two to give
The result follows.
9. A good way to derive the coefficients in the expansion of
(1 + x)n is to use calculus.
Differentiate
Differentiate again:
10. Use symmetry and then show .
For example:
Practise evaluation of and then use calculator to confirm.
11. Proof by induction for nCk. (Not examinable and quite difficult. Syllabus proof is quite good and full.)
12. Introduce factorial notation and show that
by giving first arithmetical examples, for
example:
13. Introduce "choose" notation.
nCk is written
and can be read "n
choose k".
If (like me) you have not done permutations and combinations
before the binomial theorem, you will favour
nCk, but use
both notations.
14. The syllabus requires use of "sigma" notation.
Perhaps a careful listing of all notations and expansions
helps:
Each of these can be written using "sigma" as follows:
Deciding which of these to use in any one instance is
difficult for students. It is notation overload for many, so
they need help in translation to something which has meaning
for them. Only very good 3 Unit (and 4 Unit) students are
comfortable using "sigma". [Also, explain the use of
(depends on context).]
Text books for reference
Fitzpatrick - Very comprehensive and uses a variety of notations.
Jones & Couchman - Needs supplementing,
and has no notation.
Coroneos (Red) - Exercises comprehensive,
no notation.
Walton & Green - Comprehensive, but
uses only notation.
Coroneos (Orange) - p.269 has both notations; comprehensive.
Gordon, Watling, Aus - Satisfactory, has full worked solutions, therefore good for new teachers.
HSC 3 UNIT QUESTIONS
ON THE BINOMIAL THEOREM
1989
3. (b) Find the constant term in the expansion of
.
1988
6. (b) Suppose
i) Use the binomial theorem to write an expression for
ii) Show that
iii) Hence, or otherwise, find the largest coefficient
tk Your may leave your answer in the form
.
1987
3. (b) Find the coefficient of x3 in the expansion of
1985
6. (a) When is written out as a polynomial in
x, the coefficients of x5 and
x6 have the same value. Find
n.
(b) Prove that
1984
7. (a) Assume that, for all real numbers x and all positive integers n,
show that
(i)
and find simple expressions for:
(ii)
(iii)