Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

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

(→‎Introduction: url)
(→‎The General Statement)
 
(151 intermediate revisions by 92 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 | 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 ==
+
== Applications ==
−
The general statement of SFFT is: <math>\displaystyle {xy}+{xk}+{yj}+{jk}=(x+j)(y+k)</math>. Two special cases appear most commonly: <math>\displaystyle xy + x + y + 1 = (x+1)(y+1)</math> and <math>\displaystyle xy - x - y +1 = (x-1)(y-1)</math>.
+
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. Sometimes, you have to notice that the variables are not in the form <math>x</math> and <math>y.</math> Additionally, you almost always have to subtract or add the <math>x, y,</math> and <math>xy</math> terms to one side so you can isolate the constant and make the equation factorable. It can be used to solve more than algebra problems, sometimes going into other topics such as number theory.
 +
 
 +
== 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===
 +
 
 +
==Problem 1==
 +
*If <math>kn+54k+2n+108</math> has a remainder of <math>4</math> when divided by <math>5</math>, and <math>k</math> has a remainder of <math>1</math> when divided by <math>5</math>, find the value of the remainder of when <math>n</math> is divided by <math>5</math>.
 +
 
 +
<math> \mathrm{(A) \ 1 } \qquad \mathrm{(B) \ 0 } \qquad \mathrm{(C) \ 4 } \qquad \mathrm{(D) \ 2 } \qquad \mathrm{(E) \ 3 } </math>
 +
 
 +
- icecreamrolls8
 +
 
 +
==Solution==
 +
We have solution <math>\boxed{(C)}</math>. Note that <math>kn+54k+2n+108</math> can be factored into <cmath>(k+2)(n+54)</cmath> using Simon's Favorite Factoring Trick. Now, look at n. Then, since the problem tells us that <math>k</math> has a remainder of <math>1</math> when divided by 5, we see that the <math>(k+2)</math> factor in the <math>(k+2)(n+54)</math> expression has a remainder of <math>3</math> when divided by 5. Now, the <math>(n+54)</math> must have a remainder of <math>3</math> when divided by <math>5</math> as well (because then the main expression has a remainder of <math>4</math> when divided by <math>5</math>). Therefore, since 54 has a remainder of <math>4</math> when divided by <math>5</math>, <math>n</math> must have a remainder of <math>4</math>, so that the entire factor has a remainder of <math>3</math> when divided by <math>5</math>.
 +
 
 +
- icecreamrolls8
 +
 
 +
==Problem 2==
 +
*<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]])
 +
 
 +
==Solution==
 +
<cmath>m^2 + 3m^2n^2 = 30n^2 + 517</cmath>
 +
<cmath>(m^2-10)(3n^2+1)=507</cmath>
 +
<cmath>507=13*39</cmath>
 +
<cmath>(3n^2+1)=13,(m^2-10)=39</cmath>
 +
<cmath>3m^2n^2=588</cmath>
 +
 
 +
==Problem 3==
 +
 
 +
([[2008 AMC 12B Problems/Problem 16|Source]]) A rectangular floor measures <math>a</math> by <math>b</math> feet, where <math>a</math> and <math>b</math> are positive integers with <math>b > a</math>. An artist paints a rectangle on the floor with the sides of the rectangle parallel to the sides of the floor. The unpainted part of the floor forms a border of width <math>1</math> foot around the painted rectangle and occupies half of the area of the entire floor. How many possibilities are there for the ordered pair <math>(a,b)</math>?
 +
 
 +
Solution: <math>A_{outer}=ab</math>
 +
 
 +
<math>A_{inner}=(a-2)(b-2)</math>
 +
 
 +
<math>A_{outer}=2A_{inner}</math>
 +
 
 +
<math>ab=2(a-2)(b-2)=2ab-4a-4b+8</math>
 +
 
 +
<math>0=ab-4a-4b+8</math>
 +
 
 +
By Simon's Favorite Factoring Trick:
 +
 
 +
<math>8=ab-4a-4b+16=(a-4)(b-4)</math>
 +
 
 +
Since <math>8=1\times8</math> and <math>8=2\times4</math> are the only positive factorings of <math>8</math>.
 +
 
 +
<math>(a,b)=(5,12)</math> or <math>(a,b)=(6,8)</math> yielding <math>\Rightarrow\textbf{(B)}</math> <math>2</math> solutions. Notice that because <math>b>a</math>, the reversed pairs are invalid.
  
−
== Applications ==
+
===Olympiad===
−
This factorization frequently shows up on contest problems, especially those heavy on algebraic manipulation. Usually <math>\displaystyle {x}</math> and <math>\displaystyle {y}</math> are variables and <math>\displaystyle j,k</math> are known constants. Also it is typically necessary to add the <math>\displaystyle {j}{k}</math> term to both sides to perform the factorization.
+
 
 +
