Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "Factoring"

m (proofreading)
(Wikified, re-wrote introduction)
Line 1: Line 1:
−
Factoring is an essential part of problem solving. It is part of [[number theory]] and applying it will yield many results. There are many methods to factor, ranging all the way from using the [[Distributive Property]] to make an expression easier to calculate, to using factoring as a vital part of proofs.
+
'''Factoring''' is an essential part of any mathematical toolbox. To factor, or to break an expression into factors, is to write the expression (often an [[integer]] or [[polynomial]]) as a product of different terms.  This often allows one to find information about an expression that was not otherwise obvious.
  
 
==Differences and Sums of Powers==
 
==Differences and Sums of Powers==
Line 6: Line 6:
 
<math>a^3-b^3=(a-b)(a^2+ab+b^2)</math>
 
<math>a^3-b^3=(a-b)(a^2+ab+b^2)</math>
  
−
Using the formula for the sum of a [[geometric sequence | geometric sequence]], it's easy to derive the more general formula:
+
Using the formula for the sum of a [[geometric sequence]], it's easy to derive the more general formula:
  
 
<math>a^n-b^n=(a-b)(a^{n-1}+ba^{n-2} + \cdots + b^{n-2}a + b^{n-1})</math>
 
<math>a^n-b^n=(a-b)(a^{n-1}+ba^{n-2} + \cdots + b^{n-2}a + b^{n-1})</math>
Line 29: Line 29:
 
== Other Useful Factorizations ==
 
== Other Useful Factorizations ==
 
*<math>a^3+b^3+c^3-3abc=(a+b+c)(a^2+b^2+c^2-ab-bc-ca)</math>
 
*<math>a^3+b^3+c^3-3abc=(a+b+c)(a^2+b^2+c^2-ab-bc-ca)</math>
−
*See [[Simon's Favorite Factoring Trick]] (This is not a recognized formula, please do not quote it on contests)
+
* [[Simon's Favorite Factoring Trick]]
−
*[[Binomial theorem]]
+
* [[Binomial theorem]]
 
== Practice Problems ==
 
== Practice Problems ==
 
* Prove that <math>n^2 + 3n + 5</math> is never divisible by 121 for any positive integer <math>{n}</math>.
 
* Prove that <math>n^2 + 3n + 5</math> is never divisible by 121 for any positive integer <math>{n}</math>.

Revision as of 11:37, 20 July 2006

Factoring is an essential part of any mathematical toolbox. To factor, or to break an expression into factors, is to write the expression (often an integer or polynomial) as a product of different terms. This often allows one to find information about an expression that was not otherwise obvious.

Differences and Sums of Powers

$a^2-b^2=(a+b)(a-b)$

$a^3-b^3=(a-b)(a^2+ab+b^2)$

Using the formula for the sum of a geometric sequence, it's easy to derive the more general formula:

$a^n-b^n=(a-b)(a^{n-1}+ba^{n-2} + \cdots + b^{n-2}a + b^{n-1})$

Take note of the specific case where n is odd:

$a^n+b^n=(a+b)(a^{n-1} - ba^{n-2} + b^2a^{n-3} - b^3a^{n-4} + \cdots + b^{n-1})$

This also leads to the formula for the sum of cubes,

$a^3+b^3=(a+b)(a^2-ab+b^2)$


Vieta's/Newton Factorizations

These factorizations are useful for problems that could otherwise be solved by Newton sums or problems that give a polynomial and ask a question about the roots. Combined with Vieta's formulas, these are excellent factorizations that show up everywhere.

  • $\displaystyle (a+b+c)^2=a^2+b^2+c^2+2(ab+bc+ca)$
  • $\displaystyle (a+b+c)^3=a^3+b^3+c^3+3(a+b)(b+c)(c+a)$
  • $\displaystyle (a+b+c)^5=a^5+b^5+c^5+5(a+b)(b+c)(c+a)(a^2+b^2+c^2+ab+bc+ca)$

Other Useful Factorizations

Practice Problems

  • Prove that $n^2 + 3n + 5$ is never divisible by 121 for any positive integer ${n}$.
  • Prove that $2222^{5555} + 5555^{2222}$ is divisible by 7. - USSR Problem Book
  • Factor $(x-y)^3 + (y-z)^3 + (z-x)^3$.

Other Resources

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Factoring&oldid=8012"