# CLEP College Algebra/Binomial Theorem

Quick question: what is ${\displaystyle (2x-4)^{2}}$ equivalent to? Well, to find that, we need to multiply ${\displaystyle (2x-4)}$ two times because an exponent denotes how many times, ${\displaystyle n}$, you multiply any value ${\displaystyle a}$, which we represent as ${\displaystyle a^{n}}$. Let ${\displaystyle a=(2x-4)}$ and ${\displaystyle n=2}$.

${\displaystyle a^{n}=(2x-4)^{2}=(2x-4)(2x-4)=4x^{2}+-8x+16=4(x^{2}-2x+4)}$.

If this was part of a multiple choice question, you would perhaps be able to quickly get the answer. However, what if you had to do a modified version of this problem?

Find ${\displaystyle (2x-4)^{10}}$.

You can perhaps do this problem after a while, but it might already be too late before you can finish the CLEP College Algebra exam. Even if it is not too late, you may not be able to do the other problems after you are done, or you may get the wrong answer because it is very hard to do the problem like that. Therefore, how do we do the problem? That is when the binomial expansion theorem comes into play. We will state the definition once we understand the foundations of the formula first.

## Permutations and Combinatorics

### Factorial Notation

 Example 1.1: How many 26-letter words can you make using the standard English alphabet (A-Z), where you can only use a letter once? Let's start small. Try to imagine a list of all the possible ${\displaystyle 1}$ -letter words using the standard alphabet. In that list, you would see all the letters of the alphabet. Now try to imagine a list of all the possible ${\displaystyle 2}$ -letter words you can make using the standard alphabet. If you think about it, that is simply ${\displaystyle 26{\text{ letters}}\cdot 25{\text{ letters}}}$ . After all, you had ${\displaystyle 26}$  letters to choose from, but since you are not allowed to use that letter more than once, you now have ${\displaystyle 25}$  letters to choose from. This works the same for any combination of ${\displaystyle 2}$ -letter words (AB, AC, AD, ${\displaystyle \ldots }$ , BA, BC, ${\displaystyle \ldots }$ , ZA, ZB, ${\displaystyle \ldots }$ , ZY). If you think about it, the pattern continues. The number gets larger, but it gets larger by multiplying the number from before minus ${\displaystyle 1}$ . If you want to make a random word that is ${\displaystyle 26}$  letters long, where no letters can be repeated more than once, then ${\displaystyle \underbrace {26\cdot 25\cdot 24\cdots 2\cdot 1} _{26}{\text{ words can be created from the standard English alphabet.}}}$

In Example 2.1, we wanted to find the number of 26-letter words you can make, if you can only use a letter once. It can be a bit tedious to write ${\displaystyle \underbrace {26\cdot 25\cdot 24\cdots 2\cdot 1} _{26}}$  as your answer. However, mathematicians have found a way to write a short hand for it.

New notation.

For any multiplication of a whole number ${\displaystyle x}$  where ${\displaystyle \underbrace {(x)\cdot (x-1)\cdot (x-2)\cdots 2\cdot 1} _{x}}$  is true, let ${\displaystyle \underbrace {(x)\cdot (x-1)\cdot (x-2)\cdots 2\cdot 1} _{x}=x!}$ , where "!" is sounded as factorial. By definition, ${\displaystyle 0!=1}$ .

Another way to think of a factorial is the multiplication of the current whole number ${\displaystyle x}$  to the number 1.

To make the above definition more clear, here is a list of a few examples:

${\displaystyle {\begin{array}{|c|c|}x!&f(x)\\\hline 2!&\underbrace {2\cdot 1} _{2}=2\\\hline 3!&\underbrace {3\cdot 2\cdot 1} _{3}=6\\\hline 4!&\underbrace {4\cdot 3\cdot 2\cdot 1} _{4}=24\\\hline 5!&\underbrace {5\cdot 4\cdot 3\cdot 2\cdot 1} _{5}=120\\\hline \vdots &\vdots \\\end{array}}}$

In Example 1.1, the answer can be rewritten as this:

${\displaystyle \underbrace {26\cdot 25\cdot 24\cdots 2\cdot 1} _{26}=26!}$

We use the factorial notation much more than just for a representation of multiplication in specific situations. The factorial is very useful when listing out possibilities or the number of arrangements. Say that you want to find the number of ways you can arrange 4 students in a group. Call each student either A, B, C, or D, only once. Here are some listings:

• A, B, D, C
• A, B, C, D
• A, C, B, D
• A, C, D, B
• A, D, B, C
• A, D, C, B

As we continue listing each arrangement, we find that the number of ways in which you can arrange the four students is ${\displaystyle 24}$ , which is equal to ${\displaystyle 4!}$ . This makes sense because you cannot have an arrangement in which a student repeats in the list (no cloning allowed!).

Say that you want to find the number of ways you can arrange three students in a group. Call each student either B, C, or D, only once. Here are all of the listings of students.

• B, D, C
• B, C, D
• C, B, D
• C, D, B
• D, B, C
• D, C, B

The number of ways in which you can arrange the three students is ${\displaystyle 6}$ , which is equal to ${\displaystyle 3!}$ .

From the two examples above, it should be clear that factorial notation is very useful because we can show that arrangements are simply just a choice between ${\displaystyle n}$  possibilities, then ${\displaystyle (n-1)}$  possiblities, etcetera.

