Difference between revisions of "Simon's Favorite Factoring Trick"

m
m (The General Statement)
(94 intermediate revisions by 61 users not shown)
Line 1: Line 1:
== Introduction ==
 
'''Simon's Favorite Factoring Trick''' (abbreviated SFFT) is a special factorization first popularized by [[AoPS]] user [[user:ComplexZeta]], whose name is Simon.  [http://www.artofproblemsolving.com/Forum/viewtopic.php?highlight=factoring&t=8215 This] appears to be the thread where Simon's favorite factoring trick was first introduced.
 
  
== Statement of the factorization ==
+
==The General Statement==
The general statement of SFFT is: <math>{xy}+{xk}+{yj}+{jk}=(x+j)(y+k)</math>. More oftenly however SFFT is introduced as <math>xy + x + y + 1 = (x+1)(y+1)</math> or <math> xy - x - y +1 = (x-1)(y-1)</math>.
+
Simon's Favorite Factoring Trick (SFFT) is often used in a Diophantine(Positive) equation where factoring is needed. The most common form it appears is when there is a constant on one side of the equation and a product of variables with each of those variables in a linear term on the other side. A extortive example would be: <cmath>xy+66x-88y=23333</cmath>where <math>23333</math> is the constant term, <math>xy</math> is the product of the variables, <math>66x</math> and <math>-88y</math> are the variables in linear terms.
 +
 
 +
 
 +
Let's put it in general terms. We have an equation <math>xy+jx+ky=a</math>, where <math>j</math>, <math>k</math>, and <math>a</math> are integral constants. According to Simon's Favourite Factoring Trick, this equation can be transformed into: <cmath>(x+k)(y+j)=a+jk</cmath>  
 +
Using the previous example, <math>xy+66x-88y=23333</math> is the same as: <cmath>(x-88)(y+66)=(23333)+(-88)(66)</cmath>
 +
 
 +
 
 +
If this is confusing or you would like to know the thought process behind SFFT, see this eight-minute video by Richard Rusczyk from AoPS: https://www.youtube.com/watch?v=0nN3H7w2LnI. For the thought process, start from https://youtu.be/0nN3H7w2LnI?t=366
  
 
== Applications ==
 
== 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.
+
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.
 +
 
 +
== Fun Practice Problems ==
 +
===Introductory===
 +
*Two different [[prime number]]s between <math>4</math> and <math>18</math> are chosen. When their sum is subtracted from their product, which of the following numbers could be obtained?
 +
 
 +
<math> \mathrm{(A) \ 22 } \qquad \mathrm{(B) \ 60 } \qquad \mathrm{(C) \ 119 } \qquad \mathrm{(D) \ 180 } \qquad \mathrm{(E) \ 231 }  </math>
 +
 
 +
([[2000 AMC 12/Problem 6|Source]])
 +
 
 +
===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>.
 +
 
 +
([[1987 AIME Problems/Problem 5|Source]])
 +
 
 +
===Olympiad===
 +
 
 +
*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>
 +
 
 +
Prove that <math>N</math> is a perfect square.
 +
 
 +
Source: (British Mathematical Olympiad Round 3, 2005)
  
== Examples ==
+
== See More==
([[AIME]] 1987/5) <math>m</math> and <math>n</math> are integers such that <math>m^2 + 3m^2n^2 = 30n^2 + 517</math>. Find <math>3m^2n^2</math>.
+
* [[Algebra]]
 +
* [[Factoring]]
  
'''Outline Solution:''' Rearrange to <math>m^2 + 3m^2n^2 -30n^2= 517</math>. The key step is changing the equation to <math>m^2 + 3m^2n^2 -30n^2-10= 507</math>, where the equation factors to <math>(3n^2 + 1)(m^2 - 10) = 507 = 3\cdot 13^2</math>.  This makes things much simpler.  The rest of the problem is left as an exercise to the reader.
+
[[Category:Elementary algebra]]
 +
[[Category:Theorems]]

Revision as of 20:18, 12 January 2021

The General Statement

Simon's Favorite Factoring Trick (SFFT) is often used in a Diophantine(Positive) equation where factoring is needed. The most common form it appears is when there is a constant on one side of the equation and a product of variables with each of those variables in a linear term on the other side. A extortive example would be: \[xy+66x-88y=23333\]where $23333$ is the constant term, $xy$ is the product of the variables, $66x$ and $-88y$ are the variables in linear terms.


Let's put it in general terms. We have an equation $xy+jx+ky=a$, where $j$, $k$, and $a$ are integral constants. According to Simon's Favourite Factoring Trick, this equation can be transformed into: \[(x+k)(y+j)=a+jk\] Using the previous example, $xy+66x-88y=23333$ is the same as: \[(x-88)(y+66)=(23333)+(-88)(66)\]


If this is confusing or you would like to know the thought process behind SFFT, see this eight-minute video by Richard Rusczyk from AoPS: https://www.youtube.com/watch?v=0nN3H7w2LnI. For the thought process, start from https://youtu.be/0nN3H7w2LnI?t=366

Applications

This factorization frequently shows up on contest problems, especially those heavy on algebraic manipulation. Usually $x$ and $y$ are variables and $j,k$ are known constants. Also, it is typically necessary to add the $jk$ term to both sides to perform the factorization.

Fun Practice Problems

Introductory

  • Two different prime numbers between $4$ and $18$ are chosen. When their sum is subtracted from their product, which of the following numbers could be obtained?

$\mathrm{(A) \ 22 } \qquad \mathrm{(B) \ 60 } \qquad \mathrm{(C) \ 119 } \qquad \mathrm{(D) \ 180 } \qquad \mathrm{(E) \ 231 }$

(Source)

Intermediate

  • $m, n$ are integers such that $m^2 + 3m^2n^2 = 30n^2 + 517$. Find $3m^2n^2$.

(Source)

Olympiad

  • The integer $N$ is positive. There are exactly 2005 ordered pairs $(x, y)$ of positive integers satisfying:

\[\frac 1x +\frac 1y = \frac 1N\]

Prove that $N$ is a perfect square.

Source: (British Mathematical Olympiad Round 3, 2005)

See More

Invalid username
Login to AoPS