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

(→See Also) |
The legend (talk | contribs) (→The General Statement) |
||

(77 intermediate revisions by 51 users not shown) | |||

Line 1: | Line 1: | ||

− | |||

− | The | + | ==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: <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>jk</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. | ||

− | == Problems == | + | == Fun Practice Problems == |

===Introductory=== | ===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? | *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) \ | + | <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]]) | ([[2000 AMC 12/Problem 6|Source]]) | ||

+ | |||

===Intermediate=== | ===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>. | *<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]]) | + | ([[1987 AIME Problems/Problem 5|Source]]) NERD |

+ | |||

===Olympiad=== | ===Olympiad=== | ||

− | |||

− | == See | + | *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) | ||

+ | |||

+ | == See More== | ||

* [[Algebra]] | * [[Algebra]] | ||

* [[Factoring]] | * [[Factoring]] |

## Revision as of 19:52, 26 March 2021

## Contents

## 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: where is the constant term, is the product of the variables, and are the variables in linear terms.

Let's put it in general terms. We have an equation , where , , and are integral constants. According to Simon's Favourite Factoring Trick, this equation can be transformed into:
Using the previous example, is the same as:

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 and are variables and are known constants. Also, it is typically necessary to add the term to both sides to perform the factorization.

## Fun Practice 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) NERD

### Olympiad

- The integer is positive. There are exactly 2005 ordered pairs of positive integers satisfying:

Prove that is a perfect square.

Source: (British Mathematical Olympiad Round 3, 2005)