Difference between revisions of "Simon's Favorite Factoring Trick"
(→Applications) |
Minerva 11 (talk | contribs) m (→Applications) |
||
Line 9: | Line 9: | ||
== Applications == | == Applications == | ||
− | This factorization frequently shows up on contest problems, especially those | + | 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>jk</math> term to both sides to perform the factorization. |
== Problems == | == Problems == |
Revision as of 11:29, 8 December 2018
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?
(Source)
Intermediate
are integers such that
. Find
.
(Source)
- The integer
is positive. There are exactly
pairs
of positive integers satisfying:
Prove that is a perfect square. (British Mathematical Olympiad Round 2, 2005)