Difference between revisions of "Simon's Favorite Factoring Trick"
m (→The General Statement) |
|||
| Line 1: | Line 1: | ||
==About== | ==About== | ||
| − | '''Dr. Simon's Favorite Factoring Trick''' (abbreviated '''SFFT''') is a special factorization first popularized by [[AoPS]] user [[user:ComplexZeta |Simon Rubinstein-Salzedo]]. | + | '''Dr. Simon's Favorite Factoring Trick''' (abbreviated '''SFFT''') is a special factorization first popularized by [[AoPS]] user [[user:ComplexZeta | Simon Rubinstein-Salzedo]]. |
==The General Statement== | ==The General Statement== | ||
| − | The general statement of SFFT is: <math>{xy}+{ | + | The general statement of SFFT is: <math>{xy}+{xk}+{yj}+{jk}=(x+j)(y+k)</math>. Two special common cases are: <math>xy + x + y + 1 = (x+1)(y+1)</math> and <math>xy - x - y +1 = (x-1)(y-1)</math>. |
| − | The act of adding <math>{jk}</math> to <math>{xy}+{xk}+{ | + | The act of adding <math>{jk}</math> to <math>{xy}+{xk}+{yj}</math> in order to be able to factor it could be called "completing the rectangle" in analogy to the more familiar "completing the square." |
| + | |||
== Applications == | == Applications == | ||
| Line 18: | Line 19: | ||
([[2000 AMC 12/Problem 6|Source]]) | ([[2000 AMC 12/Problem 6|Source]]) | ||
| − | |||
===Intermediate=== | ===Intermediate=== | ||
*<math>m, n</math> are integers such that <math>m^2 + 3m^2n^2 = 30n^2 + 517</math>. Find <math>3m^2n^2</math>. | *<math>m, n</math> are integers such that <math>m^2 + 3m^2n^2 = 30n^2 + 517</math>. Find <math>3m^2n^2</math>. | ||
([[1987 AIME Problems/Problem 5|Source]]) | ([[1987 AIME Problems/Problem 5|Source]]) | ||
| + | ===Olympiad=== | ||
| − | *The integer <math>N</math> is positive. There are exactly | + | *The integer <math>N</math> is positive. There are exactly 2005 ordered pairs <math>(x, y)</math> of positive integers satisfying: |
<cmath>\frac 1x +\frac 1y = \frac 1N</cmath> | <cmath>\frac 1x +\frac 1y = \frac 1N</cmath> | ||
Prove that <math>N</math> is a perfect square. (British Mathematical Olympiad Round 2, 2005) | Prove that <math>N</math> is a perfect square. (British Mathematical Olympiad Round 2, 2005) | ||
| + | |||
== See Also == | == See Also == | ||
Revision as of 13:35, 27 February 2019
Contents
About
Dr. Simon's Favorite Factoring Trick (abbreviated SFFT) is a special factorization first popularized by AoPS user Simon Rubinstein-Salzedo.
The General Statement
The general statement of SFFT is: 
. Two special common cases are: 
and 
.
The act of adding 
to 
in order to be able to factor it could be called "completing the rectangle" in analogy to the more familiar "completing the square."
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.
Problems
Introductory
- Two different prime numbers between
and 
are chosen. When their sum is subtracted from their product, which of the following numbers could be obtained?
and 
are chosen. When their sum is subtracted from their product, which of the following numbers could be obtained?
(Source)
Intermediate
are integers such that 
. Find 
.
are integers such that 
. Find 
.(Source)
Olympiad
- The integer
is positive. There are exactly 2005 ordered pairs 
of positive integers satisfying:
of positive integers satisfying:![\[\frac 1x +\frac 1y = \frac 1N\]](http://latex.artofproblemsolving.com/6/6/d/66dc47078d1e109634e02a0d0e05c3c5bfb9d1c6.png)
Prove that 
is a perfect square. (British Mathematical Olympiad Round 2, 2005)
