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

## The General Statement For Nerds

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

• If n^2
• 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) NERD

• 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.
{"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 26, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0}