*The integer <math>N</math> is positive. There are exactly <math>2005</math> ordered pairs <math>(x, y)</math> of positive integers satisfying:
 +
 
 +
<cmath>\frac 1x +\frac 1y = \frac 1N</cmath>
  
−
== Examples ==
+
Prove that <math>N</math> is a perfect square.
  
−
* [http://www.artofproblemsolving.com/Forum/viewtopic.php?p=454191#p454191 AIME 1987/5]
+
Solution: https://socratic.org/questions/given-the-integer-n-0-there-are-exactly-2005-ordered-pairs-x-y-of-positive-integ
  
−
*[[2000 AMC 12/Problem 6]]
+
Source: British Mathematical Olympiad Round 2 #1 https://bmos.ukmt.org.uk/home/bmo2-2005.pdf
  
−
== See Also ==
+
== See More==
 
* [[Algebra]]
 
* [[Algebra]]
 
* [[Factoring]]
 
* [[Factoring]]
−
* [http://www.artofproblemsolving.com/Movies/simon1.php AoPS's SFFT Video 1]
+
 
−
*[http://www.artofproblemsolving.com/Movies/simon2.php AoPS's SFFT Video 2]
+
[[Category:Number theory]]
 +
[[Category:Theorems]]

Latest revision as of 21:05, 16 October 2024

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. Sometimes, you have to notice that the variables are not in the form $x$ and $y.$ Additionally, you almost always have to subtract or add the $x, y,$ and $xy$ terms to one side so you can isolate the constant and make the equation factorable. It can be used to solve more than algebra problems, sometimes going into other topics such as number theory.

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

Problem 1

  • If $kn+54k+2n+108$ has a remainder of $4$ when divided by $5$, and $k$ has a remainder of $1$ when divided by $5$, find the value of the remainder of when $n$ is divided by $5$.

$\mathrm{(A) \ 1 } \qquad \mathrm{(B) \ 0 } \qquad \mathrm{(C) \ 4 } \qquad \mathrm{(D) \ 2 } \qquad \mathrm{(E) \ 3 }$

- icecreamrolls8

Solution

We have solution $\boxed{(C)}$. Note that $kn+54k+2n+108$ can be factored into \[(k+2)(n+54)\] using Simon's Favorite Factoring Trick. Now, look at n. Then, since the problem tells us that $k$ has a remainder of $1$ when divided by 5, we see that the $(k+2)$ factor in the $(k+2)(n+54)$ expression has a remainder of $3$ when divided by 5. Now, the $(n+54)$ must have a remainder of $3$ when divided by $5$ as well (because then the main expression has a remainder of $4$ when divided by $5$). Therefore, since 54 has a remainder of $4$ when divided by $5$, $n$ must have a remainder of $4$, so that the entire factor has a remainder of $3$ when divided by $5$.

- icecreamrolls8

Problem 2

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

(Source)

Solution

\[m^2 + 3m^2n^2 = 30n^2 + 517\] \[(m^2-10)(3n^2+1)=507\] \[507=13*39\] \[(3n^2+1)=13,(m^2-10)=39\] \[3m^2n^2=588\]

Problem 3

(Source) A rectangular floor measures $a$ by $b$ feet, where $a$ and $b$ are positive integers with $b > a$. An artist paints a rectangle on the floor with the sides of the rectangle parallel to the sides of the floor. The unpainted part of the floor forms a border of width $1$ foot around the painted rectangle and occupies half of the area of the entire floor. How many possibilities are there for the ordered pair $(a,b)$?

Solution: $A_{outer}=ab$

$A_{inner}=(a-2)(b-2)$

$A_{outer}=2A_{inner}$

$ab=2(a-2)(b-2)=2ab-4a-4b+8$

$0=ab-4a-4b+8$

By Simon's Favorite Factoring Trick:

$8=ab-4a-4b+16=(a-4)(b-4)$

Since $8=1\times8$ and $8=2\times4$ are the only positive factorings of $8$.

$(a,b)=(5,12)$ or $(a,b)=(6,8)$ yielding $\Rightarrow\textbf{(B)}$ $2$ solutions. Notice that because $b>a$, the reversed pairs are invalid.

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.

Solution: https://socratic.org/questions/given-the-integer-n-0-there-are-exactly-2005-ordered-pairs-x-y-of-positive-integ

Source: British Mathematical Olympiad Round 2 #1 https://bmos.ukmt.org.uk/home/bmo2-2005.pdf

See More

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Simon%27s_Favorite_Factoring_Trick&oldid=230042"