Simon's Favorite Factoring Trick

Revision as of 00:13, 24 August 2008 by Mrosett (talk | contribs)
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.

Statement of the factorization

The general statement of SFFT is: ${xy}+{xk}+{yj}+{jk}=(x+j)(y+k)$. Two special cases appear most commonly: $xy + x + y + 1 = (x+1)(y+1)$ and $xy - x - y +1 = (x-1)(y-1)$.


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 ${j}{k}$ term to both sides to perform the factorization.



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) \ 21 } \qquad \mathrm{(B) \ 60 } \qquad \mathrm{(C) \ 119 } \qquad \mathrm{(D) \ 180 } \qquad \mathrm{(E) \ 231 }$



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



This problem has not been edited in. If you know this problem, please help us out by adding it.

See Also

Invalid username
Login to AoPS