### Algebra: Factorization

### Factorization

We have seen how we can factorize an expression with single brackets. Now we will see how we can rewrite an expression with double brackets.

Product sum method

In the example below, we'll explain how we can find the right numbers for the factorization of #x^2+b \cdot x +c#.

Factorize the expression #x^2-15\cdot x+56#.

#x^2-15\cdot x+56=# \((x-7)\cdot(x-8)\)

We are looking for numbers #\purple{m}# and #\purple{n}#, such that the quadratic polynomial #x^2-15\cdot x+56# can be written as #(x+\purple{m})\cdot(x+\purple{n})#. Please note that #\purple{m}# and #\purple{n}# are exchangable. We will expand the brackets and compare the results with the oritginal expression:

\[ x^2+(\purple{m}+\purple{n})\cdot x+\purple{m}\cdot \purple{n} = x^2-15\cdot x+56\tiny\]

Comparison with #x^2-15\cdot x+56# gives \[

\lineqs{\purple{m}+\purple{n} &=& -15\cr \purple{m}\cdot \purple{n} &=& 56}\]If #\purple{m}# and #\purple{n}# are integers, then they are divisors of #56#. We will check all possible divisors #\purple{m}# with #\purple{m}^2\le 56# (since we then cover all possibilities, because #\purple{m}# and #\purple{n}# van can change roles) and calculate, in each of the cases, the sum of #\purple{m}# and #\purple{n}=\frac{56}{\purple{m}}#:

\[\begin{array}{|r|c|l|}

\hline

\purple{m}&\purple{n}&\purple{m}+\purple{n}\\

\hline

1&56&57\\ \hline -1&-56&-57\\ \hline 2&28&30\\ \hline -2&-28&-30\\ \hline 4&14&18\\ \hline -4&-14&-18\\ \hline 7&8&15\\ \hline -7&-8&-15 \\

\hline

\end{array}\]

The line of the table with #\purple{m}=-7# and #\purple{n}=-8# is the only one with sum #-15#, hence, this is the answer:

\[x^2-15\cdot x+56=(x-7)\cdot(x-8)\tiny.\]

We are looking for numbers #\purple{m}# and #\purple{n}#, such that the quadratic polynomial #x^2-15\cdot x+56# can be written as #(x+\purple{m})\cdot(x+\purple{n})#. Please note that #\purple{m}# and #\purple{n}# are exchangable. We will expand the brackets and compare the results with the oritginal expression:

\[ x^2+(\purple{m}+\purple{n})\cdot x+\purple{m}\cdot \purple{n} = x^2-15\cdot x+56\tiny\]

Comparison with #x^2-15\cdot x+56# gives \[

\lineqs{\purple{m}+\purple{n} &=& -15\cr \purple{m}\cdot \purple{n} &=& 56}\]If #\purple{m}# and #\purple{n}# are integers, then they are divisors of #56#. We will check all possible divisors #\purple{m}# with #\purple{m}^2\le 56# (since we then cover all possibilities, because #\purple{m}# and #\purple{n}# van can change roles) and calculate, in each of the cases, the sum of #\purple{m}# and #\purple{n}=\frac{56}{\purple{m}}#:

\[\begin{array}{|r|c|l|}

\hline

\purple{m}&\purple{n}&\purple{m}+\purple{n}\\

\hline

1&56&57\\ \hline -1&-56&-57\\ \hline 2&28&30\\ \hline -2&-28&-30\\ \hline 4&14&18\\ \hline -4&-14&-18\\ \hline 7&8&15\\ \hline -7&-8&-15 \\

\hline

\end{array}\]

The line of the table with #\purple{m}=-7# and #\purple{n}=-8# is the only one with sum #-15#, hence, this is the answer:

\[x^2-15\cdot x+56=(x-7)\cdot(x-8)\tiny.\]

The examples below will show that there are also other situations in which we can factorize. We will also see that we can sometimes combine factoring out with factorization in double brackets.

#\left(b+4\right)^2#

As the product of #4# and #4# is equal to #16# and the sum to #8# the following holds:

\[b^2+8\cdot b+16= \left(b+4\right)^2\]

As the product of #4# and #4# is equal to #16# and the sum to #8# the following holds:

\[b^2+8\cdot b+16= \left(b+4\right)^2\]

Unlock full access

Teacher access

Request a demo account. We will help you get started with our digital learning environment.

Student access

Is your university not a partner?
Get access to our courses via

Or visit omptest.org if jou are taking an OMPT exam.

**Pass Your Math**independent of your university. See pricing and more.Or visit omptest.org if jou are taking an OMPT exam.