INDEX
Numbers and Sets
Complex Numbers
Exponentiation
Algebraic Transformations
Algebraic Equations and Inequalities
Functions
Basic Formulas
Graphics of Basic Functions
Discrete Algebra
Ship 2

Binomial Theorem

Sigma-Notations

Arithmetic Progressions

Geometric Progressions

Binomial Theorem

Pascal's Triangle

Evaluation of Sums of the Form
1k + 2k + ... + nk

1 + 2 + ... + n

1² + 2² + ... + n²

1³ + 2³ + ... + n³

Mathematical Induction Principle

Basic Conceptions

Constituents of the Induction Principle

Model Examples
  Example 1
  Example 2
  Example 3
  Example 4
  Example 5
  Example 6


Binomial Theorem
Key Topics Remaining:   Pascal's Triangle » Basic Conceptions of the Mathematical Induction Principle » Constituents of the Induction Principle » Model Examples

Binomial coefficients are defined by the following formula,

.

The symbol  n!  is read  "n factorial"  that means the product of all natural numbers from 1 to n:

n! = 1·2·3·…·n.

By definition,

0! = 1.

The binomial coefficients give a number of choices of  k  objects from a set of  n  objects, regardless of the order in which the objects are chosen.
Note that

The Binomial Theorem.  For any natural number  n,
.

If  a = 1  and  b = x  then

.

The binomial coefficients can also be found by making use of the Pascal's triangle.


Examples
Previous Topic   Next Topic