Difference between revisions of "Simon's Favorite Factoring Trick"
m (→Problems) |
m (→See Also) |
||
Line 31: | Line 31: | ||
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 | + | == See More Dope Stuff == |
* [[Algebra]] | * [[Algebra]] | ||
* [[Factoring]] | * [[Factoring]] |
Revision as of 23:27, 9 June 2019
Contents
[hide]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.
Amazing Practice Problems
Introductory for Beginners
- 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 for Middle Class
are integers such that
. Find
.
(Source)
Olympiad for Elite
- The integer
is positive. There are exactly 2005 ordered pairs
of positive integers satisfying:
Prove that is a perfect square. (British Mathematical Olympiad Round 2, 2005)