### Combination

 Example 1.2: A high school is considering making a committee of 6 teachers because of the growing student population size (before: 500 students; after: 700 students). Out of the total 200 teachers in the school, 15 are eligible for the committee. How many committees can be made when 6 teachers are added. Let us imagine a group of 15 teachers. Each one will be assigned a letter from the English Alphabet, in order from A - O. Instead of adding 6 teachers to the committee, let us add 3 teachers, so that we get "a feel" for the situation. In a committee, we do not care about the order in which we find them at a table because we only care about if they are in the committee. Imagine we see three teachers, A, B, and C. ABC ACB CAB CBA BAC BCAThe list you see above does not tell us that there are different teachers, only that the order is different. However, we do not care about the order; therefore, we must exclude the order from the number of possible committees to make the answer representative of the idea of a committee. The numbers of arrangements in which the same number of teachers, ${\displaystyle x}$ , show is ${\displaystyle x!}$ . This is what we "factor out," the order in which we find teachers in committees. One final thing to keep in mind is that since we are selecting ${\displaystyle 6{\text{ teachers}}}$  from a group of ${\displaystyle 15{\text{ teachers}}}$ , we are excluding ${\displaystyle 15-6{\text{ teachers}}}$  or ${\displaystyle 9{\text{ teachers}}}$  from being arranged into the committee in the same way we expect them to. Therefore, we must "factor out" the ${\displaystyle (15-6)!}$  ways of arranging those teachers. From this, we learn that we can arrange ${\displaystyle {15! \over (15-6)!6!}={15! \over 9!\cdot 6!}=5005{\text{ teachers into the new committee.}}}$

One difference between Example 1.1 and Example 1.2 is that the order in Example 1.2 did not matter. After all, in whichever way you arrange the committee, you count any arrangement where the same elements are within identical to the other. You cannot do that with an arrangement of letters because AB and BA are not identical. Nevertheless, this example is not independent. There are countless times in which you whatever way you arrange a group of something, the number of possibilities does not increase. Therefore, we need a formula and notation for such a situation.

New Formula and Definition.

In an arrangement from which ${\displaystyle k}$  objects are selected from a group of ${\displaystyle n}$  objects, where the order of selection does not matter when counting all possibilities, the number of possible arragements is given by

${\displaystyle {n! \over (n-k)!k!}.}$

Such a given arrangement is called a combination.
Notation for combinations.

A representation of ${\displaystyle {n! \over (n-k)!k!}.}$  is ${\displaystyle {\binom {n}{k}}}$  or ${\displaystyle _{n}C_{k}}$ , read aloud as "${\displaystyle n}$  choose ${\displaystyle k}$ ."

We are now closer one step closer to understand the binomial theorem. We only need to understand a few more things before we use the formula we learned at the very beginning.

## Polynomials and Binomials

### Polynomials and Generalization

Look at the following polynomials below:

${\displaystyle 2x^{2}+5x-3}$
${\displaystyle -3x^{5}+4x^{4}+5x^{3}-6x}$
${\displaystyle {12 \over 19}x^{3}+{5 \over 3}x^{2}+{1 \over 12}x-{3 \over 2}}$

The one that is in common with all three of the polynomials above is that they are all added (remember, the inverse of summation for real number ${\displaystyle x}$  is ${\displaystyle -x}$ , so ${\displaystyle x+(-x)=0}$ ). This means that we have a series. To really hammer that idea into our skulls, we need to go ahead and generalize a polynomial. Here is a formal definition of a polynomial

Definition of Polynomial.

A polynomial is an arithmetic series of terms whereby the term of ${\displaystyle t}$  at index ${\displaystyle i}$  is ${\displaystyle t_{i}}$ . ${\displaystyle t_{i}=a_{i}x^{i}}$  where ${\displaystyle a_{i}}$  is the coefficient of ${\displaystyle x}$  and ${\displaystyle i}$  is the power of ${\displaystyle x}$ . Let ${\displaystyle k}$  be the final index and coefficient of the series. The sum of a general series ${\displaystyle t_{0}+t_{1}+t_{2}+\ldots +t_{k+2}+t_{k+1}+t_{k}}$  can represent the sum as

${\displaystyle a_{0}x^{0}+a_{1}x^{1}+a_{2}x^{2}+\ldots +a_{k-2}x^{k-2}+a_{k-1}x^{k-1}+a_{k}x^{k}}$

Although the definition may seem complicated, there is no need to worry. Remember that every polynomial must have a degree, in this instance, ${\displaystyle i}$ . For every ${\displaystyle x}$ , the coefficient is ${\displaystyle a_{i}}$ . If ${\displaystyle i=0}$ , then ${\displaystyle a_{i}x^{i}=a_{0}x^{0}=1\cdot a_{0}=a_{0}}$ . Since each iteration of ${\displaystyle i}$  has a different coefficient, once ${\displaystyle i=k}$ , we are finished writing the series. Every polynomial, therefore, has the same pattern.

"Short-hand" Definition of Polynomial.

A polynomial is an arithmetic series in which

${\displaystyle {\sum _{i=0}^{k}a_{i}x^{i}=a_{0}x^{0}+a_{1}x^{1}+a_{2}x^{2}+\ldots +a_{k-2}x^{k-2}+a_{k-1}x^{k-1}+a_{k}x^{k}}}$

However, while this may be an incredible mathematical fact, this does not help us with our original problem. After all, we want to be able to predict a polynomial that results from multiplying another polynomial (since a binomial is also a polynomial). However, the above definition gives us a giant hint to help us solve our first problem. Before we create a formula for that situation, however, we must understand one more concept.

### Pascal's Triangle

French mathematician Blaise Pascal, like many mathematicians before his time, wanted to study a pattern of sequences and series. However, unlike most patterns we see in this WikiBook, the pattern is not horizontal, but vertical and diagnol. Instead of one-dimensional patterns, we see a two dimensional pattern. This pattern is of a shape of a triangle, which is shown below.