Simon's Favorite Factoring Trick
This is an AoPSWiki Word of the Week for August 22-August 28 |
Simon's Favorite Factoring Trick (abbreviated SFFT) is a special factorization first popularized by AoPS user Simon Rubinstein-Salzedo. <url>viewtopic.php?highlight=factoring&t=8215 This</url> appears to be the thread where Simon's favorite factoring trick was first introduced. The general statement of SFFT is: . Two special common cases are:
and
.
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)
Olympiad
This problem has not been edited in. If you know this problem, please help us out by adding it.