Difference between revisions of "Simon's Favorite Factoring Trick"
IntrepidMath (talk | contribs) |
(→Simon's Favorite Factoring Trick) |
||
| Line 1: | Line 1: | ||
| − | === | + | === Statement of the factorization === |
| − | Simon's Favorite Factoring Trick (abbreviated SFFT) is a special factorization. SFFT is: <math>xy+ | + | Simon's Favorite Factoring Trick (abbreviated SFFT) is a special factorization. SFFT is: <math>{xy}+{xk}+{yj}+{jk}=(x+j)(y+k)</math>. |
| + | |||
| + | === Applications === | ||
| + | This factorization frequently shows up on contest problems, especially those heavy on algebraic manipulation. Usually <math>{x}</math> and <math>{y}</math> are variables and <math>j,k</math> are known constants. Also it is typically necessary to add the <math>{j}{k}</math> term to both sides to perform the factorization. | ||
Revision as of 16:42, 17 June 2006
Statement of the factorization
Simon's Favorite Factoring Trick (abbreviated SFFT) is a special factorization. SFFT is: 
.
Applications
This factorization frequently shows up on contest problems, especially those heavy on algebraic manipulation. Usually 
and 
are variables and 
are known constants. Also it is typically necessary to add the 
term to both sides to perform the factorization.
